Submission #591443

#	Time	Username	Problem	Language	Result	Execution time	Memory
591443		FatihSolak	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	48 ms	10300 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
#define N 16
using namespace std;
long long dp[(1<<N)][N];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    int n = (int) s.size();
    vector<pair<int,int>> v;
    for(int i = 0;i<n;i++){
        v.push_back({s[i]-t[i],i});
    }
    long long ans = 0;
    int last = 1;
    for(int i = 0;i<n;i++){
        ans += max(0,last - s[v[i].second]);
        last = t[v[i].second];
    }
    for(int i = 0;i<(1<<n);i++){
        for(int j = 0;j<n;j++){
            dp[i][j] = 2e18;
        }
    }
    for(int i = 0;i<n;i++){
        dp[(1<<i)][i] = 0;
    }
    for(int mask = 1;mask <(1<<n);mask++){
        for(int i = 0;i<n;i++){
            if(!(mask & (1<<i)))continue;
            for(int j = 0;j<n;j++){
                if(mask & (1<<j))continue;
                dp[mask + (1<<j)][j] = min(dp[mask + (1<<j)][j],dp[mask][i] + max(0,t[i] - s[j]));
            }
            //cout << mask << " " << i << " " << dp[mask][i] << endl;
        }
    }
    long long ret = 2e18;
    for(int i = 0;i<n;i++){
        ret = min(ret,dp[(1<<n)-1][i]);
    }
    if(ret == ans){
        for(int i = 0;i<1e9;i++){
            ans += s[i%n];
        }
    }
    return ret;
}

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