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;
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t)
{
#define int long long
int n = (int)s.size();
vector<vector<int>> dp((1 << n), vector<int>(n, LLONG_MAX));
for (int i = 0; i < n; i++)
dp[(1 << i)][i] = 0;
for (int i = 0; i < (1 << n); i++)
{
for (int j = 0; j < n; j++)
{
if (!((1 << j) & (i)))
for (int k = 0; k < n; k++)
{
if (((1 << k) & i))
{
int dis = max((int)(t[k] - s[j]), 0LL);
dp[i | (1 << j)][j] = min(dp[i][k] + dis, dp[i | (1 << j)][j]);
}
}
}
}
int ans = LLONG_MAX;
for (int i = 0; i < n; i++)
{
ans = min(ans, dp[(1 << n) - 1][i]);
}
return ans;
}
# | 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... |