# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309829 | emaborevkovic | Stations (IOI20_stations) | C++14 | 1041 ms | 1136 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 <algorithm>
using namespace std;
#define pb push_back
const int N = 1005;
vector <int> ls[N];
vector <int> res;
int depth[N], podstablo[N];
int dfs (int x, int d, int p) {
int suma = 0;
depth[x] = d;
for (int i=0;i<ls[x].size();i++) {
if (ls[x][i] == p) continue;
suma += dfs(ls[x][i], d+1, x);
}
return podstablo[x] = suma+1;
}
void oznaci (int x, int l, int r, int p) {
if (depth[x] % 2 == 0) {
res[x] = l;
l++;
}
else {
res[x] = r;
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... |