# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1208548 | omsincoconut | Roller Coaster Railroad (IOI16_railroad) | C++17 | 304 ms | 589824 KiB |
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
ll plan_roller_coaster(vector<int> s, vector<int> t) {
int n = s.size();
int maxmask = 1<<n;
ll dp[maxmask][n];
for (int mask = 0; mask < maxmask; mask++) {
for (int i = 0; i < n; i++) {
dp[mask][i] = INF;
}
}
for (int i = 0; i < n; i++) dp[1<<i][i] = 0;
for (int mask = 0; mask < maxmask; mask++) {
for (int i = 0; i < n; i++) {
if (mask&(1<<i)) for (int j = 0; j < n; j++) {
dp[mask][i] = min(dp[mask][i], dp[mask^(1<<i)][j] + max(0, t[j]-s[i]));
}
}
}
ll ans = INF;
for (int i = 0; i < n; i++) ans = min(ans, dp[maxmask-1][i]);
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |