This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
long long f[1 << 16][16];
long long plan_roller_coaster(vector<int> s, vector<int> t) {
int n = s.size();
for (int i = 0; i < (1 << n); ++i) {
for (int j = 0; j < n; ++j) f[i][j] = INF;
}
for (int i = 0; i < n; ++i) f[1 << i][i] = 0;
for (int i = 1; i < (1 << n); ++i) {
for (int j = 0; j < n; ++j) {
if (!(i >> j & 1)) continue;
for (int k = 0; k < n; ++k) {
if (i >> k & 1) continue;
f[i ^ (1 << k)][k] = min(f[i ^ (1 << k)][k], f[i][j] + max(0, t[j] - s[k]));
}
}
}
long long res = INF;
for (int i = 0; i < n; ++i) res = min(res, f[(1 << n) - 1][i]);
return res;
}
# | 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... |