# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1155406 | kitkat12 | Race (IOI11_race) | C++20 | 4 ms | 9024 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define mp make_pair
#define pb push_back
#define li(i,a,b) for(int (i) = (a); (i)<(b); i++)
#define all(v) v.begin(), v.end()
#define mem(name, val) memset(name, val, sizeof(name))
#define endl '\n'
const int nmax = 2e5+3;
const int kmax = 1e6+3;
int n,k,ans, cnt[kmax], sz[nmax], r[nmax];
vector<pii> adj[nmax];
int dfs_sz(int v, int p = -1){
sz[v]=1;
for(auto [u,len] : adj[v]){
if(u == p || r[u]) continue;
sz[v] += dfs_sz(u,v);
}
return sz[v];
}
int get_center(int v, int ts, int p = -1){
for(auto [u,len] : adj[v]){
if(u == p || r[u]) continue;
if(sz[u] * 2 > n) return get_center(u,ts,v);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |