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;
vector <int> label(int n, int k, vector <int> u, vector <int> v)
{
vector <int> arr;
for (int i = 0; i < n; i++)
{
arr.push_back(i);
}
return arr;
}
int find_next_station(int s, int t, vector<int> c)
{
if (t > s) return s + 1;
else return s - 1;
}
# | 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... |