Submission #769691

#	Time	Username	Problem	Language	Result	Execution time	Memory
769691		boyliguanhan	Bridges (APIO19_bridges)	C++17	13 / 100	3084 ms	10332 KiB

bridges

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
#define MAXN 100100
int n,m,q, w[MAXN];
vector<pair<int, int>> adj[MAXN];
bool b[500100];
int ans = 0;
void dfs(int n, int wl) {
    if(b[n])
        return;
    b[n] = 1, ans+=1;
    for(auto i: adj[n])
        if(w[i.second] >= wl)
            dfs(i.first, wl);
}
signed main() {
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a,b;
        cin >> a >> b >> w[i];
        adj[a].push_back({b,i});
        adj[b].push_back({a,i});
    }
    cin >> q;
    for(int i = 0; i < q; i++) {
        int t,s,wl;
        cin >> t >> s >> wl;
        if(t-1) {
            ans = 0;
            memset(b, 0, sizeof b);
            dfs(s, wl);
            cout << ans << '\n';
        } else {
            w[s-1] = wl;
        }
    }
}

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