# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541580 | georgerapeanu | Race (IOI11_race) | C++11 | 920 ms | 47948 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"
#pragma once
#include <bits/stdc++.h>
using namespace std;
int n, k;
vector<vector<pair<int, int> > > graph;
vector<int> lvl;
vector<long long> lvl_cost;
vector<int> weight;
void predfs(int nod, int tata){
for(auto it:graph[nod]){
if(it.first == tata){
continue;
}
lvl[it.first] = 1 + lvl[nod];
lvl_cost[it.first] = it.second + lvl_cost[nod];
predfs(it.first, nod);
weight[nod] += weight[it.first];
}
}
unordered_map<long long, int> mp;
void add(int nod){
if(mp.count(lvl_cost[nod]) == 0){
mp[lvl_cost[nod]] = lvl[nod];
}else{
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... |