Submission #1029190

#	Time	Username	Problem	Language	Result	Execution time	Memory
1029190		c2zi6	Shortcut (IOI16_shortcut)	C++14	0 / 100	2070 ms	432 KiB

shortcut

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "shortcut.h"

VL distances(VVPI& gp, int s) {
    int n = gp.size();
    priority_queue<PLL> pq;
    VL dist(n, 1e18);
    VI vis(n);
    pq.push({0, s});
    dist[s] = 0;
    while (pq.size()) {
        int u = pq.top().ss;
        pq.pop();
        if (vis[u]) continue;
        vis[u] = true;
        for (auto[v, w] : gp[u]) {
            if (dist[u] + w < dist[v]) {
                dist[v] = dist[u] + w;
                pq.push({-dist[v], v});
            }
        }
    }
    return dist;
}

ll vmax(VL a) {
    ll ret = 0;
    for (ll x : a) setmax(ret, x);
    return ret;
}

ll diameter(VVPI& gp) {
    int n = gp.size();
    ll ret = 0;
    rep(u, n) setmax(ret, vmax(distances(gp, u)));
    return ret;
}

ll find_shortcut(int n, VI l, VI d, int c) {
    VVPI gp(2*n);
    rep(u, n) {
        gp[u].pb({u+n, d[u]});
        gp[u+n].pb({u, d[u]});
    }
    rep(u, n-1) {
        gp[u].pb({u+1, l[u]});
        gp[u+1].pb({u, l[u]});
    }
    ll ans = 1e18;
    replr(l, 0, n-1) replr(r, l, n-1) {
        gp[l].pb({r, c});
        gp[r].pb({l, c});
        setmin(ans, diameter(gp));
        gp[l].pop_back();
        gp[r].pop_back();
    }
    return ans;
}

Compilation message (stderr)

shortcut.cpp: In function 'VL distances(VVPI&, int)':
shortcut.cpp:46:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   46 |         for (auto[v, w] : gp[u]) {
      |                  ^

• 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