| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 100012 | owl10124 | 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 <bits/stdc++.h>
#include "railroad.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
vector<ii> segs;
int n;
ll m[16][1<<16];
ll dp(int seg, int bm) {
if (m[seg][bm]+1) return m[seg][bm];
if (bm==(1<<n)-1) return m[seg][bm]=0;
ll l = 1ll<<60-1;
for (int i=0;i<n;i++) {
if (((1<<i)&~bm)) l=min(l,(seg!=-1&&segs[seg].second>segs[i].first?segs[seg].second-segs[i].first:0)+dp(i,bm|(1<<i)));
}
//printf("%d %d %d %lld\n",segs[seg].second,seg,bm,l);
return m[seg][bm]=l;
}
ll plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
fill(&m[0][0],&m[n][0],-1);
n = (int) s.size();
for (int i=0;i<n;i++) segs.push_back(make_pair(s[i],t[i]));
return dp(-1,0);
}
int main() {
int n;
assert(1 == scanf("%d", &n));
std::vector<int> s(n), t(n);
for (int i = 0; i < n; ++i)
assert(2 == scanf("%d%d", &s[i], &t[i]));
long long ans = plan_roller_coaster(s, t);
printf("%lld\n", ans);
return 0;
}