OJ Board

Hi. I've been trying to solve this problem, but when I try the test cases in Waterloo's web page http://plg1.cs.uwaterloo.ca/~acm00/080927/data/D.6.dat, my code gives an answer only for the two firt cases.

First, I find all the connected components and then I see if a connected component affects ...

Hi, I'm getting wrong answer with this code, could you tell me what's my mistake?


#include<iostream>
#include<queue>
#include<map>

using namespace std;

int n,s;
int longest;
int destiny;
int visited[101];

vector< vector<int> > L(101);

void bfs(){
queue< pair<int,int> > Q;
Q.push(make_pair(s ...