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

This test is really helpful to me.
Thx a lot.

really helpful test!

thanks:)

((( my DP get WA3 but brute force get AC

There is no testdata like this!
I didn't Consider it and ACed now.
So I think the problem number is in [1,2n]

great case!

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