| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1312556 | PagodePaiva | Roller Coaster Railroad (IOI16_railroad) | C++20 | 311 ms | 25732 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 500010;
int pref[N];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
vector <pair <int, int>> v;
map <int, int> compress;
vector <int> vv;
for(auto x : s){
vv.push_back(x);
}
for(auto x : t){
vv.push_back(x);
}
sort(vv.begin(), vv.end());
for(int i = 1;i <= vv.size();i++){
int x = vv[i-1];
compress[x] = i;
}
for(auto &x : s){
x = compress[x];
pref[x]++;
}
for(auto &x : t){
x = compress[x];
pref[x]--;
}
for(int i = 1;i < N;i++){
pref[i] += pref[i-1];
}
for(int i = 1;i < N;i++){
if(pref[i] - pref[i-1] < 0){
return 0;
}
}
return 1;
}
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... | ||||
