제출 #492908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
492908		dxz05	Shortcut (IOI16_shortcut)	C++14	0 / 100	16 ms	23784 KiB

shortcut

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

using namespace std;

typedef long long ll;

vector<pair<int, int>> g[1000010];
ll diam(int n, int c, vector<int> &d, int x, int y){
    g[x].emplace_back(y, c);
    g[y].emplace_back(x, c);

    ll res = 0;
    for (int i = 0; i < n; i++){
        priority_queue<pair<ll, int>> q;
        q.push({0, i});

        vector<bool> processed(n, false);
        vector<ll> dist(n, 1e9);
        dist[i] = 0;

        while (!q.empty()){
            int v = q.top().second; q.pop();
            if (processed[v]) continue;
            processed[v] = true;

            for (auto edge : g[v]){
                int u = edge.first, w = edge.second;
                if (dist[u] > dist[v] + w){
                    dist[u] = dist[v] + w;
                    q.push({-dist[u], u});
                }
            }
        }

        for (int j = 0; j < n; j++){
            if (j != i) res = max(res, d[i] + dist[j] + d[j]);
        }
    }

    g[x].pop_back();
    g[y].pop_back();

    return res;
}

long long find_shortcut(int n, vector<int> l, vector<int> d, int c){
    for (int i = 0; i < n - 1; i++){
        g[i].emplace_back(i + 1, l[i]);
        g[i + 1].emplace_back(i, l[i]);
    }

    ll res = 1e18;
    for (int i = 0; i < n; i++){
        for (int j = i + 1; j < n; j++){
            res = min(res, diam(n, c, d, i, j));
        }
    }

    return res;
}

• 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