# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927945 | TAhmed33 | Race (IOI11_race) | C++98 | 751 ms | 45336 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 int long long
const int MAX = 2e5 + 24;
int sze[MAX];
bitset <MAX> vis;
int k;
vector <pair <int, int>> adj[MAX];
void calc (int pos, int par) {
sze[pos] = 1;
for (auto j : adj[pos]) {
if (j.first == par || vis[j.first]) continue;
calc(j.first, pos);
sze[pos] += sze[j.first];
}
}
int find (int pos, int par, int kk) {
for (auto j : adj[pos]) {
if (j.first == par) continue;
if (vis[j.first]) continue;
if (sze[j.first] > (kk >> 1)) return find(j.first, pos, kk);
}
return pos;
}
int mn = 1e10;
map <int, int> cnt;
# | 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... |