# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96122 | igzi | Race (IOI11_race) | C++17 | 522 ms | 37116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define maxK 1000006
#define maxN 200005
using namespace std;
vector <pair<int,int>> adj[maxN];
vector <int> all;
long long dis[maxK],s[maxN],ans=INT_MAX,k;
bool mar[maxN];
void dfs0(int n,int par){
s[n]=1;
for(int i=0;i<adj[n].size();i++){
int x=adj[n][i].first;
if(x==par || mar[x]) continue;
dfs0(x,n);
s[n]+=s[x];
}
}
int cen(int n,int par,int S){
for(int i=0;i<adj[n].size();i++){
int x=adj[n][i].first;
if(x==par || mar[x]) continue;
if(s[x]>S/2) return cen(x,n,S);
}
return n;
}
Compilation message (stderr)
# | 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... |