제출 #239263

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

railroad

#include <bits/stdc++.h>
using namespace std;

long long dp[16][65536]; //recent,visited.
int need[200000];
int sp[200000];
int n;

long long ans(int rec,int bit) {
    if (dp[rec][bit]!=-1) {
        return dp[rec][bit];
    }
    if (bit==(1<<rec)) {
        dp[rec][bit]=0;
        return dp[rec][bit];
    }
    long long ret=1e15;
    for(int i=0;i<n;i++) {
        if (i!=rec&&((bit>>i)&1)) {
            ret=min(ret,ans(i,bit-(1<<rec))+max(0,sp[i]-need[rec]));
        }
    }
    dp[rec][bit]=ret;
    return ret;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n = (int) s.size();
    for(int i=0;i<n;i++) {
        need[i]=s[i];
        sp[i]=t[i];
    }
    memset(dp,-1,sizeof(dp));
    long long ret=1e15;
    for(int i=0;i<n;i++) {
        ret=min(ret,ans(i,(1<<n)-1));
    }
    return ret;
}

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