OJ Board

Thanks Abednego. It was really an important information about the make_heap(). I think STL should not be like this, it should work in the best way. Whatever, now I use priority Q and got AC.

I think there is nothing to do with the algorithm to make the solution faster. Because everybody talked here tried or solved it with dijkstra. But i m getting TLE for my dijkstra. So I m giving my dijkstra code here so that anybody can give me any hint to make my code faster.



#include<cstdio ...

Thanks mf. U helped a lot. Now I got it AC. I knew that there is a solution using max-flow in a bipartite graph, but i could not emagine the bipartite graph, i mean what the elements would be in the partitations of the bipartite graph, now i understand, thanks a lot.

thanks mf for your reply
I was mistaken. Now i have fixed it.
For that input now my program gives

1 2 5 4 3 2 6 4 1

1 2 5 3 1 3 2 5 6 3 4 6 4 1

1 2 5 3 1 3 2 5 6 3 4 6 4 1

1 2 3 4 5 6 1 2 3 4 5 6 1

1 2 3 1 4 5 1

1 2 3 4 1

1 2 1 4 3 2 3 4 1

1 3 4 2 5 6 5 4 1

No euler circuit ...

getting WA
I have tried my program with the following IO

Input:
9

6 8
1 2 U
2 3 U
3 4 U
4 5 U
2 5 D
2 6 U
6 4 U
4 1 U

6 13
1 2 U
1 3 U
1 3 U
1 4 U
2 3 U
2 5 D
2 5 U
5 3 D
5 6 U
6 3 U
4 6 U
4 6 U
3 4 U


6 13
1 2 U
1 3 U
1 3 U
1 4 U
2 3 U
2 5 D
2 5 U
5 3 D
5 6 U
6 3 D
4 6 U
4 6 U
3 4 U

6 12
1 2 ...

getting WA

i tried my prog with the following IO



input
8
2 4 5
1 3
2 4 7
1 5 6 8 7 3
1 4 6
5 4 8
3 4
4 6
0

8
2
1 3
2 4 5 6
3 7 8
3
3
4 8
4 7
0

5
5 1 2 3 4
0
6
2 1 3
5 4 6 2
0

5
2
3
4
5
0

5
2 3 4 5
3 1
2 1
1 5
1 4
0

6
2 3
1 4
1 4 5
2 3 6
3 5
4 5
0

9
1 2
2 3
2 5
5 4 6 8
7 8
9 8
0

3
1 2
3 ...

getting WA
I have tried my program with the following IO

input:
5
1 1 1 1 1
2 3 1 2 3
5
2 3 1 2 3
3 3 3 3 3
5
1 1 1 1 1
3 3 3 3 3
5
1 1 1 1 1
3 1 2 2 1
6
1 1 1 2 2 2
2 2 2 3 3 3
9
1 2 3 3 2 1 1 2 3
3 2 1 1 2 3 3 2 1
4
1 1 1 1
2 2 2 3
4
1 1 1 2
1 1 1 3
4
1 1 1 1
1 1 1 1
3
1 1 1
2 2 2
3
1 2 3
3 2 1 ...