[BOJ] 13023 ABCDE

Time Lapse :15min 18sec

13023.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
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
vector<int> g[2001];
bool v[2001], ans;
int n, m, f, e;
void dfs(int cur ,int d) {
if(d == 5 || ans) {
ans = true;
return;
}
v[cur] = true;
for(int val : g[cur])
if(!v[val])
dfs(val, d + 1);
v[cur] = false;
}
int main(void) {
scanf("%d %d", &n, &m);
for(int i = 0; i < m; ++i) {
scanf("%d %d",&f, &e);
g[f].push_back(e);
g[e].push_back(f);
}
for(int i = 0; i < n && !ans; ++i)
dfs(i, 1);

printf("%d ", ans ? 1 : 0);
}
Author: Song Hayoung
Link: https://songhayoung.github.io/2020/08/26/PS/BOJ/13023/
Copyright Notice: All articles in this blog are licensed under CC BY-NC-SA 4.0 unless stating additionally.