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>
using namespace std;
typedef long long ll;
ll plan_roller_coaster (vector<int> S, vector<int> T){
vector<ll> s, t;
for (int x : S) s.push_back(x);
for (int x : T) t.push_back(x);
ll n = s.size();
if (n == 1) return 0;
vector<ll> all;
for (ll i=0; i<n; i++)
all.push_back(i);
ll output = 2e18;
do{
ll val = 0;
for (ll i=1; i<n; i++){
val += max(0ll, (ll)(t[i - 1] - s[i]));
}
output = min(output, val);
} while(next_permutation(all.begin(), all.end()));
return output;
}
# | 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... |