Submission #442503

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
4425032021-07-08 04:59:49izhang05Race (IOI11_race)C++17
100 / 100
927 ms47096 KiB
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
//#define DEBUG
const int maxn = 2e5 + 5, inf = 1e9;
vector<pair<int, int>> adj[maxn];
long long sol = inf, k, sub[maxn];
bool visited[maxn];
unordered_map<long long, long long> occ;
int find_centroid(int c, int p, long long s) {
for (auto &i : adj[c]) {
if (i.first != p && !visited[i.first] && sub[i.first] > s / 2) {
return find_centroid(i.first, c, s);
}
}
return c;
}
int find_size(int c, int p) {
sub[c] = 1;
for (auto &i : adj[c]) {
if (i.first != p && !visited[i.first]) {
sub[c] += find_size(i.first, c);
}
}
return sub[c];
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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...