POJ 2492 A Bug's Life

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int maxn = 2001;
//Accepted	8908K	766MS	G++	1198B	2014-03-19 15:51:41
vector<int> G[maxn+10];

int color[maxn+5];

bool work(int u) {
	for(int i = 0; i < (int)G[u].size(); i++) {
		int v = G[u][i];
		if(!color[v]) {
			color[v] = 3 - color[u];
			if(!work(v)) return false;
		}
		if(color[v] == color[u]) return false;
	}
	return true;
}

int gn, gm;
int main()
{
	int T;
	int x, y;
	scanf("%d", &T);
	for(int t = 1; t <= T; t++) {
		scanf("%d%d", &gn, &gm);
		for(int i = 0; i < maxn; i++) G[i].clear();
		for(int i = 0; i < gm; i++) {
			scanf("%d%d", &x, &y);
			G[x].push_back(y);
			G[y].push_back(x);
		}
		memset(color, 0, sizeof(color));
		bool result;
		for(int i = 1; i <= gn; i++) {
			if(!color[i]) {
                color[i] = 1;
				result = work(i);
				if(!result) {
					break;
				} else continue;
			}
		}
		if(result) {
            printf("Scenario #%d:\n", t);
            printf("No suspicious bugs found!\n");
		} else {
			printf("Scenario #%d:\n", t);
			printf("Suspicious bugs found!\n");
		}
		if(t != T) printf("\n");
    }
    return 0;
}