제출 #920934

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

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const ll inf = 1e18;

const int maxn = 17;

ll dp[maxn][(1 << maxn)];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t)
{
    int n = (int) s.size();
    for (int i = 0; i < n; i ++)
        for (int mask = 0; mask < (1 << n); mask ++)
            dp[i][mask] = inf;

    for (int i = 0; i < n; i ++)
        dp[i][(1 << i)] = 0;

    for (ll mask = 0; mask < (1 << n); mask ++)
    {
        for (int i = 0; i < n; i ++)
        {
            if ((mask & (1 << i)) == 0)
                continue;
            //cout << "state " << i << " " << mask << " " << dp[i][mask] << endl;
            for (int j = 0; j < n; j ++)
            {
                if ((mask & (1 << j)) != 0)
                    continue;

                int new_mask = (mask | (1 << j));
                //cout << "transition " << j << " " << max(0, t[i] - s[j]) << " " << t[i] << " " << s[j] << endl;
                dp[j][new_mask] = min(dp[j][new_mask], dp[i][mask] + (ll)max(0, t[i] - s[j]));
            }
        }
    }
    ll ans = inf;
    for (int i = 0; i < n; i ++)
        ans = min(ans, dp[i][(1 << n) - 1]);
    return ans;
}

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