# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
123674 | tinjyu | Roller Coaster Railroad (IOI16_railroad) | C++14 | 2045 ms | 6840 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>
using namespace std;
long long int n,tag[100],s[100],e[100],ans=1000000000000;
long long int find(int p,long long int tmp,int f)
{
if(tmp>ans)return 0;
if(p==n)
{
ans=tmp;
return 0;
}
for(int i=0;i<n;i++)
{
if(tag[i]==1)continue;
tag[i]=1;
if(f>s[i])find(p+1,tmp+f-s[i],e[i]);
else find(p+1,tmp,e[i]);
tag[i]=0;
}
}
long long plan_roller_coaster(std::vector<int> x, std::vector<int> y) {
n = (int) x.size();
for(int i=0;i<n;i++)
{
s[i]=x[i];
e[i]=y[i];
}
find(0,0,1);
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... |