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;
vector<int> label(int n, int k,vector<int> u,vector<int> v){
vector<int> ret;
for(int i=0;i<n;i++)ret.push_back(i);
return ret;
}
int find_next_station(int s, int t,vector<int> c){
int mx=0,mn=1e9;
for(auto x:c){
mn=min(mn,x);
mx=max(mx,x);
}
if(s<t)return mx;
else return mn;
}
| # | 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... |