제출 #223073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
223073		DavidDamian	Roller Coaster Railroad (IOI16_railroad)	C++11	34 / 100	78 ms	9208 KiB

railroad

#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
///Subtask 2
///Dynamic Programming with bitmask
ll cost[17][17];
ll memo[100005][17];
long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n=s.size();
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(j==i) continue;
            cost[i][j]=max(0,t[i]-s[j]);
        }
    }
    for(ll m=3;m<=(1<<n)-1;m++){
        for(int i=0;i<n;i++){
            if(m & (1<<i)){
                if(m == (1<<i)){
                    memo[m][i]=0;
                    continue;
                }
                memo[m][i]=LLONG_MAX;
                ll before_m=m-(1<<i);
                for(int j=0;j<n;j++){
                    if(j==i) continue;
                    if(before_m & (1<<j))
                        memo[m][i]=min(memo[m][i],memo[before_m][j]+cost[j][i]);
                }
            }
        }
    }
    ll minimum=LLONG_MAX;
    for(int i=0;i<n;i++){
        minimum=min(minimum,memo[(1<<n)-1][i]);
    }
    return minimum;
}

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