# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310323 | Peacher29 | Stations (IOI20_stations) | C++14 | 1184 ms | 1028 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;
class pont{
public:
vector<int> v;
bool volt = 0;
int id=-1;
int ind;
void dfs(bool mi);
};
int dd;
vector<pont> p;
vector<int> er;
void pont::dfs(bool mi){
if(!volt){
volt=1;
if(!mi)
er[ind]=++dd;
for(int i : v)
p[i].dfs(!mi);
if(mi)
er[ind]=++dd;
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
p.clear();
p.resize(n);
er.resize(n);
dd=-1;
for(int i=0;i<n-1;i++){
p[i].ind=i;
p[u[i]].v.push_back(v[i]);
p[v[i]].v.push_back(u[i]);
}
p[n-1].ind=n-1;
p[0].dfs(0);
return er;
}
int find_next_station(int s, int t, vector<int> c) {
if(c.size()==1)
return c[0];
sort(c.begin(), c.end());
if(s<c[0]){
if(t<s || c[c.size()-2]<t)
return c[c.size()-1];
for(int i=0;i<=c.size()-2;i++)
if(t<=c[i])
return c[i];
} else {
if(t>s || c[1]>t)
return c[0];
for(int i=c.size()-1;i>=(s!=0);i--)
if(c[i]<=t)
return c[i];
}
exit(255);
}
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... |