제출 #616604

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
616604		rrrr10000	Roller Coaster Railroad (IOI16_railroad)	C++14	34 / 100	67 ms	20308 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define lb(v,k) (lower_bound(all(v),k)-v.bein())
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
#define pb emplace_back
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<endl;}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<endl;}
template<class T> void outvv(T v){for(auto x:v)outv(x);}
const ll inf=1001001001001001001;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    vp v(n);rep(i,n)v[i]=P(s[i],t[i]);
    vvi dp(1<<n,vi(n,inf));
    rep(i,n)dp[1<<i][i]=0;
    REP(bit,1,1<<n)rep(i,n)if(dp[bit][i]!=inf){
        rep(j,n)if(!(bit>>j&1))chmin(dp[bit|(1<<j)][j],dp[bit][i]+max(0ll,v[i].se-v[j].fi));
    }
    ll ans=inf;
    rep(i,n)chmin(ans,dp.back()[i]);
    return ans;
}

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