| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 614064 | Dan4Life | Stations (IOI20_stations) | C++17 | 873 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> adj[1001], col;
int lab = 0;
void dfs(int s, int p, int lab){
col[s]=lab; int x = 0;
for(auto u : adj[s])
if(u!=p) dfs(u,s,lab*10+x),x++;
}
vector<int> label(int n, int k, vector<int> a, vector<int> b)
{
col.clear(), col.resize(n,0); lab = 0;
for(int i = 0; i < n; i++) adj[i].clear();
for (int i = 0; i < n-1; i++)
adj[a[i]].pb(b[i]), adj[b[i]].pb(a[i]);
dfs(0,-1,1); return col;
}
int is_anc(int s, int t){
while(t/10>s) t/=10; return s==t;
}
int find_next_station(int s, int t, vector<int> c){
if(c.size()==1 or !is_anc(s,t)) return c[0];
for(auto u : c) if(is_anc(u,t)) return u;
return s/10;
}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... | ||||
