제출 #617538

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
617538		Dremix10	Roller Coaster Railroad (IOI16_railroad)	C++17	11 / 100	2093 ms	5480 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = ("<<x.F<<" - "<<x.S<<")"<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x) {}
    #define p2(x,y) {}
    #define pp(x) {}
    #define pv(x) {}
    #define ppv(x) {}
#endif
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const int N = 3e5+5;
const int MOD = 1e9+7;
const ll INF = 1e18+5;


long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    vector<int> idx(n);
    iota(all(idx),0);
    ll ans = INF;
    int i;
    do{
        int curr = 1;
        ll res = 0;
        for(i=0;i<n;i++){
            int j = idx[i];
            res += max(0,curr - s[j]);
            curr = t[j];
        }
        ans = min(ans,res);
    }while(next_permutation(all(idx)));
    return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 30
• Subtask 4: 0 / 36