Submission #954684

#	Time	Username	Problem	Language	Result	Execution time	Memory
954684		GrindMachine	Roller Coaster Railroad (IOI16_railroad)	C++17	34 / 100	416 ms	524288 KiB

railroad

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "railroad.h"

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t) {
    ll n = sz(s);
    vector<pll> a(n);
    rep(i,n) a[i] = {s[i],t[i]};

    ll dp[1<<n][n];
    memset(dp,0x3f,sizeof dp);
    rep(i,n) dp[1<<i][i] = 0;

    rep(mask,1<<n){
        rep(i,n){
            if(!(mask&(1<<i))) conts;
            rep(j,n){
                if(mask&(1<<j)) conts;
                ll val = dp[mask][i];
                if(a[i].ss >= a[j].ff){
                    val += a[i].ss-a[j].ff;
                }
                amin(dp[mask|(1<<j)][j],val);
            }
        }
    }

    ll ans = inf2;
    rep(i,n) amin(ans,dp[(1<<n)-1][i]);

    return ans;
}

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