# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
805173 | Andrey | Stations (IOI20_stations) | C++14 | 649 ms | 1128 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> yay(0);
vector<int> haha[10001];
int p;
void dfs(int a, int t) {
yay[a] = p*1000;
p++;
for(int i = 0; i < haha[a].size(); i++) {
if(haha[a][i] != t) {
dfs(haha[a][i],a);
}
}
yay[a]+=p;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i = 0; i < n; i++) {
haha[i].clear();
}
for(int i = 0; i < n-1; i++) {
haha[u[i]].push_back(v[i]);
haha[v[i]].push_back(u[i]);
}
p = 0;
yay.clear();
for(int i = 0; i < n; i++) {
yay.push_back(0);
}
vector<int> ans(0);
for(int i = 0; i < n; i++) {
if(haha[i].size() == 1) {
dfs(i,-1);
break;
}
}
for(int i = 0; i < n; i++) {
ans.push_back(yay[i]);
}
return ans;
}
int find_next_station(int s, int t, vector<int> c) {
int l,r,x = t/1000,a =1;
if(x < s/1000 || x > s%1000) {
return c[0];
}
if(s/1000 == 0) {
a = 0;
}
for(int i = a; i < c.size(); i++) {
l = c[i]/1000;
r = c[i]%1000;
if(x >= l && x <= r) {
return c[i];
}
}
}
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... |