제출 #926324

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
926324		TAhmed33	다리 (APIO19_bridges)	C++98	0 / 100	146 ms	4552 KiB

bridges

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 25;
int n, m;
struct DSU {
    int sze[MAXN], par[MAXN];
    void init (int n) {
        for (int i = 1; i <= n; i++) {
            sze[i] = 1; par[i] = i;
        }
    }
    int find (int x) {
        return par[x] == x ? x : par[x] = find(par[x]);
    }
    void merge (int a, int b) {
        a = find(a); b = find(b);
        if (a == b) return;
        if (sze[a] > sze[b]) swap(a, b);
        sze[b] += sze[a]; par[a] = b;
    }
} cur;
array <int, 3> p[MAXN];
int ans[MAXN];
int main () {
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b, c; cin >> a >> b >> c; p[i] = {a, b, c};
    }
    sort(p + 1, p + m + 1, [] (array <int, 3> &x, array <int, 3> &y) {
        return x[2] > y[2];
    }); int ptr = 1;
    int q; cin >> q;
    vector <array <int, 3>> queries;
    for (int i = 1; i <= q; i++) {
        int a, b; cin >> a >> a >> b;
        queries.push_back({b, a, i});
    }
    sort(queries.begin(), queries.end());
    reverse(queries.begin(), queries.end());
    cur.init(n); 
    for (auto i : queries) {
        while (ptr <= m && p[ptr][2] >= i[2]) {
            cur.merge(p[ptr][0], p[ptr][1]); ptr++;
        }
        ans[i[2]] = cur.sze[cur.find(i[1])];
    }
    for (int i = 1; i <= q; i++) cout << ans[i] << '\n';
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27