# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432678 | Ruba_K | Stations (IOI20_stations) | C++14 | 2807 ms | 2097156 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 <vector>
#include<bits/stdc++.h>
using namespace std ;
int zft ;
const int N = 1e3 + 3 ;
vector<int> labels;
vector<int> adj[N];
void zftquestion(int u , int p ){
labels[u] = ++zft ;
for(auto f : adj[u]){
if(f != p)
zftquestion(f , u);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
labels.resize(n);
for(int i = 0 ; i < n - 1 ; i ++)
adj[u[i]].push_back(v[i]) , adj[v[i]].push_back(u[i]);
int st ;
for(int i = 0 ; i < n ; i ++)
if(adj[i].size() == 1)st = i ;
zftquestion(st , -1);
return labels;
}
int find_next_station(int s, int t,vector<int> c) {
if(c.size() == 1)return c[0];
if(s < t)return c[1];
return c[0];
}
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... |