OJ Board

I followed the advice and generate the right output Case 1, 2 concurrent events: (e1,e4) (e2,e4)_ Case 2, 10 concurrent events: (two,four) (two,five)_ Case 3, no concurrent events. Case 4, 1 concurrent events: (alpha,gamma)_ However I still got PE, does anybody know why? Then I tried all the combina...

I could pass the input on the board, but getting TLE. Using Tarjan's algorithm find for SCC and use adjacent nodes to count InDeg. Any advice will be appreciated! thanks! (comment code is that I tried to use map instead of bool[] to save some time, but seems in vain) #include<iostream> #include<set>...

Is there anyone could help me? I passed all the test case in this discussion thread but still get WA.
I used "map" to achieve alphabetical order and cin.peek() to know whether to cout endl or not.

Having the same problem...
I thought it was my network's problem.

My accepted code returns.. Output My ans is different from yours, but I also get AC. :lol: Take a look~ 9 8 / 1 7 6 / 2 3 4 5 1 / 2 1 10 / 2 10 2 15 / 20 / 1 30 46 18 71 6 35 / 59 35 52 83 / 62 85 71 / 72 88 46 / 100 8 5 89 / 85 61 80 / 59 43 39 51 31 / 100 90 40 198429 225879 / 591107 583645 26850...