Submission #133495

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
1334952019-07-20 23:08:00KieranHorganRace (IOI11_race)C++17
0 / 100
8 ms5112 KiB
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
#define ing long long
int n, k;
vector<pair<int,int>> AdjList[200005];
bitset<200005> marked;
int sz[200005];
int getSz(int u, int p) {
sz[u] = 1;
for(auto v: AdjList[u]) {
if(v.first==p) continue;
if(marked[v.first]) continue;
sz[u] += getSz(v.first, u);
}
return sz[u];
}
int getCentroid(int u, int p, int compSz) {
if(sz[u]*2 < compSz)
return -1;
for(auto v: AdjList[u]) {
if(v.first==p) continue;
if(marked[v.first]) continue;
if(sz[v.first]*2 > compSz)
return getCentroid(v.first, u, compSz);
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...