제출 #1345764

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1345764		killerzaluu	다리 (APIO19_bridges)	C++20	13 / 100	3092 ms	6212 KiB

bridges

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    vector<int> u(m + 1), v(m + 1), d(m + 1);
    vector<vector<pair<int,int>>> g(n + 1);

    for (int i = 1; i <= m; i++) {
        cin >> u[i] >> v[i] >> d[i];
        g[u[i]].push_back({v[i], i});
        g[v[i]].push_back({u[i], i});
    }

    int q;
    cin >> q;

    vector<int> vis(n + 1, 0);
    int timer = 0;

    while (q--) {
        int t;
        cin >> t;

        if (t == 1) {
            int b, r;
            cin >> b >> r;
            d[b] = r;
        } else {
            int s, w;
            cin >> s >> w;

            timer++;
            queue<int> qu;
            qu.push(s);
            vis[s] = timer;

            int ans = 1;

            while (!qu.empty()) {
                int x = qu.front();
                qu.pop();

                for (auto [to, id] : g[x]) {
                    if (d[id] < w) continue;
                    if (vis[to] == timer) continue;
                    vis[to] = timer;
                    ans++;
                    qu.push(to);
                }
            }

            cout << ans << '\n';
        }
    }

    return 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