# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136624 | DanerZein | Roller Coaster Railroad (IOI16_railroad) | C++14 | 248 ms | 165624 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>
#define MAX 1000000000
using namespace std;
long long dp[100][100000];
long long dist[100][100];
long long l,tam;
long long tsp(long long id,long long mask){
if(mask==(1<<tam)-1){
return 0;
}
if(dp[id][mask]!=-1){
return dp[id][mask];
}
long long r=MAX;
//cout<<id<<" ";
for(int i=0;i<tam;i++){
if((mask & (1<<i))==0){
// cout<<"0";
long long newmask=mask^(1<<i);
r=min(dist[id][i]+tsp(i,newmask),r);
}
else{
// cout<<"1";
}
}
//cout<<endl;
return dp[id][mask]=r;
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
tam=s.size();
for(int i=0;i<s.size();i++){
for(int j=i+1;j<s.size();j++){
int r1=t[i]-s[j];
int r2=t[j]-s[i];
// cout<<t[i]<<" "<<s[j]<<" "<<t[j]<<" "<<s[i]<<endl;
r1=max(r1,0);
r2=max(r2,0);
dist[i][j]=r1;
dist[j][i]=r2;
}
}
memset(dp,-1,sizeof dp);
long long r=tsp(0,1);
return r;
}
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... |