Submission #429891

#	Time	Username	Problem	Language	Result	Execution time	Memory
429891		Tangent	Shortcut (IOI16_shortcut)	C++17	31 / 100	2065 ms	2548 KiB

shortcut

#include "shortcut.h"
#include "bits/stdc++.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;

#define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c) {
    vll cum = {0};
    forin(x, l) {
        cum.emplace_back(cum.back() + x);
    }
    // ll curr = d[0], curri = 0;
    // vii left = {0}, right(n);
    // right[n - 1] = n - 1;
    // rep(i, n - 1) {
    //     curr += l[i];
    //     if (d[i + 1] > curr) {
    //         curri = i + 1;
    //         curr = d[i + 1];
    //     }
    //     left.emplace_back(curri);
    // }
    // curr = d[n - 1], curri = n - 1;
    // fford(i, n - 2, -1) {
    //     curr += l[i];
    //     if (d[i] > curr) {
    //         curri = i;
    //         curr = d[i];
    //     }
    //     right[i] = curri;
    // }

    vector<pair<ll, pii>> dists;
    rep(i, n - 1) {
        ffor(j, i + 1, n) {
            dists.emplace_back(cum[j] - cum[i] + d[i] + d[j], make_pair(i, j));
        }
    }
    sort(all(dists), greater<>());

    ll res = dists[0].first;
    rep(i, n - 1) {
        ffor(j, i + 1, n) {
            ll curr = 0;
            forin(dist, dists) {
                if (dist.first <= curr) {
                    break;
                }
                curr = max(curr, min(dist.first, abs(cum[i] - cum[dist.second.first]) + abs(cum[j] - cum[dist.second.second]) + c + d[dist.second.first] + d[dist.second.second]));
                if (curr >= res) {
                    break;
                }
            }
            res = min(res, curr);
        }
    }
    return res;
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 14
• Subtask 3: 8 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3