# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
60114 | naderjemel | Race (IOI11_race) | C++14 | 1136 ms | 98020 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>
using namespace std;
#define fi first
#define se second
#define MAX_N 200000
#define MAX_K 1000000
vector<vector<pair<int,int> > > adj;
int n,k,nn;
bool pross[MAX_N];
int sub[MAX_N],cnt;
int dist[MAX_K],book[MAX_K],bk,rs;
int dfs(int u, int p){nn++;
sub[u]=0;
for(pair<int,int> i:adj[u]){
if(!pross[i.first] && i.first!=p){
dfs(i.first,u);
sub[u]+=1+sub[i.first];
}
}
return sub[u];
}
int find(int u, int p){
for(pair<int,int> i:adj[u]){
if(!pross[i.fi] && i.fi!=p && sub[i.fi]>nn/2){
return find(i.fi,u);
}
}
return u;
}
void check(int u, int p, int ed, int d){
# | 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... |