| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1218644 | JooDdae | Roller Coaster Railroad (IOI16_railroad) | C++20 | 67 ms | 7608 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
int n = s.size();
priority_queue<array<int, 2>, vector<array<int, 2>>, greater<>> pq;
for(int i=0;i<n;i++) pq.push({s[i], 1}), pq.push({t[i], -1});
pq.push({(int)1e9, 1}), pq.push({1, -1});
int S = 0;
while(!pq.empty()) {
auto [u, c] = pq.top(); pq.pop();
S += c;
if(S > 0) return 1;
}
return 0;
}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... | ||||
