OJ Board

Hey, when all nodes degree is 1 i automatically output "I am superman", or when there is one node with 2 degree, i check if it makes it acyclic by visiting the first node, and then the second node?

This code gives me TLE http://codepad.org/MJ3c9OGF (in this code the first theory, when all nodes ...

So you should find the cycle which is equal to the number of vertices by visiting them at most once?

I don't know why but I'm not able to understand those graph problems. Do you think i am the problem or problem description is not so good ? And can you give me some guide to improve the ability of understanding the problem.

Yes, i understood that but can you explain me the condition ?

Dude, can you explain me the problem, i am not able to understand it by reading the problem description

Run DFS from each node, after each run, check if you have visited all the nodes, if yes, tmp++ and at the end, if tmp == n print YES otherwise NO.

What's wrong with my code ? Any tricky case ?


#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>

#define maxn 16
#define inf 1000

using namespace std;

struct edge {
int v, w;
edge () {}
edge (int _v, int _w) : v(_v), w(_w ...