제출 #4150

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
4150	2013-09-02 12:42:54	pys7293	Cactus? Not cactus? (kriii1_C)	C++98	1 / 1	76 ms	15104 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 <algorithm>
#include <cstdio>
#include <map>
#include <memory.h>
#include <vector>
using namespace std;
int N, M;
int Lv[111111], C;
int Lo[111111];
int Chk[111111];
int P[111111];
vector<vector<int> > L;
void DFS(int i, int PP)
{
  if (Lv[i] == 0) Lv[i] = Lo[i] = ++C;
  for (int j = 0; j < L[i].size(); j++) {
    if (PP == L[i][j]) continue;
    if (Lv[L[i][j]] == 0) {
      P[L[i][j]] = i;
      DFS(L[i][j], i);
      Lo[i] = min(Lo[i], Lo[L[i][j]]);
      if (Lv[i] < Lo[L[i][j]]) Chk[L[i][j]] = true;
    } else Lo[i] = min(Lo[i], Lv[L[i][j]]);
  }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1