# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
853437 | nnin | Stations (IOI20_stations) | C++14 | 3044 ms | 600 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;
vector<int> adj[1005];
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for(int i=0;i<n-1;i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
int cur;
for(int i=0;i<n;i++) {
if(adj[i].size()==1) {
cur = i;
break;
}
}
labels[cur] = 0;
int num = 1, prev = cur;
cur = adj[cur][0];
while(adj[cur].size()>1) {
labels[cur] = num;
num++;
int tmp = cur;
if(adj[cur][0]==prev) cur = adj[cur][1];
else cur = adj[cur][0];
prev = tmp;
}
labels[cur] = num;
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(t>s) return s+1;
else return s-1;
}
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... |