Submission #1042797

#	Time	Username	Problem	Language	Result	Execution time	Memory
1042797		Zicrus	Roller Coaster Railroad (IOI16_railroad)	C++17	11 / 100	2045 ms	6480 KiB

railroad

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

typedef long long ll;

ll plan_roller_coaster(vector<int> s, vector<int> t) {
    ll n = s.size();

    vector<pair<ll, ll>> a(n);
    for (int i = 0; i < n; i++) {
        a[i] = {s[i], t[i]};
    }
    mt19937 mt(time(0));

    ll finalRes = 1ll << 62ll;
    bool done;
    for (int k = 0; k < 5000000; k++) {
        shuffle(a.begin(), a.end(), mt);
        ll res = 0;
        for (int i = 1; i < n; i++) {
            res += max(0ll, a[i-1].second - a[i].first);
        }

        do {
            done = true;
            for (int i = 1; i < n; i++) {
                ll prev = max(0ll, a[i-1].second - a[i].first);
                ll nw = max(0ll, a[i].second - a[i-1].first);
                if (i > 1) {
                    prev += max(0ll, a[i-2].second - a[i-1].first);
                    nw += max(0ll, a[i-2].second - a[i].first);
                }
                if (i < n-1) {
                    prev += max(0ll, a[i].second - a[i+1].first);
                    nw += max(0ll, a[i-1].second - a[i+1].first);
                }
                if (nw < prev) {
                    swap(a[i-1], a[i]);
                    done = false;
                    res += nw - prev;
                }
            }
        } while (!done);

        finalRes = min(finalRes, res);
    }
    
    return finalRes;
}

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