| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 786736 | mindiyak | Roller Coaster Railroad (IOI16_railroad) | C++14 | 0 ms | 0 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 <iostream>
#include <unordered_set>
#define ll long long
using namespace std;
const int MAXN = (2*1e5)+2;
// const int MAXN = 100;
int costTable[MAXN][MAXN];
long long ans = 1e18;
void dfs(int n,int pos,unordered_set<int> visited,ll cost){
if(cost >= ans){
return;
}
visited.insert(pos);
if(visited.size() == n){
ans = min(ans,cost);
return;
}
for(int i=0;i<n;i++){
if(visited.count(i) == 0){
dfs(n,i,visited,cost+costTable[pos][i]);
}
}
}
long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
int n = (int) s.size();
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j==i){
costTable[i][j] = 0;
}else{
// cout << i << " " << j << " " << t[i] << " " << s[i] << " " << t[j] << " " << s[j] << endl;
costTable[i][j] = max(0,t[i]-s[j]);
}
}
}
// cout << endl;
// for(int i=0;i<n;i++){
// for(int j=0;j<n;j++){
// cout << costTable[i][j] << " ";
// }cout << endl;
// }
unordered_set<int> visited;
for(int i=0;i<n;i++){
dfs(n,i,visited,0);
}
return ans;
}