Submission #414037

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
414037	2021-05-29 19:29:11	ritul_kr_singh	Village (BOI20_village)	C++17	100 / 100	123 ms	19772 KiB

Village

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 <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
const int MAXN = 1e5;
int n, s[MAXN], c, ans[2][MAXN], ansMax = 0, ansMin = 0;
vector<int> g[MAXN], a[MAXN];
void find(int u){
  int mx = 0; s[u] = 1;
  for(int v : g[u]){
    if(s[v]) continue;
    find(v), s[u] += s[v];
    mx = max(mx, s[v]);
    ansMax += min(n - s[v], s[v]);
    if(ans[0][v] == v) swap(ans[0][u], ans[0][v]), ansMin += 2;
  }
  if(max(mx, n - s[u]) <= n/2) c = u;
}
void add(int u, int p, vector<int> &b){
  b.push_back(u);
  for(int v : g[u]) if(v != p) add(v, u, b);
}
signed main(){
  cin.tie(0)->sync_with_stdio(0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 38 / 38
• Subtask 3: 50 / 50