Submission #590663

#	Time	Username	Problem	Language	Result	Execution time	Memory
590663		Vanilla	Shortcut (IOI16_shortcut)	C++17	0 / 100	0 ms	212 KiB

shortcut

#include <bits/stdc++.h>
#include "shortcut.h"
typedef long long int64;
using namespace std;
const int maxn = 3e3 + 2;
int64 pref[maxn];

struct way {
    int64 l, r, cost;
};

long long find_shortcut(int n, vector<int> l, vector<int> d, int c){
    vector <way> a;
    for (int i = 0; i < n; i++){
        pref[i] = l[i] + (i ? pref[i-1]: 0);
    }
    auto query = [] (int l, int r) -> int64 {
        if (l > r) swap(l, r);
        if (r == 0 || l == r) return 0;
        return pref[r-1] - (l - 1 ? 0: pref[l-1]);
    };
    for (int i = 0; i < n; i++){
        for (int j = i + 1; j < n; j++){
            a.push_back({i, j, d[i] + d[j] + query(i, j)});
        }
    }
    sort(a.begin(), a.end(), [] (way &a, way &b) {
        if (a.cost != b.cost) return a.cost > b.cost;
        if (a.l != b.l) return a.l < b.l;
        return a.r < b.r;
    });
    auto add = [&] (int l, int r) -> int64 {
        int64 diam = 0;
        for (int i = 0; i < n; i++){
            for (int j = i + 1; j < n; j++){
                diam = max(diam, (int64) d[i] + d[j] + min(query(i, j), query(i, l) + c + query(r, j)));
            }
        }
        return diam;
    };
    // int64 rs = a[0].cost;
    // for (int i = 0; i < n; i++){
    //     for (int j = i + 1; j < n; j++){
    //         rs = min(rs, add(i, j));
    //     }
    // }
    return min(a[0].cost, add(a[0].l, a[0].r));
}

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