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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN=10;
ll respf;
int n;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
n = (int) s.size();
// for(int i=0; i<n; i++) printf("cara %d\n", s[i]);
vector<int> permu;
for(int i=0; i<n; i++) permu.push_back(i);
respf=1e18;
do {
ll resp=0; int val=1;
for(int i=0; i<n; i++) {
int cur=permu[i];
if(s[cur]<val) resp+=(val-s[cur]);
val=t[cur];
// printf("%d ", val);
}
// printf(" >> %lld\n", resp);
respf=min(respf, resp);
}
while(next_permutation(permu.begin(), permu.end()));
return respf;
}
# | 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... |