Submission #1044938

#	Time	Username	Problem	Language	Result	Execution time	Memory
1044938		vjudge1	다리 (APIO19_bridges)	C++17	13 / 100	26 ms	7772 KiB

bridges

#pragma GCC optimize("unroll-loops,Ofast,O3")
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define spc << " " <<
#define endl "\n"
#define all(x) x.begin(), x.end()
#define int long long
#define ii pair<long long,int>
#define vi vector<int>
#define vii vector<ii>
#define st first
#define nd second
#define inf 1e15
#define MOD 1000000007
#define MX 50005
using namespace std;

vii edges[MX];
int wei[2*MX];
int vis[MX];
int dfs(int node, int lim){
    vis[node]=1;
    int res=1;
    for(auto p:edges[node]){
        if(vis[p.st] || wei[p.nd]<lim) continue;
        res += dfs(p.st, lim);
    }
    return res;
}

void solve(){
    int n,m,q; cin >> n >> m;
    for(int i=1; i<=m; i++){
        int a,b,c; cin >> a >> b >> c;
        edges[a].pb({b,i});
        edges[b].pb({a,i});
        wei[i]=c;
    }
    cin >> q;
    if(n<=1000 && m<=1000 && q<=10000){
        for(int i=1; i<=q; i++){
            int a,b,c; cin >> a >> b >> c;
            if(a==1){
                wei[b]=c;
            }
            else{
                for(int i=1; i<=n; i++) vis[i]=0;
                cout << dfs(b, c) << endl;
            }
        }
        return;
    }
}
 
 
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    #ifdef Local
    freopen("in","r",stdin);
    freopen("out","w",stdout);
    #endif
 
    /*freopen("nondec.in","r",stdin);
    freopen("nondec.out","w",stdout);*/
 
    int t=1;
    //cin >> t;
    while(t--) solve();
}

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