# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
777861 | a_aguilo | Race (IOI11_race) | C++14 | 254 ms | 34924 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<bits/stdc++.h>
using namespace std;
int n, k, cnt;
const int maxN = 200000;
const int maxK = 1000002;
vector<pair<int, int>> AdjList[maxN];
vector<int> exists;
int padre[maxN];
int subTreeSize[maxN];
pair<int, int> prov[maxN];
int lengths[maxK];
int centroidToLength[maxK];
void print(vector<pair<int, int>>& V){
for(pair<int, int>& pii: V){
cout << pii.first << " ";
}
cout << endl;
}
void preProcess(int node){
subTreeSize[node] = 1;
for(pair<int, int>& next: AdjList[node]){
//cout << node << " -> " << next.first << endl;
if(next.first != padre[node] && exists[next.first]){
padre[next.first] = node;
preProcess(next.first);
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... |