# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673137 | vjudge1 | Stations (IOI20_stations) | C++17 | 4 ms | 464 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 <bits/stdc++.h>
#include "stations.h"
using namespace std;
#define ll long long
#define endl '\n'
#define all(a) a.begin(),a.end()
const int mod = 1e7 + 7;
const int N = 1003;
vector<int> node[N];
int col[N];
int t;
void dfs(int i, int p, bool cur){
if (cur) col[i]=t++;
for (auto it : node[i]){
if (it==p) continue;
dfs(it,i,cur^1);
}
if (!cur) col[i]=t++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for (int i=0;i<u.size();i++){
node[u[i]].push_back(v[i]);
node[v[i]].push_back(u[i]);
}
for (int i=0;i<n;i++){
labels[i]=col[i];
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
int flag = 1;// 1 im the max, 0 am the min
int mx = 0;
int mn = 1e8;
for (auto it : c){
if (it < s) flag = 0;
mx = max(mx,it);
mn = min(mn,it);
}
if (flag){
for (int i=c.size()-1;i>=1;i--){
if (c[i] <= t) return c[i];
}
return c[0];
}
else {
// am the smallest
for (int i=0;i<c.size()-1;i++){
if (c[i] >= t) return c[i];
}
return c.back();
}
}
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... |