제출 #977690

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
977690		ZHIRDILBILDIZ	다리 (APIO19_bridges)	C++14	13 / 100	3055 ms	20956 KiB

bridges

#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>

using namespace std;
const int N = 5e4 + 10;

set<pair<pii, int>> gr[N];
bool us[N];
vector<int> now;
void dfs (int city, int w) {
    us[city] = 1;
    now.push_back(city);
    for (auto i : gr[city]) {
        if (us[i.fi.fi] || i.fi.se < w)
            continue;
        dfs(i.fi.fi, w);
    }
}

signed main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        int n, m, q;
        cin >> n >> m;
        int u[m + 1], v[m + 1], w[m + 1];
        for (int i = 1; i <= m; ++i) {
            cin >> u[i] >> v[i] >> w[i];
            gr[u[i]].insert({{v[i], w[i]}, i});
            gr[v[i]].insert({{u[i], w[i]}, i});
        }
        cin >> q;
        while (q--) {
            int type;
            int l, r;
            cin >> type >> l >> r;
            if (type == 1) {
                gr[u[l]].erase({{v[l], w[l]}, l});
                gr[v[l]].erase({{u[l], w[l]}, l});
                w[l] = r;
                gr[u[l]].insert({{v[l], w[l]}, l});
                gr[v[l]].insert({{u[l], w[l]}, l});
            } else {
                now.clear();
                dfs(l, r);
                for (int i : now)
                    us[i] = 0;
                cout << now.size() << '\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