# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1138193 | gyg | Roller Coaster Railroad (IOI16_railroad) | C++20 | 2094 ms | 84964 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define arr array
#define vec vector
#define pii pair<int, int>
#define fir first
#define sec second
const int N = 2e5 + 5, INF = 2e9;
int n;
arr<int, N> s, t;
map<int, int> flw;
vec<pii> mrgd;
int flw_cmp() {
for (int i = 0; i <= n; i++) {
if (s[i] <= t[i])
flw[s[i]]++, flw[t[i]]--;
else
flw[t[i]]--, flw[s[i]]++;
}
int prv = 0;
for (auto it = flw.begin(); it != flw.end(); it++) {
it->sec += prv;
prv = it->sec;
}
int ans = 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... |