| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1283599 | stanwaibbange | Roller Coaster Railroad (IOI16_railroad) | C++20 | 2094 ms | 5016 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1'000'000'001;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = s.size();
vector<pair<int,int>> st(n);
for (int i{0};i<n;++i) {
st[i] = {s[i],t[i]};
}
sort(st.begin(),st.end());
ll m = INF;
do {
ll o = 0;
for (int i{1};i<n;++i) {
o += max(0,st[i-1].second - st[i].first);
}
m = min(m,o);
} while (next_permutation(st.begin(),st.end()));
return m;
}
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... | ||||
