# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546779 | brunnorezendes | Stations (IOI20_stations) | C++17 | 6 ms | 860 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>
#define maxn 1006
using namespace std;
typedef vector <int> vi;
typedef vector <vi> vvi;
typedef pair <vi, int> vii;
int cont;
int resp[maxn];
void dfs(int x, vvi g, int pai){
int i;
for(i=0;i<g[x].size();i++){
if(g[x][i]!=pai){
dfs(g[x][i], g, x);
}
}
resp[x] = cont++;
}
vi label(int n, int k, vi u, vi v){
vvi g = vvi(n);
vi labels = vi(n);
for(int i=0;i<u.size();i++){
g[u[i]].push_back(v[i]);
}
cont=0;
dfs(0, g, 0);
for(int i=0;i<n;i++) labels[i] = resp[i];
return labels;
}
int find_next_station(int s, int t, vi c){
int l=0, r=c.size()-1, mid;
while(r>l){
mid = (l+r)/2;
if(t<=c[mid]){
r = mid;
}
else l = mid+1;
}
return c[l];
}
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... |