제출 #967281

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
967281		VMaksimoski008	다리 (APIO19_bridges)	C++14	13 / 100	177 ms	3796 KiB

bridges

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

struct DSU {
    int n, comp;
    vector<int> par, size;

    void config(int _n) {
        n = _n + 1;
        comp = _n;
        par.resize(n+1);
        size.resize(n+1, 1);
        for(int i=1; i<=n; i++) par[i] = i;
    }

    int get(int u) {
        if(u == par[u]) return u;
        return par[u] = get(par[u]);
    }

    bool uni(int u, int v) {
        u = get(u), v = get(v);

        if(u == v) return false;
        if(size[u] < size[v]) swap(u, v);

        size[u] += size[v];
        par[v] = u;
        comp--;

        return true;
    }

    int getComp() { return comp; }
    int getSize(int u) { return size[get(u)]; }
    bool sameSet(int u, int v) { return get(u) == get(v); }
};

struct Edge {
    int a, b, w;
    bool operator<(Edge &e) { return w < e.w; }
};

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);
    
    int n, m;
    cin >> n >> m;

    vector<Edge> edges(m);
    for(Edge &e : edges) cin >> e.a >> e.b >> e.w;

    int q;
    cin >> q;

    if(n <= 1000 && m <= 1000 && q <= 10000) {
        while(q--) {
            int t;
            cin >> t;

            if(t == 1) {
                int a, b;
                cin >> a >> b;
                edges[a-1].w = b;
            } else {
                int u, w;
                cin >> u >> w;
                DSU dsu; dsu.config(n);
                vector<Edge> E = edges;
                sort(rall(E));
                for(Edge &e : E) {
                    if(e.w < w) break;
                    dsu.uni(e.a, e.b);
                }
                cout << dsu.getSize(u) << '\n';
            }
        }
        return 0;
    }

    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