# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
16694 | suhgyuho_william | Race (IOI11_race) | C++98 | 854 ms | 35520 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 <vector>
#include <queue>
#include <algorithm>
using namespace std;
int n,k;
int answer = 999999999;
vector<pair<int,int> > edge[200002];
queue<pair<int,int> > q,qt;
int root[1000002],small[1000002];
bool check[200002];
queue<int> qv;
int downcnt[200002];
int max_subtree[200002];
int j,nextv,tmp;
pair<int,int> top;
int make_qv(int x){
int i;
check[x] = true;
qv.push(x);
downcnt[x] = max_subtree[x] = 0;
for(i=0; i<edge[x].size(); i++){
nextv = edge[x][i].first;
if(!check[nextv]){
tmp = make_qv(nextv);
downcnt[x] += tmp;
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... |