oj.uz

Submission #976764

# Submission time Handle Problem Language Result Execution time Memory
976764 2024-05-07T05:33:19 Z gaga999 Bridges (APIO19_bridges) C++17
100 / 100
 1241 ms 8656 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 = 1200;
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 1 ms 2396 KB Output is correct
3 Correct 26 ms 2596 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 17 ms 2588 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct
7 Correct 12 ms 2392 KB Output is correct
8 Correct 13 ms 2396 KB Output is correct
9 Correct 11 ms 2580 KB Output is correct
10 Correct 13 ms 2392 KB Output is correct
11 Correct 13 ms 2396 KB Output is correct
12 Correct 13 ms 2396 KB Output is correct
13 Correct 19 ms 2396 KB Output is correct
14 Correct 17 ms 2592 KB Output is correct
15 Correct 15 ms 2396 KB Output is correct
16 Correct 12 ms 2588 KB Output is correct
17 Correct 12 ms 2396 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 4108 KB Output is correct
2 Correct 663 ms 4296 KB Output is correct
3 Correct 662 ms 4096 KB Output is correct
4 Correct 705 ms 4096 KB Output is correct
5 Correct 701 ms 4116 KB Output is correct
6 Correct 1153 ms 4552 KB Output is correct
7 Correct 1161 ms 4348 KB Output is correct
8 Correct 1127 ms 4556 KB Output is correct
9 Correct 48 ms 2876 KB Output is correct
10 Correct 553 ms 4112 KB Output is correct
11 Correct 515 ms 4300 KB Output is correct
12 Correct 499 ms 4368 KB Output is correct
13 Correct 557 ms 4092 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 507 ms 3736 KB Output is correct
2 Correct 398 ms 4664 KB Output is correct
3 Correct 571 ms 6044 KB Output is correct
4 Correct 492 ms 6092 KB Output is correct
5 Correct 38 ms 4244 KB Output is correct
6 Correct 553 ms 5992 KB Output is correct
7 Correct 456 ms 6092 KB Output is correct
8 Correct 411 ms 5972 KB Output is correct
9 Correct 296 ms 6092 KB Output is correct
10 Correct 275 ms 6096 KB Output is correct
11 Correct 314 ms 6000 KB Output is correct
12 Correct 276 ms 6004 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 431 ms 4812 KB Output is correct
2 Correct 41 ms 2888 KB Output is correct
3 Correct 50 ms 3672 KB Output is correct
4 Correct 34 ms 3928 KB Output is correct
5 Correct 334 ms 4820 KB Output is correct
6 Correct 478 ms 4820 KB Output is correct
7 Correct 337 ms 4816 KB Output is correct
8 Correct 203 ms 4056 KB Output is correct
9 Correct 199 ms 4056 KB Output is correct
10 Correct 209 ms 4248 KB Output is correct
11 Correct 331 ms 4552 KB Output is correct
12 Correct 311 ms 4540 KB Output is correct
13 Correct 322 ms 4564 KB Output is correct
14 Correct 334 ms 5072 KB Output is correct
15 Correct 327 ms 5064 KB Output is correct
16 Correct 444 ms 4820 KB Output is correct
17 Correct 491 ms 4808 KB Output is correct
18 Correct 494 ms 5064 KB Output is correct
19 Correct 455 ms 4812 KB Output is correct
20 Correct 388 ms 4808 KB Output is correct
21 Correct 377 ms 4812 KB Output is correct
22 Correct 428 ms 5032 KB Output is correct
23 Correct 332 ms 5064 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 4108 KB Output is correct
2 Correct 663 ms 4296 KB Output is correct
3 Correct 662 ms 4096 KB Output is correct
4 Correct 705 ms 4096 KB Output is correct
5 Correct 701 ms 4116 KB Output is correct
6 Correct 1153 ms 4552 KB Output is correct
7 Correct 1161 ms 4348 KB Output is correct
8 Correct 1127 ms 4556 KB Output is correct
9 Correct 48 ms 2876 KB Output is correct
10 Correct 553 ms 4112 KB Output is correct
11 Correct 515 ms 4300 KB Output is correct
12 Correct 499 ms 4368 KB Output is correct
13 Correct 557 ms 4092 KB Output is correct
14 Correct 507 ms 3736 KB Output is correct
15 Correct 398 ms 4664 KB Output is correct
16 Correct 571 ms 6044 KB Output is correct
17 Correct 492 ms 6092 KB Output is correct
18 Correct 38 ms 4244 KB Output is correct
19 Correct 553 ms 5992 KB Output is correct
20 Correct 456 ms 6092 KB Output is correct
21 Correct 411 ms 5972 KB Output is correct
22 Correct 296 ms 6092 KB Output is correct
23 Correct 275 ms 6096 KB Output is correct
24 Correct 314 ms 6000 KB Output is correct
25 Correct 276 ms 6004 KB Output is correct
26 Correct 611 ms 6872 KB Output is correct
27 Correct 788 ms 6860 KB Output is correct
28 Correct 688 ms 6876 KB Output is correct
29 Correct 508 ms 7172 KB Output is correct
30 Correct 810 ms 6788 KB Output is correct
31 Correct 847 ms 6676 KB Output is correct
32 Correct 853 ms 6884 KB Output is correct
33 Correct 697 ms 7116 KB Output is correct
34 Correct 675 ms 6956 KB Output is correct
35 Correct 669 ms 6964 KB Output is correct
36 Correct 530 ms 6860 KB Output is correct
37 Correct 542 ms 6872 KB Output is correct
38 Correct 515 ms 6864 KB Output is correct
39 Correct 386 ms 6860 KB Output is correct
40 Correct 377 ms 6860 KB Output is correct
41 Correct 426 ms 6860 KB Output is correct
42 Correct 370 ms 6872 KB Output is correct
43 Correct 348 ms 6864 KB Output is correct
44 Correct 344 ms 6872 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 1 ms 2396 KB Output is correct
3 Correct 26 ms 2596 KB Output is correct
4 Correct 5 ms 2396 KB Output is correct
5 Correct 17 ms 2588 KB Output is correct
6 Correct 14 ms 2652 KB Output is correct
7 Correct 12 ms 2392 KB Output is correct
8 Correct 13 ms 2396 KB Output is correct
9 Correct 11 ms 2580 KB Output is correct
10 Correct 13 ms 2392 KB Output is correct
11 Correct 13 ms 2396 KB Output is correct
12 Correct 13 ms 2396 KB Output is correct
13 Correct 19 ms 2396 KB Output is correct
14 Correct 17 ms 2592 KB Output is correct
15 Correct 15 ms 2396 KB Output is correct
16 Correct 12 ms 2588 KB Output is correct
17 Correct 12 ms 2396 KB Output is correct
18 Correct 622 ms 4108 KB Output is correct
19 Correct 663 ms 4296 KB Output is correct
20 Correct 662 ms 4096 KB Output is correct
21 Correct 705 ms 4096 KB Output is correct
22 Correct 701 ms 4116 KB Output is correct
23 Correct 1153 ms 4552 KB Output is correct
24 Correct 1161 ms 4348 KB Output is correct
25 Correct 1127 ms 4556 KB Output is correct
26 Correct 48 ms 2876 KB Output is correct
27 Correct 553 ms 4112 KB Output is correct
28 Correct 515 ms 4300 KB Output is correct
29 Correct 499 ms 4368 KB Output is correct
30 Correct 557 ms 4092 KB Output is correct
31 Correct 507 ms 3736 KB Output is correct
32 Correct 398 ms 4664 KB Output is correct
33 Correct 571 ms 6044 KB Output is correct
34 Correct 492 ms 6092 KB Output is correct
35 Correct 38 ms 4244 KB Output is correct
36 Correct 553 ms 5992 KB Output is correct
37 Correct 456 ms 6092 KB Output is correct
38 Correct 411 ms 5972 KB Output is correct
39 Correct 296 ms 6092 KB Output is correct
40 Correct 275 ms 6096 KB Output is correct
41 Correct 314 ms 6000 KB Output is correct
42 Correct 276 ms 6004 KB Output is correct
43 Correct 431 ms 4812 KB Output is correct
44 Correct 41 ms 2888 KB Output is correct
45 Correct 50 ms 3672 KB Output is correct
46 Correct 34 ms 3928 KB Output is correct
47 Correct 334 ms 4820 KB Output is correct
48 Correct 478 ms 4820 KB Output is correct
49 Correct 337 ms 4816 KB Output is correct
50 Correct 203 ms 4056 KB Output is correct
51 Correct 199 ms 4056 KB Output is correct
52 Correct 209 ms 4248 KB Output is correct
53 Correct 331 ms 4552 KB Output is correct
54 Correct 311 ms 4540 KB Output is correct
55 Correct 322 ms 4564 KB Output is correct
56 Correct 334 ms 5072 KB Output is correct
57 Correct 327 ms 5064 KB Output is correct
58 Correct 444 ms 4820 KB Output is correct
59 Correct 491 ms 4808 KB Output is correct
60 Correct 494 ms 5064 KB Output is correct
61 Correct 455 ms 4812 KB Output is correct
62 Correct 388 ms 4808 KB Output is correct
63 Correct 377 ms 4812 KB Output is correct
64 Correct 428 ms 5032 KB Output is correct
65 Correct 332 ms 5064 KB Output is correct
66 Correct 611 ms 6872 KB Output is correct
67 Correct 788 ms 6860 KB Output is correct
68 Correct 688 ms 6876 KB Output is correct
69 Correct 508 ms 7172 KB Output is correct
70 Correct 810 ms 6788 KB Output is correct
71 Correct 847 ms 6676 KB Output is correct
72 Correct 853 ms 6884 KB Output is correct
73 Correct 697 ms 7116 KB Output is correct
74 Correct 675 ms 6956 KB Output is correct
75 Correct 669 ms 6964 KB Output is correct
76 Correct 530 ms 6860 KB Output is correct
77 Correct 542 ms 6872 KB Output is correct
78 Correct 515 ms 6864 KB Output is correct
79 Correct 386 ms 6860 KB Output is correct
80 Correct 377 ms 6860 KB Output is correct
81 Correct 426 ms 6860 KB Output is correct
82 Correct 370 ms 6872 KB Output is correct
83 Correct 348 ms 6864 KB Output is correct
84 Correct 344 ms 6872 KB Output is correct
85 Correct 1082 ms 8596 KB Output is correct
86 Correct 100 ms 5716 KB Output is correct
87 Correct 58 ms 5868 KB Output is correct
88 Correct 745 ms 7068 KB Output is correct
89 Correct 1105 ms 8656 KB Output is correct
90 Correct 688 ms 7112 KB Output is correct
91 Correct 731 ms 6832 KB Output is correct
92 Correct 746 ms 6880 KB Output is correct
93 Correct 1156 ms 6696 KB Output is correct
94 Correct 1020 ms 7632 KB Output is correct
95 Correct 976 ms 7756 KB Output is correct
96 Correct 1189 ms 7528 KB Output is correct
97 Correct 456 ms 7372 KB Output is correct
98 Correct 551 ms 6936 KB Output is correct
99 Correct 1092 ms 8484 KB Output is correct
100 Correct 1171 ms 8480 KB Output is correct
101 Correct 1140 ms 8656 KB Output is correct
102 Correct 1098 ms 8652 KB Output is correct
103 Correct 1241 ms 8008 KB Output is correct
104 Correct 1190 ms 7968 KB Output is correct
105 Correct 796 ms 7852 KB Output is correct
106 Correct 585 ms 7632 KB Output is correct
107 Correct 736 ms 7956 KB Output is correct
108 Correct 1098 ms 8472 KB Output is correct
109 Correct 765 ms 6616 KB Output is correct