제출 #672837

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
672837		YENGOYAN	Evacuation plan (IZhO18_plan)	C++17	41 / 100	4019 ms	36628 KiB

plan

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>

using namespace std;
using ll = long long;
const int N = 1e5 + 5;
const ll mod = 1e9 + 7, inf = 1e18;

int n, m, k, q;
vector<vector<pair<int, ll>>> gp;
vector<ll> g, mind, par, sizes;
vector<pair<ll, int>> vp;
int get(int u) {
    if (u == par[u]) return u;
    return par[u] = get(par[u]);
}

void union_sets(int u, int v) {
    int a = get(u), b = get(v);
    if (a == b) return;
    if (sizes[a] < sizes[b])swap(a, b);
    par[b] = a;
    sizes[a] += sizes[b];
}

bool check(int x, int y, ll W) {
    sizes = par = vector<ll> (n, 1);
    for (int i = 0; i < n; ++i) par[i] = i;
    for (int i = 0; i < n; ++i) {
        for (pair<int, ll>& v : gp[i]) {
            if (min(mind[i], mind[v.first]) >= W) union_sets(i, v.first);
        }
    }
    return get(x) == get(y);
}

void solve() {
    cin >> n >> m;
    gp = vector<vector<pair<int, ll>>>(n);
    mind = vector<ll>(n, 1e18);
    for (int i = 0; i < m; ++i) {
        int u, v, w; cin >> u >> v >> w;
        gp[--u].push_back({ --v, w });
        gp[v].push_back({ u, w });
    }
    cin >> k;
    g = vector<ll>(k);
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
    for (int i = 0; i < k; ++i) cin >> g[i], --g[i], pq.push({ 0, g[i] }), mind[g[i]] = 0;
    while (pq.size()) {
        pair<ll, int> p = pq.top();
        pq.pop();
        ll d = p.first, u = p.second;
        if (mind[u] < d) continue;
        for (pair<int, ll> v : gp[u]) {
            if (mind[v.first] > mind[u] + v.second) {
                mind[v.first] = mind[u] + v.second;
                pq.push({ mind[v.first], v.first });
            }
        }
    }
    //for (int i = 0; i < n; ++i) cout << mind[i] << " "; cout << endl;
    cin >> q;
    while (q--) {
        int s, t; cin >> s >> t; --s, --t;
        ll l = 0, r = 1e15;
        while (l + 1 < r) {
            int m = (l + r) / 2;
            if (check(s, t, m)) l = m;
            else r = m;
        }
        cout << l << endl;
    }
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	//int _; cin >> _; while (_--)
		solve();
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 13
• Subtask 3: 12 / 12
• Subtask 4: 19 / 19
• Subtask 5: 0 / 46