제출 #285559

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
285559		SamAnd	Roller Coaster Railroad (IOI16_railroad)	C++17	11 / 100	2073 ms	5880 KiB

railroad

#include "railroad.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;
const int N = 200005;
struct ban
{
    int s, t;
};

int n;
ban a[N];

bool operator<(const ban& a, const ban& b)
{
    if (a.s < b.s)
        return true;
    if (a.s > b.s)
        return false;
    return a.t < b.t;
}

long long plan_roller_coaster(std::vector<int> s, std::vector<int> t)
{
    n = sz(s);
    for (int i = 1; i <= n; ++i)
    {
        a[i].s = s[i - 1];
        a[i].t = t[i - 1];
    }
    sort(a + 1, a + n + 1);
    ll ans = 0;
    for (int i = 1; i < n; ++i)
    {
        ans += max(0, a[i].t - a[i + 1].s);
    }
    do
    {
        ll yans = 0;
        for (int i = 1; i < n; ++i)
        {
            yans += max(0, a[i].t - a[i + 1].s);
        }
        ans = min(ans, yans);
    } while (next_permutation(a + 1, a + n + 1));

    return ans;
}

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