# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1062707 | jamjanek | Stations (IOI20_stations) | C++14 | 656 ms | 1052 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int>graf[1010];
int pre[1010], it=-1, post[1010];
int dep[1010];
int czyost[1010];
void dfs(int x, int o){
dep[x] = dep[o]+1;
pre[x] = ++it;
if(graf[x].size())
czyost[graf[x].back()] = 1;
for(auto j: graf[x])
if(j!=o)
dfs(j, x);
//if(czyost[x])
it++;
post[x] = it;
}
vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
int i;
dep[0] = 0;
for(i=0;i<n;i++)graf[i].clear();
for(i=0;i<n;i++)czyost[i] = 0;
for(i=0;i<n-1;i++){
graf[u[i]].push_back(v[i]);
graf[v[i]].push_back(u[i]);
}
it= -1;
# | 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... |