Submission #1152888

#	Time	Username	Problem	Language	Result	Execution time	Memory
1152888		alexdd	Roller Coaster Railroad (IOI16_railroad)	C++20	64 / 100	128 ms	22340 KiB

railroad

#include "railroad.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
int n;
vector<int> s,t;
int brut()
{
    vector<vector<int>> dp((1<<n),vector<int>(n,INF));
    for(int i=0;i<n;i++)
        dp[(1<<i)][i]=0;
    for(int config=1;config<(1<<n);config++)
    {
        if(config == (config&(-config)))
            continue;
        for(int ult=0;ult<n;ult++)
        {
            if(!((1<<ult)&config))
                continue;
            for(int p=0;p<n;p++)
            {
                if(p==ult || !((1<<p)&config))
                    continue;
                dp[config][ult] = min(dp[config][ult], dp[config-(1<<ult)][p] + max(0LL, t[p] - s[ult]));
            }
        }
    }
    int mnm=INF;
    for(int i=0;i<n;i++)
        mnm = min(mnm, dp[(1<<n)-1][i]);
    return mnm;
}
int isvalid()
{
    vector<pair<int,int>> v;
    for(int i=0;i<n;i++)
        v.push_back({t[i],s[i]});
    sort(v.begin(),v.end());
    reverse(v.begin(),v.end());
    set<pair<int,int>> libere;
    for(int i=0;i<n;i++)
        libere.insert({v[i].second, i});
    for(int i=1;i<n;i++)
    {
        /*int best = -1;
        for(int j=0;j<n;j++)
        {
            if(i==j || folosit[j])
                continue;
            if(v[j].second >= v[i].first && (best==-1 || v[j].second < v[best].second))
            {
                best = j;
            }
        }
        if(best==-1)
            return 0;
        folosit[best]=1;*/
        auto it = libere.lower_bound({v[i].first, -1});
        if(it!=libere.end() && (*it).second==i)
            it++;
        if(it==libere.end())
            return 0;
        libere.erase(it);
    }
    return 1;
}
long long plan_roller_coaster(std::vector<int32_t> cit_s, std::vector<int32_t> cit_t)
{
    n = cit_s.size();
    s.resize(n);
    t.resize(n);
    for(int i=0;i<n;i++)
    {
        s[i] = cit_s[i];
        t[i] = cit_t[i];
    }
    if(n<=16) return brut();
    /*int rez_brut = brut();
    int valid_rez = isvalid();
    if(rez_brut==0 && valid_rez==0)
    {
        assert(0);
        while(1);
    }
    if(rez_brut!=0 && valid_rez!=0)
    {
        assert(0);
        while(1);
    }
    return rez_brut;*/
    return 1 - isvalid();
}
/*

4
1 7
4 3
5 8
6 6

output: 3



*/

Compilation message (stderr)

railroad.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
railroad_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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