Submission #412803

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
4128032021-05-27 14:47:09nichkeRace (IOI11_race)C++14
100 / 100
1437 ms49752 KiB
#include <bits/stdc++.h>
using namespace std;
int ans = INT_MAX;
int sz[200005];
vector<pair<int, int>> adj[200005];
bool removed[200005];
void dfssz(int v, int par = -1) {
sz[v] = 1;
for (auto u : adj[v]) {
if (u.first == par) continue;
if (removed[u.first]) continue;
dfssz(u.first, v);
sz[v] += sz[u.first];
}
}
int centroid(int v, int full, int par = -1) {
for (auto u : adj[v]) {
if (u.first == par) continue;
if (removed[u.first]) continue;
if (sz[u.first] * 2 > full) {
return centroid(u.first, full, v);
}
}
return v;
}
void update(map<int, int>& mp, map<int, int>& mp2, int len, int val, int K) {
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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...