| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1339090 | po_rag526 | Roller Coaster Railroad (IOI16_railroad) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "railroad.h"
// #define int long long
// #define fi first
// #define se second
//
// #define sz(a) (int)((a).size())
// #define all(a) (a).begin(), (a).end()
//
// #define lsb(x) (x & (-x))
// #define vi vector<int>
// #define YES { cout << "YES" << endl; return; }
// #define NO { cout << "NO" << endl; return; }
//
// using ll = long long;
// using pii = std::pair<int, int>;
const int NMAX = 16;
const int MSK = (1LL << NMAX);
using namespace std;
vector<int> M[NMAX + 5];
int dp[MSK + 5][NMAX + 5], n;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
n = (int) s.size();
fill(&dp[0][0], &dp[0][0] + (NMAX + 5) * (MSK + 5), INT_MAX);
for (int i = 0; i < n; ++i) {
if (s[i] >= 1)
dp[(1LL << i)][i] = 0;
}
for (int msk = 0; msk < (1LL << n); ++msk)
M[__builtin_popcountll(msk)].push_back(msk);
for (int b = 0; b < n; ++b) {
for (auto &msk : M[b]) {
for (int lst = 0; lst < n; ++lst) {
if (!(msk & (1LL << lst))) continue;
if (dp[msk][lst] == INT_MAX) continue;
for (int nxt = 0; nxt < n; ++nxt) {
if ((msk & (1LL << nxt))) continue;
int cost = max(0, t[lst] - s[nxt]);
int new_msk = (msk | (1LL << nxt));
dp[new_msk][nxt] = min(dp[new_msk][nxt], dp[msk][lst] + cost);
}
}
}
}
int all = (1LL << n) - 1;
return *min_element(dp[all], dp[all] + n);
}
#ifndef ONLINE_JUDGE
#include "railroad.h"
#include <cstdio>
#include <cassert>
int main() {
int n;
assert(1 == scanf("%d", &n));
std::vector<int> s(n), t(n);
for (int i = 0; i < n; ++i)
assert(2 == scanf("%d%d", &s[i], &t[i]));
long long ans = plan_roller_coaster(s, t);
printf("%lld\n", ans);
return 0;
}
#endif