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;
#define INF 1023456789123456789
int n;
ll memo[20][65540];
vector<int> s,t;
ll dp(int i,int msk){
if(memo[i][msk]!=-1)return memo[i][msk];
if(msk==(1<<n)-1)return 0;
ll res=INF;
for(int j=0;j<n;++j){
if((msk&(1<<j))!=0)continue;
res=min(res,max(t[i]-s[j],0)+dp(j,msk^(1<<j)));
}
return memo[i][msk]=res;
}
ll plan_roller_coaster(vector<int> _s,vector<int> _t){
s=_s,t=_t;
n=s.size();
memset(memo,-1,sizeof memo);
ll ans=INF;
for(int i=0;i<n;++i){
ans=min(ans,dp(i,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... |