Submission #1367251

#	Time	Username	Problem	Language	Result	Execution time	Memory
1367251		po_rag526	Bridges (APIO19_bridges)	C++20	13 / 100	37 ms	500 KiB

bridges

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

using pii = pair<int, int>;

const int N = 1010;
int n, m, q, a[N], b[N], c[N];
vector<pii> adj[N];
bool vis[N];

int main() {
    cin.tie(nullptr)->ios_base::sync_with_stdio(false);
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> a[i] >> b[i] >> c[i];
        adj[a[i]].push_back({b[i], c[i]});
        adj[b[i]].push_back({a[i], c[i]});
    }
    cin >> q;
    while (q--) {
        int type;
        cin >> type;
        if (type == 1) {
            int x, v;
            cin >> x >> v;
            c[x] = v;
            for (int i = 1; i <= n; i++) adj[i].clear();
            for (int i = 1; i <= m; i++) {
                adj[a[i]].push_back({b[i], c[i]});
                adj[b[i]].push_back({a[i], c[i]});
            }
        }
        else {
            int s, val;
            cin >> s >> val;
            for (int i = 1; i <= n; i++) vis[i] = false;
            vis[s] = true;
            queue<int> q;
            q.push(s);
            int ans = 0;
            while (!q.empty()) {
                int u = q.front();
                q.pop();
                ans++;
                for (auto [v, w] : adj[u]) {
                    if (vis[v] || val > w) continue;
                    vis[v] = true;
                    q.push(v);
                }
            }
            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