제출 #979453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
979453		nnin	다리 (APIO19_bridges)	C++17	14 / 100	74 ms	7752 KiB

bridges

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pip pair<int,pii>
#define f first
#define s second

int n, m, q;
vector<pip> edges, query;
int ans[100005];

int dsu[50005], sz[50005];
int par(int x) {
    if(dsu[x]==x) return x;
    return dsu[x] = par(dsu[x]);
}
void init() {
    for(int i=1;i<=n;i++) {
        dsu[i] = i;
        sz[i] = 1;
    }
}
void join(int a, int b) {
    int pa = par(a);
    int pb = par(b);
    if(pa!=pb) {
        dsu[pa] = pb;
        sz[pb] += sz[pa];
    }
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin>>n>>m;
    for(int i=0;i<m;i++) {
        int u, v, w;
        cin>>u>>v>>w;
        edges.push_back({w, {u, v}});
    }
    cin>>q;
    for(int i=0;i<q;i++) {
        int t, x, y;
        cin>>t>>x>>y;
        query.push_back({y, {x, i}});
    }
    sort(edges.begin(), edges.end());
    sort(query.begin(), query.end());
    int e = m-1;
    init();
    for(int i=q-1;i>=0;i--) {
        int w = query[i].f;
        int island = query[i].s.f;
        int idx = query[i].s.s;
        while(e>=0 && edges[e].f>=w) {
            join(edges[e].s.f, edges[e].s.s);
            e--;
        }
        ans[idx] = sz[par(island)];
    }
    for(int i=0;i<q;i++) cout<<ans[i]<<'\n';
}

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