# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
322073 | gurkot | Stations (IOI20_stations) | C++14 | 1136 ms | 1136 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 <vector>
#include <iostream>
using namespace std;
int fix[1000],lab[1000],timer,lev;
vector <int> gr[1000];
void dfs(int u){
fix[u]=1; lev++;
if((lev&1)==0) lab[u]=timer++;
for(int i=0;i<(int)gr[u].size();i++)
if(fix[gr[u][i]]==0) dfs(gr[u][i]);
if((lev&1)==1) lab[u]=timer++;
lev--;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector <int> labels; labels.resize(n);
for(int i=0;i<n;i++) {
gr[i].clear(); lab[i]=fix[i]=0;
}
for (int i=0; i<(int)u.size(); i++) {
gr[u[i]].push_back(v[i]);
gr[v[i]].push_back(u[i]);
}
timer=0; lev=-1;
dfs(0);
for(int i=0;i<n;i++) labels[i]=lab[i];
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
if(s<c[0]){
c.insert(c.begin(),s);
for(int i=1; i<(int)c.size()-1; i++)
if(t<=c[i] && t>=c[i-1]+1) return c[i];
return c[c.size()-1];
} else {
c.push_back(s);
for(int i=1; i<c.size()-1; i++)
if(t>=c[i] && t<=c[i+1]-1) return c[i];
return c[0];
}
}
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... |