Submission #893444

#	Time	Username	Problem	Language	Result	Execution time	Memory
893444		Warinchai	Bridges (APIO19_bridges)	C++14	13 / 100	3060 ms	11304 KiB

bridges

#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> >v[100005];
int w[100005];
int vis[100005];
int dfs(int x,int wc){
    vis[x]=1;
    int sz=1;
    for(auto e:v[x]){
        if(w[e.second]>=wc&&vis[e.first]==0){
            sz+=dfs(e.first,wc);
        }
    }
    return sz;
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        v[a].push_back({b,i});
        v[b].push_back({a,i});
        w[i]=c;
    }
    int q;
    cin>>q;
    while(q--){
        int t;
        cin>>t;
        if(t==1){
            int x,r;
            cin>>x>>r;
            w[x]=r;
        }else{
            int s,w;
            cin>>s>>w;
            cout<<dfs(s,w)<<"\n";
            for(int i=1;i<=n;i++)vis[i]=0;
        }
    }
}

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