Submission #100035

#	Time	Username	Problem	Language	Result	Execution time	Memory
100035		jamielim	Roller Coaster Railroad (IOI16_railroad)	C++14	64 / 100	405 ms	19072 KiB

railroad

#include <bits/stdc++.h>
#include "railroad.h"
using namespace std;

long long adj[20][20];
long long memo[20][66000];

long long tsp(int x,int bm){
    if(memo[x][bm]!=-1)return memo[x][bm];
    if(bm==0)return memo[x][bm]=0;
    long long ans=1000000000000000010;
    int bm2=bm;
    while(bm2&(-bm2)){
        int y=__builtin_ctz(bm2);
        ans=min(ans,tsp(y,bm-(bm2&(-bm2)))+adj[x][y]);
        bm2-=(bm2&(-bm2));
    }
    return memo[x][bm]=ans;
}

long long plan_roller_coaster(vector<int> s, vector<int> t) {
    int n=(int)s.size();
    if(n>16){
        set<pair<int,int> > T;
        for(int i=0;i<n;i++)T.insert(make_pair(t[i],i));
      	T.insert(make_pair(1,-1));
        vector<pair<int,int> > S;
        for(int i=0;i<n;i++)S.push_back(make_pair(s[i],i));
        sort(S.begin(),S.end());
        for(int i=0;i<n;i++){
            set<pair<int,int> >::iterator it=T.upper_bound(make_pair(S[i].first,1000000010));
            if(it==T.begin())return 1;
            --it;
            if(it->second==S[i].second){
                if(it==T.begin())return 1;
                --it;
            }
            T.erase(it);
        }
        return 0;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            if(i==j)adj[i][j]=0;
            else adj[i][j]=max(0,t[i]-s[j]);
        }
    }
    memset(memo,-1,sizeof(memo));
    long long ans=4000000000000000010;
    for(int i=0;i<n;i++){
        ans=min(ans,tsp(i,(1<<n)-1-(1<<i)));
    }
    return ans;
}

• Subtask 1: 11 / 11
• Subtask 2: 23 / 23
• Subtask 3: 30 / 30
• Subtask 4: 0 / 36