OJ Board

>>andysoft

My Accepted code gives the same output.

regards,
Monish

try this case
Input: My AC output: hope this helps..

>>Vytenis
thx for ur reply. I found my mistake. i will try it another way..

still i am getting WA.anyone please check the following I/O.. 15 3 5 0 7 9 11 12 4 2 6 8 12 5 4 5 8 9 12 20 5 2 0 19 3 0 18 19 2 15 16 3 14 15 19 3 18 19 2 50000 30 5 4 8 6 7 9999 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 1 2 3 4 1 5 8 6 3 ...

I have been trying this prob but getiing WA many times.anyone please check my code and tell me what is wrong here..
here is my code..
removed...

>>SerailHydra
SG value for this trree subgames are 2,0and 1.
>>Leonid
I don't know is there any similar probs in UVA.But u can try this prob https://www.spoj.pl/problems/TRIOMINO/ in spoj.it is quite similar this one..

try this case..
Input: Output: hope this helps..

suppose u r playing 3 nim games here 1. ..O 2. O.X 3. X. each game canbe represented by three values.first length of the game , second value on the left side and third value on the right side. for each game u can place a X or O in positions from 0 to len-1 and split the game into 2 subgames.The grun...

>>baodog
thx for ur help. Now i have got AC.. Silly mistake in my coding..

I am getting WA in this prob. Anyone please check the following cases or give any tricky case. Input 12 .. ........................ .....X...O....XO . ...XOXOXOXO ...X..........O...X....O..O.....X....XO XOXO ...XOX ............................................................ XOXOXOXOXOXOXOXOXO.........

u wouldn't need to check this condition.

>>sabir
my algorithm is same as ur's. I think u should use efficient data structure for ur check() function. in worst case ur complexity is O(n^2) where n = 100000. For this i use stl map. Hope this helps u.....

>>azk84
thx for ur reply.silly mistake in my lexiographic compare function.My AC time is 2.110 sec but some people solve this
prob in less than 0.1sec. I want to know the better approach for this prob.anyone help me please....

I checked a lot of small cases but couldn't find any wrong.Anyone please give me some tricky case..

But my time is something about 0.880, and I see guys with absolute zero time and 0.020 and so on. My question is, how to improve the solution so that it counts answer in such a minimal time? What solution method was used to get such a small time? I used link list(manually by pointer) which takes .1...