oj.uz

Submission #967281

# Submission time Handle Problem Language Result Execution time Memory
967281 2024-04-21T17:07:32 Z VMaksimoski008 Bridges (APIO19_bridges) C++14
13 / 100
 177 ms 3796 KB 
#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.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 177 ms 636 KB Output is correct
4 Correct 5 ms 604 KB Output is correct
5 Correct 13 ms 824 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 13 ms 604 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 14 ms 604 KB Output is correct
11 Correct 15 ms 604 KB Output is correct
12 Correct 14 ms 612 KB Output is correct
13 Correct 19 ms 604 KB Output is correct
14 Correct 25 ms 612 KB Output is correct
15 Correct 20 ms 600 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 10 ms 464 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2196 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1492 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 3796 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 2196 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 1 ms 452 KB Output is correct
3 Correct 177 ms 636 KB Output is correct
4 Correct 5 ms 604 KB Output is correct
5 Correct 13 ms 824 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 10 ms 344 KB Output is correct
8 Correct 13 ms 604 KB Output is correct
9 Correct 12 ms 344 KB Output is correct
10 Correct 14 ms 604 KB Output is correct
11 Correct 15 ms 604 KB Output is correct
12 Correct 14 ms 612 KB Output is correct
13 Correct 19 ms 604 KB Output is correct
14 Correct 25 ms 612 KB Output is correct
15 Correct 20 ms 600 KB Output is correct
16 Correct 9 ms 344 KB Output is correct
17 Correct 10 ms 464 KB Output is correct
18 Incorrect 10 ms 2196 KB Output isn't correct
19 Halted 0 ms 0 KB -