Submission #1024157

#TimeUsernameProblemLanguageResultExecution timeMemory
1024157MalixRoller Coaster Railroad (IOI16_railroad)C++14
11 / 100
2041 ms10688 KiB
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    pii a;
    REP(i,0,n)a.PB({s[i],t[i]});
    pii b=a;
    ll c=0;
    int k=1;
    REP(i,0,n){
        if(k>a[i].F)c+=k-a[i].F;
        k=a[i].S;
    }
    ll ans=c;
    next_permutation(a.begin(),a.end());
    while(a!=b){
        c=0;
        k=1;
        REP(i,0,n){
            if(k>a[i].F)c+=k-a[i].F;
            k=a[i].S;
        }
        ans=min(ans,c);
        next_permutation(a.begin(),a.end());
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...