oj.uz

Submission #976768

# Submission time Handle Problem Language Result Execution time Memory
976768 2024-05-07T05:37:30 Z gaga999 Bridges (APIO19_bridges) C++17
100 / 100
 1266 ms 5068 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef pair<llt, int> pli;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 1e5 + 5, B = 1000;
int x[N], y[N], w[N], op[N], a[N], b[N], od[N], ds[N], an[N];
bool vd[N], ud[N];
vector<pii> rm;

int f(int k)
{
    return ds[k] < 0 ? k : f(ds[k]);
}

void mg(int i, int j)
{
    i = f(i), j = f(j);
    if (i != j)
    {
        if (ds[i] > ds[j])
            swap(i, j);
        rm.pb(ds[j], j);
        ds[i] += ds[j], ds[j] = i;
    }
}

inline void undo(int ln)
{
    while (size(rm) > ln)
        ds[ds[rm.back().S]] -= rm.back().F,
            ds[rm.back().S] = rm.back().F,
            rm.pop_back();
}

signed main()
{
    int n, m, q;
    rd(n, m);
    for (int i = 1; i <= m; i++)
        rd(x[i], y[i], w[i]);
    rd(q);
    for (int i = 0; i < q; i++)
        rd(op[i], a[i], b[i]);
    iota(od, od + m, 1);
    for (int l = 0; l < q; l += B)
    {
        int r = min(l + B, q);
        vector<int> cb, cq;
        for (int i = l; i < r; i++)
        {
            if (op[i] == 1) // 1 bridge number / new weight
                cb.pb(a[i]), vd[a[i]] = 1;
            else // 2 island number / weight
                cq.pb(i);
        }
        sort(iter(cb)), uni(cb);
        init(ds, -1), rm.clear();
        sort(od, od + m, [&](int i, int j)
             { return w[i] > w[j]; });
        sort(iter(cq), [&](int i, int j)
             { return b[i] > b[j]; });
        int p = 0;
        for (int k : cq)
        {
            while (p < m && w[od[p]] >= b[k])
            {
                if (!vd[od[p]])
                    mg(x[od[p]], y[od[p]]);
                p++;
            }
            int ln = size(rm);
            for (int i = k; i >= l; i--)
            {
                if (op[i] == 2 || ud[a[i]])
                    continue;
                ud[a[i]] = 1;
                if (b[i] >= b[k])
                    mg(x[a[i]], y[a[i]]);
            }
            for (int i : cb)
            {
                if (ud[i])
                    ud[i] = 0;
                else if (w[i] >= b[k])
                    mg(x[i], y[i]);
            }
            an[k] = -ds[f(a[k])];
            undo(ln);
        }
        for (int i = l; i < r; i++)
            if (op[i] == 1)
                vd[a[i]] = 0, w[a[i]] = b[i];
    }
    for (int i = 0; i < q; i++)
        if (op[i] == 2)
            prt(an[i]), putchar('\n');
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 23 ms 2600 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 14 ms 2396 KB Output is correct
6 Correct 11 ms 2396 KB Output is correct
7 Correct 12 ms 2396 KB Output is correct
8 Correct 12 ms 2396 KB Output is correct
9 Correct 11 ms 2396 KB Output is correct
10 Correct 13 ms 2396 KB Output is correct
11 Correct 12 ms 2396 KB Output is correct
12 Correct 13 ms 2584 KB Output is correct
13 Correct 18 ms 2652 KB Output is correct
14 Correct 19 ms 2392 KB Output is correct
15 Correct 14 ms 2396 KB Output is correct
16 Correct 11 ms 2392 KB Output is correct
17 Correct 11 ms 2396 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 657 ms 4100 KB Output is correct
2 Correct 639 ms 4056 KB Output is correct
3 Correct 651 ms 4056 KB Output is correct
4 Correct 685 ms 4092 KB Output is correct
5 Correct 722 ms 4092 KB Output is correct
6 Correct 1004 ms 4348 KB Output is correct
7 Correct 1022 ms 4356 KB Output is correct
8 Correct 996 ms 4352 KB Output is correct
9 Correct 34 ms 2896 KB Output is correct
10 Correct 491 ms 4056 KB Output is correct
11 Correct 480 ms 4100 KB Output is correct
12 Correct 533 ms 4344 KB Output is correct
13 Correct 549 ms 4092 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 473 ms 3676 KB Output is correct
2 Correct 356 ms 3380 KB Output is correct
3 Correct 512 ms 3724 KB Output is correct
4 Correct 483 ms 3724 KB Output is correct
5 Correct 35 ms 2896 KB Output is correct
6 Correct 506 ms 3792 KB Output is correct
7 Correct 452 ms 3788 KB Output is correct
8 Correct 406 ms 3788 KB Output is correct
9 Correct 304 ms 4044 KB Output is correct
10 Correct 294 ms 3724 KB Output is correct
11 Correct 311 ms 3676 KB Output is correct
12 Correct 274 ms 3716 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 514 ms 4820 KB Output is correct
2 Correct 37 ms 2908 KB Output is correct
3 Correct 55 ms 3716 KB Output is correct
4 Correct 36 ms 3676 KB Output is correct
5 Correct 400 ms 4808 KB Output is correct
6 Correct 491 ms 4824 KB Output is correct
7 Correct 384 ms 4824 KB Output is correct
8 Correct 231 ms 4056 KB Output is correct
9 Correct 249 ms 4052 KB Output is correct
10 Correct 230 ms 4260 KB Output is correct
11 Correct 427 ms 4536 KB Output is correct
12 Correct 352 ms 4556 KB Output is correct
13 Correct 367 ms 4552 KB Output is correct
14 Correct 426 ms 5064 KB Output is correct
15 Correct 375 ms 4928 KB Output is correct
16 Correct 517 ms 4820 KB Output is correct
17 Correct 526 ms 4820 KB Output is correct
18 Correct 527 ms 4820 KB Output is correct
19 Correct 560 ms 4812 KB Output is correct
20 Correct 458 ms 4888 KB Output is correct
21 Correct 444 ms 4888 KB Output is correct
22 Correct 538 ms 5068 KB Output is correct
23 Correct 375 ms 4828 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 657 ms 4100 KB Output is correct
2 Correct 639 ms 4056 KB Output is correct
3 Correct 651 ms 4056 KB Output is correct
4 Correct 685 ms 4092 KB Output is correct
5 Correct 722 ms 4092 KB Output is correct
6 Correct 1004 ms 4348 KB Output is correct
7 Correct 1022 ms 4356 KB Output is correct
8 Correct 996 ms 4352 KB Output is correct
9 Correct 34 ms 2896 KB Output is correct
10 Correct 491 ms 4056 KB Output is correct
11 Correct 480 ms 4100 KB Output is correct
12 Correct 533 ms 4344 KB Output is correct
13 Correct 549 ms 4092 KB Output is correct
14 Correct 473 ms 3676 KB Output is correct
15 Correct 356 ms 3380 KB Output is correct
16 Correct 512 ms 3724 KB Output is correct
17 Correct 483 ms 3724 KB Output is correct
18 Correct 35 ms 2896 KB Output is correct
19 Correct 506 ms 3792 KB Output is correct
20 Correct 452 ms 3788 KB Output is correct
21 Correct 406 ms 3788 KB Output is correct
22 Correct 304 ms 4044 KB Output is correct
23 Correct 294 ms 3724 KB Output is correct
24 Correct 311 ms 3676 KB Output is correct
25 Correct 274 ms 3716 KB Output is correct
26 Correct 633 ms 4092 KB Output is correct
27 Correct 799 ms 4172 KB Output is correct
28 Correct 668 ms 4088 KB Output is correct
29 Correct 538 ms 4296 KB Output is correct
30 Correct 797 ms 4296 KB Output is correct
31 Correct 788 ms 4292 KB Output is correct
32 Correct 783 ms 4096 KB Output is correct
33 Correct 670 ms 4108 KB Output is correct
34 Correct 662 ms 4092 KB Output is correct
35 Correct 730 ms 4096 KB Output is correct
36 Correct 539 ms 4300 KB Output is correct
37 Correct 526 ms 4116 KB Output is correct
38 Correct 528 ms 4056 KB Output is correct
39 Correct 411 ms 4092 KB Output is correct
40 Correct 457 ms 4056 KB Output is correct
41 Correct 406 ms 4088 KB Output is correct
42 Correct 366 ms 4092 KB Output is correct
43 Correct 370 ms 4100 KB Output is correct
44 Correct 367 ms 4096 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 23 ms 2600 KB Output is correct
4 Correct 4 ms 2396 KB Output is correct
5 Correct 14 ms 2396 KB Output is correct
6 Correct 11 ms 2396 KB Output is correct
7 Correct 12 ms 2396 KB Output is correct
8 Correct 12 ms 2396 KB Output is correct
9 Correct 11 ms 2396 KB Output is correct
10 Correct 13 ms 2396 KB Output is correct
11 Correct 12 ms 2396 KB Output is correct
12 Correct 13 ms 2584 KB Output is correct
13 Correct 18 ms 2652 KB Output is correct
14 Correct 19 ms 2392 KB Output is correct
15 Correct 14 ms 2396 KB Output is correct
16 Correct 11 ms 2392 KB Output is correct
17 Correct 11 ms 2396 KB Output is correct
18 Correct 657 ms 4100 KB Output is correct
19 Correct 639 ms 4056 KB Output is correct
20 Correct 651 ms 4056 KB Output is correct
21 Correct 685 ms 4092 KB Output is correct
22 Correct 722 ms 4092 KB Output is correct
23 Correct 1004 ms 4348 KB Output is correct
24 Correct 1022 ms 4356 KB Output is correct
25 Correct 996 ms 4352 KB Output is correct
26 Correct 34 ms 2896 KB Output is correct
27 Correct 491 ms 4056 KB Output is correct
28 Correct 480 ms 4100 KB Output is correct
29 Correct 533 ms 4344 KB Output is correct
30 Correct 549 ms 4092 KB Output is correct
31 Correct 473 ms 3676 KB Output is correct
32 Correct 356 ms 3380 KB Output is correct
33 Correct 512 ms 3724 KB Output is correct
34 Correct 483 ms 3724 KB Output is correct
35 Correct 35 ms 2896 KB Output is correct
36 Correct 506 ms 3792 KB Output is correct
37 Correct 452 ms 3788 KB Output is correct
38 Correct 406 ms 3788 KB Output is correct
39 Correct 304 ms 4044 KB Output is correct
40 Correct 294 ms 3724 KB Output is correct
41 Correct 311 ms 3676 KB Output is correct
42 Correct 274 ms 3716 KB Output is correct
43 Correct 514 ms 4820 KB Output is correct
44 Correct 37 ms 2908 KB Output is correct
45 Correct 55 ms 3716 KB Output is correct
46 Correct 36 ms 3676 KB Output is correct
47 Correct 400 ms 4808 KB Output is correct
48 Correct 491 ms 4824 KB Output is correct
49 Correct 384 ms 4824 KB Output is correct
50 Correct 231 ms 4056 KB Output is correct
51 Correct 249 ms 4052 KB Output is correct
52 Correct 230 ms 4260 KB Output is correct
53 Correct 427 ms 4536 KB Output is correct
54 Correct 352 ms 4556 KB Output is correct
55 Correct 367 ms 4552 KB Output is correct
56 Correct 426 ms 5064 KB Output is correct
57 Correct 375 ms 4928 KB Output is correct
58 Correct 517 ms 4820 KB Output is correct
59 Correct 526 ms 4820 KB Output is correct
60 Correct 527 ms 4820 KB Output is correct
61 Correct 560 ms 4812 KB Output is correct
62 Correct 458 ms 4888 KB Output is correct
63 Correct 444 ms 4888 KB Output is correct
64 Correct 538 ms 5068 KB Output is correct
65 Correct 375 ms 4828 KB Output is correct
66 Correct 633 ms 4092 KB Output is correct
67 Correct 799 ms 4172 KB Output is correct
68 Correct 668 ms 4088 KB Output is correct
69 Correct 538 ms 4296 KB Output is correct
70 Correct 797 ms 4296 KB Output is correct
71 Correct 788 ms 4292 KB Output is correct
72 Correct 783 ms 4096 KB Output is correct
73 Correct 670 ms 4108 KB Output is correct
74 Correct 662 ms 4092 KB Output is correct
75 Correct 730 ms 4096 KB Output is correct
76 Correct 539 ms 4300 KB Output is correct
77 Correct 526 ms 4116 KB Output is correct
78 Correct 528 ms 4056 KB Output is correct
79 Correct 411 ms 4092 KB Output is correct
80 Correct 457 ms 4056 KB Output is correct
81 Correct 406 ms 4088 KB Output is correct
82 Correct 366 ms 4092 KB Output is correct
83 Correct 370 ms 4100 KB Output is correct
84 Correct 367 ms 4096 KB Output is correct
85 Correct 1126 ms 4824 KB Output is correct
86 Correct 101 ms 3676 KB Output is correct
87 Correct 57 ms 3900 KB Output is correct
88 Correct 663 ms 4820 KB Output is correct
89 Correct 1122 ms 4772 KB Output is correct
90 Correct 749 ms 4672 KB Output is correct
91 Correct 680 ms 4052 KB Output is correct
92 Correct 712 ms 4100 KB Output is correct
93 Correct 1046 ms 4092 KB Output is correct
94 Correct 978 ms 4568 KB Output is correct
95 Correct 947 ms 4568 KB Output is correct
96 Correct 1066 ms 4384 KB Output is correct
97 Correct 500 ms 5068 KB Output is correct
98 Correct 566 ms 4808 KB Output is correct
99 Correct 1137 ms 4952 KB Output is correct
100 Correct 1183 ms 4824 KB Output is correct
101 Correct 1148 ms 4708 KB Output is correct
102 Correct 1266 ms 4824 KB Output is correct
103 Correct 1131 ms 4736 KB Output is correct
104 Correct 1097 ms 4736 KB Output is correct
105 Correct 885 ms 4568 KB Output is correct
106 Correct 629 ms 4312 KB Output is correct
107 Correct 787 ms 4744 KB Output is correct
108 Correct 1162 ms 4876 KB Output is correct
109 Correct 719 ms 4808 KB Output is correct