Submission #894630

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
894630	2023-12-28 14:38:52	amirhoseinfar1385	Capital City (JOI20_capital_city)	C++17	100 / 100	617 ms	36576 KiB

capital_city

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;
const int maxn=200000+10;
vector<int>adj[maxn],allc[maxn];
int n,k,val[maxn],sz[maxn],part[maxn],visc[maxn],vis[maxn],now[maxn],rishe,res;
void calsz(int u,int par=0){
  now[u]=rishe;
  part[u]=par;
  visc[val[u]]=0;
  sz[u]=1;
  for(auto x:adj[u]){
    if(vis[x]==0&&x!=par){
      calsz(x,u);
      sz[u]+=sz[x];
    }
  }
}
int findcen(int u,int su,int par=0){
  for(auto x:adj[u]){
    if(vis[x]==0&&x!=par&&sz[x]*2>su){
      return findcen(x,su,u);
    }
  }
  return u;
}
void solve(int u){
  if(now[u]==-rishe){
    return ;
  }
  if(now[u]!=rishe){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 59 / 59