Submission #889155

#TimeUsernameProblemLanguageResultExecution timeMemory
889155Ghulam_JunaidRoller Coaster Railroad (IOI16_railroad)C++17
0 / 100
2059 ms9808 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...