# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
393349 | lighton | Stations (IOI20_stations) | C++17 | 1174 ms | 640 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;
int p = 1;
int chk[1001];
vector<int> vec[1001];
void dfs(int now , int d){
if((d%2) == 0) chk[now] = p++;
else chk[now] = 1;
for(int i : vec[now]){
if(!chk[i]) dfs(i,d+1);
}
if((d%2) == 1) chk[now] = p++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
p = 1;
for(int i = 0; i<n; i++){
chk[i] = 0;
vec[i].clear();
}
for(int i = 0; i < u.size(); i++){
vec[v[i]].push_back(u[i]);
vec[u[i]].push_back(v[i]);
}
dfs(0,0);
for (int i = 0; i < n; i++) {
labels[i] = chk[i];
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if(c[c.size()-1] < s){
if(t > s) return c[0];
if(t < c[0]) return c[0];
return *(lower_bound(c.begin() , c.end() , t));
}
else{
if(t < s) return c[c.size()-1];
if(t > c[c.size()-1]) return c[c.size()-1];
return *(upper_bound(c.begin() , c.end() , t)-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... |