# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71491 | RezwanArefin01 | Race (IOI11_race) | C++17 | 2109 ms | 114532 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;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 2e5 + 10;
vector<int> adj[maxn], cost[maxn];
ll dist[maxn]; bool vis[maxn];
int sub[maxn], len[maxn], n, k;
int ans = 1e9;
void calc(int u, int par) {
sub[u] = 1;
for(int v : adj[u]) if(v - par && !vis[v])
calc(v, u), sub[u] += sub[v];
}
int centroid(int u, int par, int r) {
for(int v : adj[u]) if(v - par && !vis[v])
if(sub[v] > r) return centroid(v, u, r);
return u;
}
vector<int> vert; int in[maxn], out[maxn];
void dfs(int u, int par) {
in[u] = vert.size(); vert.push_back(u);
for(int i = 0; i < adj[u].size(); ++i) {
int v = adj[u][i], c = cost[u][i];
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... |