-
Notifications
You must be signed in to change notification settings - Fork 0
/
위클리 챌린지 9주차.cpp
47 lines (44 loc) · 1.01 KB
/
위클리 챌린지 9주차.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
// 문제 링크 : https://programmers.co.kr/learn/courses/30/lessons/86971
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define forn(i,n) rep(i,0,n)
#define eb emplace_back
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
vvi g;
vi cnt;
vb visited;
int dfs(int cur){
int size = g[cur].size();
forn(i,size){
int next = g[cur][i];
if(visited[next]) continue;
visited[next]=true;
cnt[cur]+=dfs(next);
}
return cnt[cur];
}
int solution(int n, vector<vector<int>> wires) {
int size = wires.size();
cnt.resize(n+1);
visited.resize(n+1);
g.resize(n+1);
forn(i,n+1){
cnt[i]=1;
visited[i]=false;
}
forn(i,size){
g[wires[i][0]].eb(wires[i][1]);
g[wires[i][1]].eb(wires[i][0]);
}
visited[1]=true;
dfs(1);
int ans = (int)1e9;
rep(i,1,n+1){
int cur = cnt[i];
ans = min(ans, max(n-cur,cur)-min(n-cur,cur));
}
return ans;
}