UVa OJ Board

szymcio2001

We don't know. It depends on local organizers and next year IOI will be organized in other country.

szymcio2001

This year's International Olympiad in Informatics will be accompanied by an Online Contest hosted at http://sio.mimuw.edu.pl/ioi2005/ . Posted tasks will be exactly the ones used during the real competition and will be graded using the same test data. Everybody is welcome to participate. Please regi...

szymcio2001

If you have already solved this problem, maybe it will help somebody else. My accepted solution gives: 56 12 521 269 651 533 471 388 693 658 619 252 675 601 492 356 55 169 398 227 245 737 450 199 27 40 407 502 525 542 545 245 576 454 389 126 545 638 648 495 354 684 609 722 707 507 223 461 304 677 28...

szymcio2001

shamim wrote:if more than one writing rule works for a particular character [...]

It's impossible.

szymcio2001

ok then, could any one explain to me what this means, As we mentioned above, the word can be written in any of n cyclic shifted forms. The output file contains the lexicographically smallest word, assuming that a < b. For example - if your computet output is 'bbaaba' you should output it as 'aababb'

szymcio2001

shamim wrote: could someone give me a few more test cases.
Thanks.

Code: Select all

  
16
aabaabbaababbbba
aaab
aaba
abab
abba
baaa
babb
bbab
bbba
2000000000

My Acc solution gives:

Code: Select all

aabbbbbbabbbbbbb

[/code]

szymcio2001

For all who still have TLE:
My problem was that I thought that there must be a blank line after description of mouse doors, but there needn,t.

szymcio2001

okay I have no idea about NP-complete problems nor any algo to solve them. Can anyone share something to help me especially on this problem? Is there any way besides backtracking? thx!! In this problem you should write some "simulation" algorithm. Simply write a program that randomly choose nodes (...

szymcio2001

seg10 wrote:I have what I believe is a DP solution to the problem.

In this problem I've made a graph (edge A->B if A nests in B) and then used graph search in topological order (I think it's a bit DP solution).

szymcio2001

WR wrote:The program reproduces all output as it should be, following the posts.
Nevertheless I still get WA.

It's a multiple input problem.

szymcio2001

bery olivier wrote:I guess the easier is 272 : Tex quotes

I think that 10055 is easier

szymcio2001

ram wrote:I also used STL for solving this problem. But getting a TLE. Is anything wrong with the input or our algo?

I also got TLE when using <string>. After changing strings to char* I got Acc in 6 sec. And I had my own hash table.

szymcio2001

gvcormac wrote: Is it possible that t was declared to be an integer?

No. Before and after change it was a double.

szymcio2001

Farid Ahmadov wrote: This problem took me nearly 2 or 3 hours and I tried everything

I have also spent many time on this problem, but my problem was that I was calculating formula:
t = r / 2;
area = pi * t * t / 2;

When I changed to:
t = r;
area = pi * t * t / 8;
It got accepted.

szymcio2001

Simply search the board. At the top of the page you have some links (FAQ, search, users, etc.) so click search and look for problem 102 - there are many messages on this problem on the board.
Good luck!

UVa OJ Board

Search found 38 matches

IOI'05 electronic online contest

Re: 517 Word

Re: 193 Graph coloring algo

Re: 103: wrong answer? frustrated

Re: 756 Biorythms Pascal

Re: Same is the case with me