Submission #406724

#	Time	Username	Problem	Language	Result	Execution time	Memory
406724		tengiz05	다리 (APIO19_bridges)	C++17	13 / 100	3092 ms	7916 KiB

bridges

#include <bits/stdc++.h>
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n, m, q;
    std::cin >> n >> m;
    std::vector<std::tuple<int, int, int>> edges;
    for (int i = 0; i < m; i++) {
        int u, v, w;
        std::cin >> u >> v >> w;
        u--;
        v--;
        edges.emplace_back(u, v, w);
    }
    std::cin >> q;
    while (q--) {
        int type;
        std::cin >> type;
        if (type == 1) {
            int b, r;
            std::cin >> b >> r;
            b--;
            std::get<2>(edges[b]) = r;
        } else {
            std::vector<std::vector<std::pair<int, int>>> e(n);
            for (auto [u, v, w] : edges) {
                e[u].emplace_back(v, w);
                e[v].emplace_back(u, w);
            }
            int s, W;
            std::cin >> s >> W;
            s--;
            int ans = 0;
            std::vector<bool> vis(n);
            std::function<void(int)> dfs = [&](int u){
                ans++;
                vis[u] = true;
                for (auto [v, w] : e[u]) {
                    if (!vis[v] && w >= W) {
                        dfs(v);
                    }
                }
            };
            dfs(s);
            std::cout << ans << '\n';
        }
    }
}

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