oj.uz

Submission #872156

# Submission time Handle Problem Language Result Execution time Memory
872156 2023-11-12T11:45:06 Z Kihihihi Bridges (APIO19_bridges) C++17
100 / 100
 2443 ms 13236 KB 
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <ctime>
#include <chrono>
#include <random>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <deque>
#include <bitset>
using namespace std;
mt19937_64 rnd(time(NULL));

struct edge
{
    int a, b, w;
};

struct query
{
    int qt, x, y;
};

struct dsu
{
    int n;
    vector<int> p, rk, sz;
    vector<vector<pair<int*, int>>> hist;

    dsu(int in)
    {
        n = in;
        p.resize(n);
        iota(p.begin(), p.end(), 0);
        rk.resize(n);
        sz.resize(n, 1);
    }

    int rt(int v)
    {
        return (p[v] == v ? v : rt(p[v]));
    }

    void unite(int a, int b)
    {
        a = rt(a); b = rt(b);
        hist.push_back({});
        if (a == b)
        {
            return;
        }

        hist.back().reserve(4);
        if (rk[a] < rk[b])
        {
            swap(a, b);
        }
        hist.back().push_back({ &p[b], p[b] });
        p[b] = a;
        hist.back().push_back({ &sz[a], sz[a] });
        sz[a] += sz[b];
        hist.back().push_back({ &sz[b], sz[b] });
        sz[b] = 0;
        hist.back().push_back({ &rk[a], rk[a] });
        rk[a] += (rk[a] == rk[b]);
    }

    void ctrlz()
    {
        while (hist.back().size())
        {
            *hist.back().back().first = hist.back().back().second;
            hist.back().pop_back();
        }
        hist.pop_back();
    }

    int get(int v)
    {
        return sz[rt(v)];
    }
};

int n, m, q;
edge e[100000];
bool used[100000];

void solve()
{
    cin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        cin >> e[i].a >> e[i].b >> e[i].w;
        e[i].a--; e[i].b--;
    }

    cin >> q;
    int SQ = sqrt(n + m) * 3;
    for (int qli = 0; qli < q; qli += SQ)
    {
        int qri = qli + SQ - 1;
        qri = min(qri, q - 1);

        vector<query> qr(qri - qli + 1);
        for (int i = 0; i < qr.size(); i++)
        {
            cin >> qr[i].qt >> qr[i].x >> qr[i].y;
            qr[i].x--;

            if (qr[i].qt == 1)
            {
                used[qr[i].x] = true;
            }
        }

        vector<int> eu, notu;
        for (int i = 0; i < m; i++)
        {
            if (used[i])
            {
                eu.push_back(i);
            }
            else
            {
                notu.push_back(i);
            }
        }
        sort(notu.begin(), notu.end(),
            [&](int x, int y)
            {
                return e[x].w < e[y].w;
            }
        );

        vector<vector<int>> add;
        vector<tuple<int, int, int>> ask;
        for (int i = 0; i < qr.size(); i++)
        {
            if (qr[i].qt == 1)
            {
                e[qr[i].x].w = qr[i].y;
                continue;
            }

            ask.push_back({ qr[i].y, qr[i].x, add.size() });
            add.push_back({});
            for (auto& j : eu)
            {
                if (e[j].w >= qr[i].y)
                {
                    add.back().push_back(j);
                }
            }
        }
        sort(ask.rbegin(), ask.rend());

        dsu kek(n);
        vector<int> ans(ask.size(), -1);
        for (auto& [w, ver, idx] : ask)
        {
            while (notu.size() && e[notu.back()].w >= w)
            {
                kek.unite(e[notu.back()].a, e[notu.back()].b);
                notu.pop_back();
            }

            for (auto& i : add[idx])
            {
                kek.unite(e[i].a, e[i].b);
            }
            ans[idx] = kek.get(ver);
            for (int _ = 0; _ < add[idx].size(); _++)
            {
                kek.ctrlz();
            }
        }
        for (int i = 0; i < ans.size(); i++)
        {
            cout << ans[i] << "\n";
        }

        for (auto& i : eu)
        {
            used[i] = false;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    solve();

    return 0;
}

/*

























*/

Compilation message

bridges.cpp: In function 'void solve()':
bridges.cpp:112:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |         for (int i = 0; i < qr.size(); i++)
      |                         ~~^~~~~~~~~~~
bridges.cpp:144:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<query>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |         for (int i = 0; i < qr.size(); i++)
      |                         ~~^~~~~~~~~~~
bridges.cpp:179:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |             for (int _ = 0; _ < add[idx].size(); _++)
      |                             ~~^~~~~~~~~~~~~~~~~
bridges.cpp:184:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  184 |         for (int i = 0; i < ans.size(); i++)
      |                         ~~^~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 15 ms 572 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 8 ms 500 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 9 ms 348 KB Output is correct
12 Correct 10 ms 516 KB Output is correct
13 Correct 9 ms 348 KB Output is correct
14 Correct 9 ms 516 KB Output is correct
15 Correct 11 ms 512 KB Output is correct
16 Correct 8 ms 348 KB Output is correct
17 Correct 8 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1696 ms 8484 KB Output is correct
2 Correct 1735 ms 8336 KB Output is correct
3 Correct 1688 ms 8312 KB Output is correct
4 Correct 1692 ms 8628 KB Output is correct
5 Correct 1729 ms 8112 KB Output is correct
6 Correct 2402 ms 8872 KB Output is correct
7 Correct 2381 ms 9044 KB Output is correct
8 Correct 2345 ms 8744 KB Output is correct
9 Correct 34 ms 592 KB Output is correct
10 Correct 1611 ms 8656 KB Output is correct
11 Correct 1529 ms 8480 KB Output is correct
12 Correct 1431 ms 8660 KB Output is correct
13 Correct 1432 ms 9100 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1365 ms 5744 KB Output is correct
2 Correct 757 ms 1904 KB Output is correct
3 Correct 1570 ms 5788 KB Output is correct
4 Correct 1330 ms 5504 KB Output is correct
5 Correct 30 ms 604 KB Output is correct
6 Correct 1489 ms 5504 KB Output is correct
7 Correct 1274 ms 5404 KB Output is correct
8 Correct 1102 ms 5248 KB Output is correct
9 Correct 973 ms 5228 KB Output is correct
10 Correct 897 ms 5136 KB Output is correct
11 Correct 953 ms 4984 KB Output is correct
12 Correct 877 ms 4940 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1585 ms 10728 KB Output is correct
2 Correct 31 ms 596 KB Output is correct
3 Correct 170 ms 7612 KB Output is correct
4 Correct 89 ms 7840 KB Output is correct
5 Correct 1047 ms 10836 KB Output is correct
6 Correct 1544 ms 10888 KB Output is correct
7 Correct 999 ms 10984 KB Output is correct
8 Correct 1030 ms 7448 KB Output is correct
9 Correct 1046 ms 7196 KB Output is correct
10 Correct 1048 ms 7636 KB Output is correct
11 Correct 1369 ms 10120 KB Output is correct
12 Correct 1335 ms 10060 KB Output is correct
13 Correct 1391 ms 10180 KB Output is correct
14 Correct 939 ms 11328 KB Output is correct
15 Correct 946 ms 11520 KB Output is correct
16 Correct 1528 ms 10932 KB Output is correct
17 Correct 1527 ms 10572 KB Output is correct
18 Correct 1574 ms 11240 KB Output is correct
19 Correct 1534 ms 11796 KB Output is correct
20 Correct 1402 ms 10304 KB Output is correct
21 Correct 1418 ms 10948 KB Output is correct
22 Correct 1509 ms 11552 KB Output is correct
23 Correct 1124 ms 10060 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1696 ms 8484 KB Output is correct
2 Correct 1735 ms 8336 KB Output is correct
3 Correct 1688 ms 8312 KB Output is correct
4 Correct 1692 ms 8628 KB Output is correct
5 Correct 1729 ms 8112 KB Output is correct
6 Correct 2402 ms 8872 KB Output is correct
7 Correct 2381 ms 9044 KB Output is correct
8 Correct 2345 ms 8744 KB Output is correct
9 Correct 34 ms 592 KB Output is correct
10 Correct 1611 ms 8656 KB Output is correct
11 Correct 1529 ms 8480 KB Output is correct
12 Correct 1431 ms 8660 KB Output is correct
13 Correct 1432 ms 9100 KB Output is correct
14 Correct 1365 ms 5744 KB Output is correct
15 Correct 757 ms 1904 KB Output is correct
16 Correct 1570 ms 5788 KB Output is correct
17 Correct 1330 ms 5504 KB Output is correct
18 Correct 30 ms 604 KB Output is correct
19 Correct 1489 ms 5504 KB Output is correct
20 Correct 1274 ms 5404 KB Output is correct
21 Correct 1102 ms 5248 KB Output is correct
22 Correct 973 ms 5228 KB Output is correct
23 Correct 897 ms 5136 KB Output is correct
24 Correct 953 ms 4984 KB Output is correct
25 Correct 877 ms 4940 KB Output is correct
26 Correct 1696 ms 8432 KB Output is correct
27 Correct 2131 ms 8652 KB Output is correct
28 Correct 1767 ms 8196 KB Output is correct
29 Correct 1233 ms 7956 KB Output is correct
30 Correct 1963 ms 9544 KB Output is correct
31 Correct 1980 ms 9644 KB Output is correct
32 Correct 1992 ms 9428 KB Output is correct
33 Correct 1787 ms 8056 KB Output is correct
34 Correct 1781 ms 8136 KB Output is correct
35 Correct 1792 ms 8160 KB Output is correct
36 Correct 1330 ms 7540 KB Output is correct
37 Correct 1312 ms 7788 KB Output is correct
38 Correct 1305 ms 7764 KB Output is correct
39 Correct 1067 ms 7904 KB Output is correct
40 Correct 1090 ms 7568 KB Output is correct
41 Correct 1078 ms 7568 KB Output is correct
42 Correct 1048 ms 7404 KB Output is correct
43 Correct 1059 ms 7240 KB Output is correct
44 Correct 1040 ms 7460 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 15 ms 572 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 6 ms 348 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 8 ms 500 KB Output is correct
8 Correct 8 ms 348 KB Output is correct
9 Correct 8 ms 348 KB Output is correct
10 Correct 9 ms 344 KB Output is correct
11 Correct 9 ms 348 KB Output is correct
12 Correct 10 ms 516 KB Output is correct
13 Correct 9 ms 348 KB Output is correct
14 Correct 9 ms 516 KB Output is correct
15 Correct 11 ms 512 KB Output is correct
16 Correct 8 ms 348 KB Output is correct
17 Correct 8 ms 348 KB Output is correct
18 Correct 1696 ms 8484 KB Output is correct
19 Correct 1735 ms 8336 KB Output is correct
20 Correct 1688 ms 8312 KB Output is correct
21 Correct 1692 ms 8628 KB Output is correct
22 Correct 1729 ms 8112 KB Output is correct
23 Correct 2402 ms 8872 KB Output is correct
24 Correct 2381 ms 9044 KB Output is correct
25 Correct 2345 ms 8744 KB Output is correct
26 Correct 34 ms 592 KB Output is correct
27 Correct 1611 ms 8656 KB Output is correct
28 Correct 1529 ms 8480 KB Output is correct
29 Correct 1431 ms 8660 KB Output is correct
30 Correct 1432 ms 9100 KB Output is correct
31 Correct 1365 ms 5744 KB Output is correct
32 Correct 757 ms 1904 KB Output is correct
33 Correct 1570 ms 5788 KB Output is correct
34 Correct 1330 ms 5504 KB Output is correct
35 Correct 30 ms 604 KB Output is correct
36 Correct 1489 ms 5504 KB Output is correct
37 Correct 1274 ms 5404 KB Output is correct
38 Correct 1102 ms 5248 KB Output is correct
39 Correct 973 ms 5228 KB Output is correct
40 Correct 897 ms 5136 KB Output is correct
41 Correct 953 ms 4984 KB Output is correct
42 Correct 877 ms 4940 KB Output is correct
43 Correct 1585 ms 10728 KB Output is correct
44 Correct 31 ms 596 KB Output is correct
45 Correct 170 ms 7612 KB Output is correct
46 Correct 89 ms 7840 KB Output is correct
47 Correct 1047 ms 10836 KB Output is correct
48 Correct 1544 ms 10888 KB Output is correct
49 Correct 999 ms 10984 KB Output is correct
50 Correct 1030 ms 7448 KB Output is correct
51 Correct 1046 ms 7196 KB Output is correct
52 Correct 1048 ms 7636 KB Output is correct
53 Correct 1369 ms 10120 KB Output is correct
54 Correct 1335 ms 10060 KB Output is correct
55 Correct 1391 ms 10180 KB Output is correct
56 Correct 939 ms 11328 KB Output is correct
57 Correct 946 ms 11520 KB Output is correct
58 Correct 1528 ms 10932 KB Output is correct
59 Correct 1527 ms 10572 KB Output is correct
60 Correct 1574 ms 11240 KB Output is correct
61 Correct 1534 ms 11796 KB Output is correct
62 Correct 1402 ms 10304 KB Output is correct
63 Correct 1418 ms 10948 KB Output is correct
64 Correct 1509 ms 11552 KB Output is correct
65 Correct 1124 ms 10060 KB Output is correct
66 Correct 1696 ms 8432 KB Output is correct
67 Correct 2131 ms 8652 KB Output is correct
68 Correct 1767 ms 8196 KB Output is correct
69 Correct 1233 ms 7956 KB Output is correct
70 Correct 1963 ms 9544 KB Output is correct
71 Correct 1980 ms 9644 KB Output is correct
72 Correct 1992 ms 9428 KB Output is correct
73 Correct 1787 ms 8056 KB Output is correct
74 Correct 1781 ms 8136 KB Output is correct
75 Correct 1792 ms 8160 KB Output is correct
76 Correct 1330 ms 7540 KB Output is correct
77 Correct 1312 ms 7788 KB Output is correct
78 Correct 1305 ms 7764 KB Output is correct
79 Correct 1067 ms 7904 KB Output is correct
80 Correct 1090 ms 7568 KB Output is correct
81 Correct 1078 ms 7568 KB Output is correct
82 Correct 1048 ms 7404 KB Output is correct
83 Correct 1059 ms 7240 KB Output is correct
84 Correct 1040 ms 7460 KB Output is correct
85 Correct 2059 ms 11860 KB Output is correct
86 Correct 196 ms 8360 KB Output is correct
87 Correct 117 ms 8968 KB Output is correct
88 Correct 1339 ms 12580 KB Output is correct
89 Correct 2031 ms 11896 KB Output is correct
90 Correct 1441 ms 12592 KB Output is correct
91 Correct 1769 ms 8428 KB Output is correct
92 Correct 1772 ms 8484 KB Output is correct
93 Correct 2443 ms 8832 KB Output is correct
94 Correct 1777 ms 11620 KB Output is correct
95 Correct 1927 ms 11924 KB Output is correct
96 Correct 1785 ms 11828 KB Output is correct
97 Correct 1031 ms 11880 KB Output is correct
98 Correct 1066 ms 11400 KB Output is correct
99 Correct 2167 ms 11620 KB Output is correct
100 Correct 2139 ms 11572 KB Output is correct
101 Correct 2246 ms 11760 KB Output is correct
102 Correct 2249 ms 12684 KB Output is correct
103 Correct 2051 ms 13236 KB Output is correct
104 Correct 1976 ms 12884 KB Output is correct
105 Correct 1505 ms 10720 KB Output is correct
106 Correct 1300 ms 10544 KB Output is correct
107 Correct 1653 ms 11804 KB Output is correct
108 Correct 2008 ms 12256 KB Output is correct
109 Correct 1410 ms 11680 KB Output is correct