/
BAEKJOON 13023
51 lines (47 loc) · 1.2 KB
/
BAEKJOON 13023
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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class Main {
static int N, M, ans;
static boolean[] visit;
static ArrayList<Integer>[] list;
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());
M = Integer.parseInt(st.nextToken());
visit = new boolean[N];
list = new ArrayList[N];
for (int i = 0; i < N; i++) {
list[i] = new ArrayList<>();
}
for (int i = 0; i < M; i++) {
st = new StringTokenizer(br.readLine());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
list[a].add(b);
list[b].add(a);
}
for (int i = 0; i < N; i++) {
dfs(i, 0);
if (ans == 1)
break;
}
System.out.println(ans);
}
private static void dfs(int index, int cnt) {
if (cnt == 4) {
ans = 1;
return;
}
visit[index] = true;
for (int i = 0; i < list[index].size(); i++) {
int next = list[index].get(i);
if (!visit[next]) {
dfs(next, cnt + 1);
}
}
visit[index] = false;
}
}