-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path11581.cpp
52 lines (42 loc) · 989 Bytes
/
11581.cpp
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
int xxxx[]={-1,0,1,0,-1,1,1,-1};
int yyyy[]={0,1,0,-1,-1,1,-1,1};
vector<vector<int>> edges(100);
bool visited[101];
bool dfs(int x) {
for (auto nx : edges[x]) {
if (visited[nx]) return false;
visited[nx] = true;
if (!dfs(nx)) return false;
visited[nx] = false;
}
return true;
}
void solve(){
int N; cin >> N;
for (int i = 1; i < N; i++) {
int a; cin >> a;
while (a--) {
int t; cin >> t;
edges[i].push_back(t);
}
}
cout << (dfs(1) ? "NO CYCLE" : "CYCLE");
}
int main()
{
cin.tie(0)->sync_with_stdio(false);
int T=1;
// cin >>T;
while (T--) {
solve();
cout << '\n';
}
return 0;
}