OJ Board

Dorian Wood from Fremont was looking for the 7 essentials to writing a killer gamsat essay

Demarco Maguire found the answer to a search query the 7 essentials to writing a killer gamsat essay



http://essayerudite.com/images/banner/500x500.jpg


essay writing service ...

This problem can be solved by simple DFS.

I used Tarjan's SCC Algorithm to find the number of SCC in the given graph. The answer is 1 if number of SCC is 1, else the answer is 0. Now this gives WA and I can't find why. So please help me. This is the first time I'm doing SCC.

#include <bits/stdc++.h>

using namespace std;

#ifdef __GNUC ...

This problem also sloved by simple dfs or mst

your implementation of tarjans algorithm is not correct.
see http://en.wikipedia.org/wiki/Tarjan's_strongly_connected_components_algorithm
there are some pop operations you are missing

int pp;

void tarjan( int x ){
ind[ x ] = c;
low[ x ] = c;
c ++;
node.push( x );
for( int i = 1; i <= N; i ...

#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cctype>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<sstream>
#include<vector>
using namespace std;

typedef vector<int> vi;
typedef vector< vi > vii;
typedef ...

Thanks Got accepted now. I did a silly pen mistake.

Well, You can simply use Floyd-Warshall to get AC in this question, that will suffice for it

Regards,
SITZ

I used tarjan's algorithm. I am getting wrong answer. I spent a lot of time to this but did not get the reason. Can any one help me to fix my error.

Here is my code:

Floyd should get TLE with a good data set.

May be bad tests there....((
Or you make a mistake in complexity of your algo...
Your implementation with queue got TLE,because it's O(N^3)!

Well, I thought the same way, but, actually it did pass
For ur belief you can check the verdict of judge here : http://felix-halim.net/uva/hunting.php? ... hrivastava

I couldn't belive that Floyd could get Ac here....
it complexity O(n^3), where n=2000, how it could be pass at 2 sec???

Hi Igor9669 !
But, I don't understand how people can't understand the simple question that I have posted here :(
I said I have got Accepted with a time of around 0.338 s using Floyd-Warshall Algorithm...

I just wanted to ask if the above implementation using queues can be optomized to get Ac or ...

Certanly you will get TLE on this problem with Floyd!

It could be solve with simple dfs or bfs with little modification!