OJ Board

WA.
My algo -
1.use tarjan to find the scc dag
2. build dag graph
3. visit the nodes in the dag in topological order and visit the connected nodes
4. all the nodes in the dag, that act as a starting point for the dfs() call are the answers.
5. list all the nodes of the answers, sort them and show ...

Getting WA

Thanks a lot for the reply brianfry

Changed that but still WA

Getting WA

Could someone clarify the problem statement for me? From what I understand it is either

a) Find an important station form which the cost of visiting all other stations is minimum --(if multiple answers)--> Find the important station from which the cost of visiting all other important stations is ...

brianfry713 wrote:Don't use getchar() and count on it to be a newline. That won't work if there are extra spaces in the input file.

Thanks a lot. I changed the scanf-getchar to a gets-sscanf and got AC.

Removed