Submission #100062

#	Time	Username	Problem	Language	Result	Execution time	Memory
100062		dantoh000	Roller Coaster Railroad (IOI16_railroad)	C++14	0 / 100	141 ms	40500 KiB

railroad

//#include "railroad.h"
#include <bits/stdc++.h>
#define INF 1e18
using namespace std;
int n;
vector<int> s, t;
long long memo[19][270000];
long long dp(int id, int mask){
    //printf("%lld %lld\n",id,mask);
    if (mask == (1<<n) - 1) return 0;
    if (memo[id][mask] != -1) return memo[id][mask];
    memo[id][mask] = INF;
    for (int i = 0; i < n; i++){
        if (!(mask&(1<<i))){
            memo[id][mask] = min(memo[id][mask],dp(i,(mask|(1<<i)))+max(0,t[id]-s[i]));
        }
    }
    return memo[id][mask];
}

long long plan_roller_coaster(vector<int> t1, vector<int> t2) {
    n = (int) t1.size();
    for (int i = 0; i < n; i++){
        s.push_back(t1[i]);
        t.push_back(t2[i]);
    }
    long long ans = INF;
    int ans2 = 0;
    sort(s.begin(),s.end(),greater<int>());
    s.pop_back();
    sort(t.begin(),t.end());
    t.pop_back();
    reverse(t.begin(),t.end());
    for (int i = 0; i < s.size(); i++){
        //printf("%d -> %d\n",t[i],s[i]);
        if (t[i] > s[i]) {
            ans2 = 1;
        }
    }
    if (n <= 18){
        memset(memo,-1,sizeof(memo));
        for (int i = 0; i < n; i++){
            ans = min(ans,dp(i,1<<i));
        }
        if (ans2) assert(ans != 0);
        else assert(ans == 0);
        return ans;
    }
    return ans2;
}

Compilation message (stderr)

railroad.cpp: In function 'long long int plan_roller_coaster(std::vector<int>, std::vector<int>)':
railroad.cpp:34:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < s.size(); i++){
                     ~~^~~~~~~~~~

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