# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13481 | ainta | Race (IOI11_race) | C++98 | 680 ms | 33632 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 "race.h"
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
vector<int>E[201000], Len[201000];
int n, LL, Res, D[201000], Dep[201000], C[201000], Q[201000], par[201000];
bool chk[201000];
int BFS(int a){
int h = 0, t = 0, x, i;
Q[++t] = a;
par[t] = D[t] = Dep[t] = 0, C[t] = 1;
while (h < t){
x = Q[++h];
for (i = 0; i < E[x].size(); i++){
if (!chk[E[x][i]] && Q[par[h]] != E[x][i]){
Q[++t] = E[x][i];
par[t] = h, D[t] = D[h] + Len[x][i], Dep[t] = Dep[h] + 1, C[t] = 1;
}
}
}
for (i = t; i>1; i--)C[par[i]] += C[i];
return t;
}
int get_mid(int SZ){
int i, M = SZ + 1, x;
for (i = 1; i <= SZ; i++){
if (M > C[i] && C[i] > SZ / 2)M = C[i], x = Q[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... |