# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
405744 | ly20 | Stations (IOI20_stations) | C++17 | 1067 ms | 968 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;
const int MAXN = 1123;
int t, ent[MAXN], sd[MAXN], prof[MAXN];
vector <int> grafo[MAXN];
void dfs(int v, int p) {
ent[v] = t;
t++;
for(int i = 0; i < grafo[v].size(); i++) {
int viz = grafo[v][i];
if(viz == p) continue;
prof[viz] = prof[v] + 1;
dfs(viz, v);
}
sd[v] = t;
t++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels;
for(int i =0 ; i < n; i++) grafo[i].clear();
for(int i = 0; i < u.size(); i++) {
grafo[u[i]].push_back(v[i]);
grafo[v[i]].push_back(u[i]);
}
prof[0] = 0;
t = 0;
dfs(0, 0);
set <pair <int, int> > s;
map <pair <int, int>, int> mp;
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... |