제출 #926537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
926537		Aiperiii	다리 (APIO19_bridges)	C++14	13 / 100	3081 ms	10468 KiB

bridges

#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    vector <int> u(m+1),v(m+1),w(m+1);
    
    for(int i=1;i<=m;i++){
        cin>>u[i]>>v[i]>>w[i];
    }
    int qu;cin>>qu;
    while(qu--){
        int type,ver,x;
        cin>>type>>ver>>x;
        if(type==1)w[ver]=x;
        else{
            vector <pair <int,int> > g[n+1];
            for(int i=1;i<=m;i++){
                g[u[i]].pb({v[i],w[i]});
                g[v[i]].pb({u[i],w[i]});
            }
            vector <int> vis(n+1);
            vis[ver]=1;
            int cnt=1;
            queue <int> q;q.push(ver);
            while(!q.empty()){
                int v=q.front();
                q.pop();
                for(auto to : g[v]){
                    if(!vis[to.ff] && to.ss>=x){
                        vis[to.ff]=1;
                        cnt++;
                        q.push(to.ff);
                    }
                }
            }
            cout<<cnt<<"\n";
        }
    }
}
/*
 
 3 4
 1 2 5
 2 3 2
 3 1 4
 2 3 8
 5
 2 1 5
 1 4 1
 2 2 5
 1 1 1
 2 3 2
 */

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