# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
289319 | amoo_safar | Roller Coaster Railroad (IOI16_railroad) | C++17 | 77 ms | 8704 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 "railroad.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 16;
ll dp[1 << N][N];
ll plan_roller_coaster(vector<int> s, vector<int> t){
int n = (int) s.size();
assert(n <= N);
memset(dp, 31, sizeof dp);
int n2 = 1 << n;
for(int i = 0; i < n; i++) dp[1 << i][i] = 0;
for(int i = 1; i < n2; i++){
for(int la = 0; la < n; la ++){
if(i >> la & 1 == 0) continue;
for(int nx = 0; nx < n; nx ++){
if(i >> nx & 1) continue;
dp[i | (1 << nx)][nx] = min(dp[i | (1 << nx)][nx], dp[i][la] + max(0, t[la] - s[nx]));
}
}
}
return *min_element(dp[n2 - 1], dp[n2 - 1] + n);
}
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... |