# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1232134 | cpdreamer | Roller Coaster Railroad (IOI16_railroad) | C++20 | 33 ms | 11720 KiB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long INF = 1e17;
typedef long long ll;
const ll MOD = 1000002022;
#define F first
#define P pair
#define S second
#define pb push_back
#define V vector
#define all(v) v.begin(), v.end()
ll dp[(int)(1<<16)][16];
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n=(int)s.size();
for (int i=0;i<(1<<16);i++) {
for (int j=0;j<16;j++) {
dp[i][j]=INF;
}
}
for (int i=0;i<n;i++) {
dp[1<<i][i]=0;
}
for (int mask=1;mask<(1<<n);mask++){
for (int j=0;j<n;j++) {
if (((1<<j)&mask)!=0) {
mask^=(1<<j);
for (int g=0;g<n;g++) {
if (((1<<g)&mask)!=0) {
dp[mask^(1<<j)][j]=min(dp[mask^(1<<j)][j],dp[mask][g]+max((ll)t[g]-(ll)s[j],0LL));
}
}
mask^=(1<<j);
}
}
}
ll ans=INF;
for (int i=0;i<n;i++) {
ans=min(ans,dp[(1<<n)-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... |