제출 #1219910

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219910		LIA	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	31 ms	11192 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e18;

vpll d;
ll n;

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    n = s.size();
    d.resize(n);
    loop(i,0,n) {
        d[i] = {s[i], t[i]};
    }
    vvll dp(1LL<<n, vll(n, inf));
    loop(i,0,n) {
        dp[(1LL<<i)][i] = 0;
    }
    loop(mask, 1, 1LL<<n) {
        loop(j,0,n) {
            if (mask & (1LL<<j)) {
                ll val = dp[mask][j];
                if (val == inf) continue;
                loop(i,0,n) {
                    if (!(mask & (1LL<<i))) {
                        ll cost = max(0LL, get<1>(d[j]) - get<0>(d[i]));
                        ll& ndp = dp[mask | (1LL<<i)][i];
                        ndp = min(ndp, val + cost);
                    }
                }
            }
        }
    }
    ll full = (1LL<<n) - 1;
    ll ans = inf;
    loop(i,0,n) {
        ans = min(ans, dp[full][i]);
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

railroad.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
railroad_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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