OJ Board

2 6 2 8 4 12 14 1 10 13 15 3 9 11 0 5 7 6 8 4 2 12 14 1 10 13 15 3 9 11 0 5 7 The second test case is quite good because it doesn't depend of the order of direction in which you expand where as the second one does. My AC solution passes the first one but fails the second one but there are solutions...

2 6 2 8 4 12 14 1 10 13 15 3 9 11 0 5 7 6 8 4 2 12 14 1 10 13 15 3 9 11 0 5 7 The second test case is quite good because it doesn't depend of the order of direction in which you expand where as the second one does. My AC solution passes the first one but fails the second one but there are solutions...

suneast wrote: ↑Thu May 20, 2010 4:38 pm u can just asume that N is not larger than 10000
I solved this PRO use O(N^2) BRUTE FORCE...

Mukit Chowdhury wrote: ↑Wed Mar 13, 2013 5:50 pm In this problem array of 1500 elements is enough... no need to check negative number ... My algo is of O(n*n) and Accepted in 0.068 second...

Number of buildings N is at most 1121.

Input data of fourth case is not correct. Age of bachelor and spinster should be between 2..60. Each of the next B lines contains one integer between 2 and 60 (inclusive) which denotes the age of one bachelor in the community. Each of the next S lines contains one integer between 2 and 60 (inclusive...

Second input (exactly 6, 7, 8, 9, 12, 13, 15, 17 test cases) on uDebug named by "Online Uva judge" is not correct. Because creature's names are listed in one line. But according to problem's description they should be on C lines, where C is number of creatures. Follow C lines with the name...

brianfry713 wrote: ↑Sat Nov 05, 2011 2:06 am There are no more than 1000 arrays in the test input.

Number of arrays is not more than 5.

Although this is not clearly mentioned in the problem statement, the following is probably true: If there exists one word in the dictionary there can exist several #'s in the input; otherwise, if there exist several words in the dictionary, there exists no more than one # in the judge's input. Why ...

Got wa. Need some critical input. Why for input above udebug(UVa Online Judge's solution) gives output Two seeking kids see each other. So output should 1 for each kid. Is this bug?

Solved with dp. My previous dp approaches gave me TLE.

Memory : 244*800*12, where 244 = 61 * 4 (4 is maximum frequency).
Time___: 244*800*12, for each block of input.

For input My acc prog gives

When I made Sumup the primes I intended people to use backtracking with constraints to solve this problem but they got away with more conventional dynamic programming approach so I have made sum up the primes (II) so they have to use backtracking with constraints to solve this problem :wink:, so th...

Solved 10447 with DP in 0.820.

Now for Jujuedv's test case uDebug gives correct answer 6. Some information that may be relevant for anyone working on this problem: my code passed even though it returned different results for the test input of Morass in uDebug. Concretely the following lines differed: Line 494 -> uDebug 53, Mine 5...

My code accepted in 0.020. My sieve is similar to yours, but it's not bitwise. You can optimize second step. I precalculated all the results without factorization. I calculate it in O(1000000) with only one loop. I used array cnt[1000001], instead of variable cnt. For each N from 2 to 1000000 store ...

If you assume that square field can have size 1000x1000 , then you should also assume that number of cells with color 1 or color 3 can be at most 999999 . But your arrays xo, yo, xt, yt have size only 1000 . You should get RE in this case, but not always. Sometimes you get WA. I checked that size of...