Submission #4273

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
4273	2013-09-10 02:16:34	jays	Cactus? Not cactus? (kriii1_C)	C++98	1 / 1	68 ms	13728 KiB

C

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int N, M;
vector<int> adj[100001];
int depth[100001];
bool isCactus = true;
int dfs(int to, int from, int d) {
  int numBack = 0;
  int ret = depth[to] = d;
  for (int i = 0 ; i < adj[to].size(); ++i) {
    int next = adj[to][i];
    if (next == from) continue;
    if (depth[next] != -1 && depth[next] < depth[to]) {
      numBack++;
      ret = depth[next];
    }
    if (depth[next] != -1) continue;
    int res = dfs(next, to, d + 1);
    // printf("res: %d, depth[to]: %d\n", res, depth[to]);
    if (res <= depth[to]) {
      numBack++;
      ret = min(ret, res);
    }
  }
  if (numBack > 1) isCactus = false;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1