# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167355 | SG2Alok | Race (IOI11_race) | C++20 | 352 ms | 30532 KiB |
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
int sz[200005], mins[1000005];
bool vis[200005];
vector<pair<int, int>> adj[200005];
int ans = 1e9, k;
int dfs(int u, int par){
if(vis[u]) return 0;
sz[u] = 1;
for(auto v: adj[u]){
if(v.fi != par){
sz[u] += dfs(v.fi, u);
}
}
return sz[u];
}
int ctr(int u, int par, int szz){
for(auto v: adj[u]){
if(v.fi == par) continue;
if(!vis[v.fi] && sz[v.fi] * 2 > szz){
return ctr(v.fi, u, szz);
# | 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... |