Search found 5 matches

by ree975
Mon Mar 09, 2015 8:49 am
Forum: Bugs and suggestions
Topic: 334 - Identifying Concurrent Events.. PE!!
Replies: 10
Views: 10071

Re: 334 - Identifying Concurrent Events.. PE!!

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...
by ree975
Sun Feb 08, 2015 12:19 pm
Forum: Volume 115 (11500-11599)
Topic: 11504 - Dominos
Replies: 55
Views: 20614

Re: 11504 - Dominos

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>...
by ree975
Fri Feb 06, 2015 2:09 pm
Forum: Volume 101 (10100-10199)
Topic: 10199 - Tourist Guide
Replies: 57
Views: 31037

Re: 10199 - Tourist Guide

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.

Code: Select all

Removed after AC, I made some mistake in implementing tarjan algo.
Thanks brianfry!
by ree975
Wed Jan 21, 2015 6:22 pm
Forum: FAQ
Topic: can't enter the web page
Replies: 2
Views: 5179

Re: can't enter the web page

Having the same problem...
I thought it was my network's problem.
by ree975
Sun Apr 06, 2014 4:22 pm
Forum: Volume 7 (700-799)
Topic: 714 - Copying Books
Replies: 29
Views: 19564

Re: 714 - Copying Books

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...

Go to advanced search