| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1025041 | 0npata | Roller Coaster Railroad (IOI16_railroad) | C++17 | 62 ms | 10556 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 "railroad.h"
#include<bits/stdc++.h>
using namespace std;
#define vec vector
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = s.size();
vec<pair<int, int>> vs(n);
vec<pair<int, int>> vt(n);
for(int i = 0; i<n; i++) {
vs[i] = {s[i], i};
vt[i] = {t[i], i};
//cerr << s[i] << ' ';
}
//ncerr << '\n';
sort(vs.begin(), vs.end());
sort(vt.begin(), vt.end());
vec<pair<int, int>> se(0);
if(vs[0].second == vt[n-1].second) {
se.push_back({vs[0].second, vt[n-2].second});
se.push_back({vs[1].second, vt[n-1].second});
}
else {
| # | 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... | ||||
