제출 #906466

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
906466		vjudge1	Shortcut (IOI16_shortcut)	C++17	23 / 100	2101 ms	604 KiB

shortcut

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

using namespace std;

using vi = vector<int>;
using ll = long long;

ll find_shortcut(int n, vi l, vi d, int c) {
    vector<ll> sl;    
    for(int i = 0; i < n - 1; ++i) {
        sl.push_back(l[i]);
        if(i) sl[i] += sl[i - 1];
    }

    auto dist_direct = [&](int u, int v) {
        if(u > v) swap(u, v);
        if(!v) return 0ll;
        if(u) return sl[v - 1] - sl[ u - 1 ];
        else return sl[v - 1];
    };

    auto dist = [&](int u, int v, int st, int dr) { /// (st, dr) express line
        ll re = dist_direct(u, v);
        re = min(re, dist_direct(u, st) + dist_direct(dr, v) + c);
        re = min(re, dist_direct(u, dr) + dist_direct(st, v) + c);
        return re + d[u] + d[v];
    };

    ll re = 1e18;
    for(int st = 0; st < n; ++st) {
        for(int dr = st + 1; dr < n; ++dr) {
            ll cre = 0;
            for(int i = 0; i < n; ++i)
                for(int j = i + 1; j < n; ++j) {
                    cre = max(cre, dist(i, j, st, dr));
                }
            re = min(re, cre);
        }
    }
    return re; 
}

• Subtask 1: 9 / 9
• Subtask 2: 14 / 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