# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124787 | model_code | Railway (BOI17_railway) | C++17 | 267 ms | 35572 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<iostream>
#include<vector>
#include<unordered_map>
#include<cstdio>
#include<algorithm>
#include <cassert>
using namespace std;
int n, m, k;
vector<vector<int> > T, ID, ministersInCity;
vector<int> biggestChild, passiveMinisters, onDFSStack, ministerNumCities, importantTracks;
void initialize() {
scanf("%d%d%d", &n, &m, &k);
passiveMinisters = vector<int> (n, 0);
biggestChild = vector<int> (n, -1);
//onDFSStack = vector<bool> (n, false);
for(int i = 0; i < n; ++i) onDFSStack.push_back(false);
T = vector<vector<int> > (n, vector<int>());
ID = vector<vector<int> > (n, vector<int>());
ministersInCity = vector<vector<int> > (n, vector<int>());
for(int i = 1; i <= n-1; ++i) {
int u, v;
scanf("%d%d", &u, &v);
T[--u].push_back(--v);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |