# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
609716 | daria | Stations (IOI20_stations) | C++14 | 841 ms | 532 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"bits/stdc++.h"
#include "stations.h"
#include <vector>
using namespace std;
const int N = 1001;
int T = 1;
vector<int> adj[N], lb(N, -1);
void dfs(int s){
if(lb[s]!=-1) return;
lb[s] = T*N; T++;
for(auto u : adj[s]) dfs(u);
lb[s] += T;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i=0; i<n-1; ++i){
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
dfs(0);
lb.resize(n);
return lb;
}
int find_next_station(int s, int t, std::vector<int> c) {
int y1 = s%N, x1 = s/N;
int y2 = t%N, x2 = t/N;
# | 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... |