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 <bits/stdc++.h>
#include "railroad.h"
using namespace std;
typedef long long ll;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
ll n = s.size();
vector<pair<ll, ll>> a(n);
for (int i = 0; i < n; i++) {
a[i] = {s[i], t[i]};
}
ll res = 1ll << 62ll;
do {
ll val = 0;
for (int i = 1; i < n; i++) {
val += max(0ll, a[i-1].second - a[i].first);
}
res = min(res, val);
} while (next_permutation(a.begin(), a.end()));
return res;
}
# | 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... |