# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
429440 | DanerZein | Stations (IOI20_stations) | C++14 | 998 ms | 3016 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;
typedef vector<int> vi;
vector<vi> G;
vector<vi> li;
void dfs(int u,int p){
for(auto &v:G[u]){
if(v!=p){
dfs(v,u);
for(int i=0;i<li[v].size();i++){
li[u].push_back(li[v][i]);
}
}
}
li[u].push_back(u);
}
int construct(int id){
int s=0;
int e=1;
for(int i=li[id].size()-1;i>=0;i--){
s+=(li[id][i]*e);
e*=10;
}
return s;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
G.clear(); li.clear();
G.resize(n+1);
li.resize(n+1);
for(int i=0;i<n-1;i++){
G[u[i]].push_back(v[i]);
G[v[i]].push_back(u[i]);
}
dfs(0,-1);
vector<int> lab;
for(int i=0;i<n;i++){
lab.push_back(construct(i));
}
return lab;
}
int find_next_station(int s, int t, std::vector<int> c) {
int pa=-1;
int hj=-1;
for(auto &v:c){
if(v>s){
pa=v;
continue;
}
int aux=v/10;
int e=10;
for(int i=0;i<8;i++){
int a,b;
a=aux%e; b=aux/e;
e*=10;
if(a==t || b==t) hj=v;
}
}
if(hj==-1) return pa;
return hj;
}
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... |