# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
782805 | berr | Race (IOI11_race) | C++17 | 288 ms | 36236 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>
#include "race.h"
using namespace std;
const int N = 2e5+37;
int mi = 1e7, n, k, p;
vector<array<int, 2>> adj[N];
vector<int> s(N), vis2(N);
vector<int> best((int)1e6+37, 1e7);
vector<array<int, 2>> mp;
vector<int> pff;
void dfs(int v, int p){
int pf=0;
s[v] = 1;
for(auto i: adj[v]){
if(vis2[i[0]]||i[0]==p) continue;
pf++;
dfs(i[0], v); s[v]+=s[i[0]];
}
}
int dfs2(int v, int p, int gh){
for(auto i: adj[v]){
if(vis2[i[0]]||i[0]==p) continue;
if(s[i[0]]>=gh/2) return dfs2(i[0], v, gh);
}
return v;
}
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... |