ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1156. Two Rounds

WA#3
Posted by @ntiFreeze 25 Feb 2007 14:34
it seems that my program has no bug. it pass all test on board and all my tests.
I bicolored graph. then used DP to find answer but I got WA3.

***

I have found mistake. AC now!

this test helped me very much:
50 2
99 100
98 99

Edited by author 25.02.2007 19:13
Re: WA#3
Posted by ChBlossom 21 Sep 2007 14:22
This test is really helpful to me.
Thx a lot.
Re: WA#3
Posted by Oracle 25 Mar 2008 13:15
really helpful test!
Re: WA#3
Posted by Rumter (2) 13 Jul 2008 16:07
thanks:)
Re: WA#3
Posted by Rumter (2) 15 Jul 2008 17:52
((( my DP get WA3 but brute force get AC
Re: WA#3
Posted by данные 29 Dec 2008 18:38
There is no testdata like this!
I didn't Consider it and ACed now.
So I think the problem number is in [1,2n]
Re: WA#3
Posted by Xie Xnot 30 Dec 2008 10:46
great case!
Re: WA#3
Posted by Nisarg Shah 4 Jan 2009 18:56
For all those who got WA#3 with dfs and DP,
The case given here didn't help me but
2 1
1 3
helped me.

Notice that when you are selecting whether white part is to be selected or black part, and pushing the result in a vector or queue, due to DP, last part gets inserted first. So you have to consider that first result in the vector/queue is for the last pair of partition.

May be this will help...

Edited by author 04.01.2009 19:08

Edited by author 04.01.2009 19:08