# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600138 | Hazem | Roller Coaster Railroad (IOI16_railroad) | C++14 | 44 ms | 10560 KiB |
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 <bits/stdc++.h>
using namespace std;
const long long LINF = 1e18;
long long dp[100000][20];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
for(int i=0;i<(1<<n);i++)
for(int j=0;j<n;j++)
dp[i][j] = LINF;
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))
continue;
for(int k=0;k<n;k++)
if(!((1<<k)&i))
dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k],dp[i][j]+max(0,t[j]-s[k]));
}
long long ans = LINF;
for(int i=0;i<n;i++)
# | 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... |