제출 #333693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
333693		ncduy0303	관광 (NOI14_sightseeing)	C++17	25 / 25	2814 ms	195788 KiB

sightseeing

#include <bits/stdc++.h>

using namespace std;

#define ar array
#define ll long long

const int MAX_N = 5e5 + 1;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const ll LINF = 1e18;

int n, m, q;
vector<ar<int,3>> el;
vector<ar<int,2>> adj[MAX_N];
vector<int> dist;

struct DSU {
    vector<int> p, sz;
    DSU(int n) {
        p.resize(n); for (int i = 0; i < n; i++) p[i] = i;
        sz.assign(n, 1);
    }
    int find(int u) {return u == p[u] ? u : p[u] = find(p[u]);}
    bool same(int u, int v) {return find(u) == find(v);}
    void merge(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;
        if (sz[u] > sz[v]) swap(u, v);
        sz[v] += sz[u];
        p[u] = v;
    }
};

void dijk(int s) {
    dist.assign(n + 1, 0);
    priority_queue<ar<int,2>> pq;
    dist[s] = INF; pq.push({0, s});
    while (pq.size()) {
        auto [d, u] = pq.top(); pq.pop();
        if (d > dist[u]) continue;
        for (auto [v, w] : adj[u]) {
            if (dist[v] < min(dist[u], w)) {
                dist[v] = min(dist[u], w);
                pq.push({dist[v], v});
            }
        }
    } 
}

void solve() {
    cin >> n >> m >> q;
    while (m--) {
        int u, v, w; cin >> u >> v >> w;
        el.push_back({w, u, v});
    }
    sort(el.rbegin(), el.rend());
    DSU uf(n + 1);
    for (auto[ w, u, v] : el) {
        if (uf.same(u, v)) continue;
        uf.merge(u, v);
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }
    dijk(1);
    while (q--) {
        int u; cin >> u;
        cout << dist[u] << "\n";
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);

    int tc = 1;
    // cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t  << ": ";
        solve();
    }
}

• Subtask 1: 4 / 4
• Subtask 2: 5 / 5
• Subtask 3: 6 / 6
• Subtask 4: 10 / 10