oj.uz

Submission #511234

# Submission time Handle Problem Language Result Execution time Memory
511234 2022-01-15T12:53:29 Z blue Bridges (APIO19_bridges) C++17
100 / 100
 2943 ms 9828 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;

using vi = vector<int>;

const int rt = 950;

int n, m;
vi u, v, w;

int q;
vi t;
vi b, r;
vi s, c;

struct disjoint_set
{
    vi parent;
    vi subtree;

    vector<int> changes;

    disjoint_set()
    {
        parent = vi(1+n);
        subtree = vi(1+n, 1);
        for(int i = 0; i <= n; i++) parent[i] = i;
    }

    int root(int u)
    {
        while(parent[u] != u) u = parent[u];
        return u;
    }

    void join(int u, int v)
    {
        u = root(u);
        v = root(v);
        if(u == v)
        {
            // cerr << "change rejected\n";
            changes.push_back(0);
        }
        else
        {
            if(subtree[u] < subtree[v]) swap(u, v);
            parent[v] = u;
            subtree[u] += subtree[v];
            changes.push_back(v);
            // cerr << "making " << u << " parent of " << v << '\n';
        }
    }

    void rollback()
    {
        int c = changes.back();
        changes.pop_back();
        subtree[parent[c]] -= subtree[c];
        parent[c] = c;
    }

    int reach(int u)
    {
        return subtree[root(u)];
    }
};


int wt(int d)
{
    if(d > 0)
    {
        return w[d];
    }
    else
    {
        return c[-d];
    }
}


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

    cin >> n >> m;

    u = v = w = vi(1+m);
    for(int e = 1; e <= m; e++) cin >> u[e] >> v[e] >> w[e];

    cin >> q;
    t = b = r = s = c = vi(q);
    for(int j = 0; j < q; j++)
    {
        cin >> t[j];
        if(t[j] == 1) cin >> b[j] >> r[j];
        else cin >> s[j] >> c[j];
    }


    vi ans(q, -1);

    vi temp_edge_found(1+m, 0);


    for(int bl = 0; bl <= (q-1)/rt; bl++)
    {
        int y = rt*bl;
        int z = min(rt*(bl+1)-1, q-1);

        // cerr << "current block = " << y << ' ' << z << '\n';

        vi mod(1+m);
        for(int j = y; j <= z; j++)
            if(t[j] == 1)
                mod[b[j]] = 1;

        vi ops;
        for(int e = 1; e <= m; e++)
            if(!mod[e])
                ops.push_back(e);

        for(int j = y; j <= z; j++)
            if(t[j] == 2)
                ops.push_back(-j);

        sort(ops.begin(), ops.end(), [] (int d, int f)
        {
            int wd = wt(d), wf = wt(f);
            if(wd != wf) return wd > wf;
            else return d > f;
        });

        disjoint_set dsu;


        for(int o: ops)
        {
            // cerr << "\n\n\n";
            if(o > 0)
            {
                dsu.join(u[o], v[o]);
                // cerr << "general join: " << o << '\n';
            }
            else
            {
                int qr = -o;
                int curr_ct = 0;

                // cerr << "answering query : " << qr << '\n';

                for(int l = qr-1; l >= y; l--)
                {
                    if(t[l] == 2) continue;
                    if(temp_edge_found[b[l]]) continue;

                    temp_edge_found[b[l]] = 1;

                    if(r[l] >= c[qr])
                    {
                    // cerr << "query specific join 1: " << b[l] << '\n';
                        dsu.join(u[b[l]], v[b[l]]);
                        curr_ct++;
                    }
                }

                for(int l = qr+1; l <= z; l++)
                {
                    // cerr << "l = " << l << '\n';
                    if(t[l] == 2) continue;
                    if(temp_edge_found[b[l]]) continue;
                    // cerr << "success!\n";

                    temp_edge_found[b[l]] = 1;

                    // cerr << b[l] << " > " << w[b[l]] << ' ' << c[qr] << '\n';
                    if(w[b[l]] >= c[qr])
                    {
                    // cerr << "query specific join 2: " << b[l] << '\n';
                        dsu.join(u[b[l]], v[b[l]]);
                        curr_ct++;
                    }
                }

                ans[qr] = dsu.reach(s[qr]);


                for(int ct = 0; ct < curr_ct; ct++)
                {

                    // cerr << "rollback\n";
                        dsu.rollback();
                }

                for(int l = y; l <= z; l++)
                {
                    if(t[l] == 1)
                    {
                        temp_edge_found[b[l]] = 0;
                    }
                }


            }
        }

        for(int l = y; l <= z; l++)
        {
            if(t[l] == 1)
            {
                w[b[l]] = r[l];
            }
        }


    }

    for(int j = 0; j < q; j++)
        if(t[j] == 2)
            cout << ans[j] << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 63 ms 568 KB Output is correct
4 Correct 21 ms 552 KB Output is correct
5 Correct 42 ms 548 KB Output is correct
6 Correct 37 ms 552 KB Output is correct
7 Correct 36 ms 528 KB Output is correct
8 Correct 40 ms 544 KB Output is correct
9 Correct 36 ms 528 KB Output is correct
10 Correct 43 ms 544 KB Output is correct
11 Correct 38 ms 532 KB Output is correct
12 Correct 41 ms 536 KB Output is correct
13 Correct 59 ms 544 KB Output is correct
14 Correct 54 ms 536 KB Output is correct
15 Correct 43 ms 540 KB Output is correct
16 Correct 37 ms 560 KB Output is correct
17 Correct 38 ms 548 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1737 ms 4844 KB Output is correct
2 Correct 1731 ms 4936 KB Output is correct
3 Correct 1797 ms 4772 KB Output is correct
4 Correct 1931 ms 4756 KB Output is correct
5 Correct 1920 ms 4792 KB Output is correct
6 Correct 2688 ms 4744 KB Output is correct
7 Correct 2696 ms 4732 KB Output is correct
8 Correct 2610 ms 4748 KB Output is correct
9 Correct 188 ms 2792 KB Output is correct
10 Correct 1744 ms 4752 KB Output is correct
11 Correct 1629 ms 4816 KB Output is correct
12 Correct 1631 ms 4712 KB Output is correct
13 Correct 1424 ms 4740 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1354 ms 4056 KB Output is correct
2 Correct 1048 ms 3108 KB Output is correct
3 Correct 1511 ms 4012 KB Output is correct
4 Correct 1376 ms 3956 KB Output is correct
5 Correct 163 ms 2792 KB Output is correct
6 Correct 1526 ms 3984 KB Output is correct
7 Correct 1346 ms 4100 KB Output is correct
8 Correct 1156 ms 3980 KB Output is correct
9 Correct 1010 ms 3976 KB Output is correct
10 Correct 948 ms 3976 KB Output is correct
11 Correct 894 ms 4008 KB Output is correct
12 Correct 773 ms 3960 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1937 ms 6376 KB Output is correct
2 Correct 153 ms 2800 KB Output is correct
3 Correct 206 ms 4200 KB Output is correct
4 Correct 231 ms 4072 KB Output is correct
5 Correct 1665 ms 6456 KB Output is correct
6 Correct 1993 ms 6384 KB Output is correct
7 Correct 1836 ms 6408 KB Output is correct
8 Correct 1038 ms 4840 KB Output is correct
9 Correct 996 ms 4768 KB Output is correct
10 Correct 971 ms 4756 KB Output is correct
11 Correct 1535 ms 5704 KB Output is correct
12 Correct 1488 ms 5704 KB Output is correct
13 Correct 1622 ms 5740 KB Output is correct
14 Correct 1475 ms 6372 KB Output is correct
15 Correct 1796 ms 6456 KB Output is correct
16 Correct 2009 ms 6364 KB Output is correct
17 Correct 2221 ms 6456 KB Output is correct
18 Correct 2217 ms 6560 KB Output is correct
19 Correct 2207 ms 6580 KB Output is correct
20 Correct 1782 ms 5968 KB Output is correct
21 Correct 1726 ms 6156 KB Output is correct
22 Correct 1887 ms 6188 KB Output is correct
23 Correct 1663 ms 5804 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1737 ms 4844 KB Output is correct
2 Correct 1731 ms 4936 KB Output is correct
3 Correct 1797 ms 4772 KB Output is correct
4 Correct 1931 ms 4756 KB Output is correct
5 Correct 1920 ms 4792 KB Output is correct
6 Correct 2688 ms 4744 KB Output is correct
7 Correct 2696 ms 4732 KB Output is correct
8 Correct 2610 ms 4748 KB Output is correct
9 Correct 188 ms 2792 KB Output is correct
10 Correct 1744 ms 4752 KB Output is correct
11 Correct 1629 ms 4816 KB Output is correct
12 Correct 1631 ms 4712 KB Output is correct
13 Correct 1424 ms 4740 KB Output is correct
14 Correct 1354 ms 4056 KB Output is correct
15 Correct 1048 ms 3108 KB Output is correct
16 Correct 1511 ms 4012 KB Output is correct
17 Correct 1376 ms 3956 KB Output is correct
18 Correct 163 ms 2792 KB Output is correct
19 Correct 1526 ms 3984 KB Output is correct
20 Correct 1346 ms 4100 KB Output is correct
21 Correct 1156 ms 3980 KB Output is correct
22 Correct 1010 ms 3976 KB Output is correct
23 Correct 948 ms 3976 KB Output is correct
24 Correct 894 ms 4008 KB Output is correct
25 Correct 773 ms 3960 KB Output is correct
26 Correct 1809 ms 4844 KB Output is correct
27 Correct 2282 ms 4852 KB Output is correct
28 Correct 1948 ms 4848 KB Output is correct
29 Correct 1450 ms 4824 KB Output is correct
30 Correct 2234 ms 4852 KB Output is correct
31 Correct 2280 ms 5008 KB Output is correct
32 Correct 2285 ms 4748 KB Output is correct
33 Correct 1894 ms 4804 KB Output is correct
34 Correct 1966 ms 4888 KB Output is correct
35 Correct 1950 ms 4832 KB Output is correct
36 Correct 1663 ms 4808 KB Output is correct
37 Correct 1574 ms 4720 KB Output is correct
38 Correct 1545 ms 4836 KB Output is correct
39 Correct 1390 ms 4756 KB Output is correct
40 Correct 1323 ms 4784 KB Output is correct
41 Correct 1502 ms 4716 KB Output is correct
42 Correct 1147 ms 4788 KB Output is correct
43 Correct 1118 ms 4788 KB Output is correct
44 Correct 1127 ms 4756 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 63 ms 568 KB Output is correct
4 Correct 21 ms 552 KB Output is correct
5 Correct 42 ms 548 KB Output is correct
6 Correct 37 ms 552 KB Output is correct
7 Correct 36 ms 528 KB Output is correct
8 Correct 40 ms 544 KB Output is correct
9 Correct 36 ms 528 KB Output is correct
10 Correct 43 ms 544 KB Output is correct
11 Correct 38 ms 532 KB Output is correct
12 Correct 41 ms 536 KB Output is correct
13 Correct 59 ms 544 KB Output is correct
14 Correct 54 ms 536 KB Output is correct
15 Correct 43 ms 540 KB Output is correct
16 Correct 37 ms 560 KB Output is correct
17 Correct 38 ms 548 KB Output is correct
18 Correct 1737 ms 4844 KB Output is correct
19 Correct 1731 ms 4936 KB Output is correct
20 Correct 1797 ms 4772 KB Output is correct
21 Correct 1931 ms 4756 KB Output is correct
22 Correct 1920 ms 4792 KB Output is correct
23 Correct 2688 ms 4744 KB Output is correct
24 Correct 2696 ms 4732 KB Output is correct
25 Correct 2610 ms 4748 KB Output is correct
26 Correct 188 ms 2792 KB Output is correct
27 Correct 1744 ms 4752 KB Output is correct
28 Correct 1629 ms 4816 KB Output is correct
29 Correct 1631 ms 4712 KB Output is correct
30 Correct 1424 ms 4740 KB Output is correct
31 Correct 1354 ms 4056 KB Output is correct
32 Correct 1048 ms 3108 KB Output is correct
33 Correct 1511 ms 4012 KB Output is correct
34 Correct 1376 ms 3956 KB Output is correct
35 Correct 163 ms 2792 KB Output is correct
36 Correct 1526 ms 3984 KB Output is correct
37 Correct 1346 ms 4100 KB Output is correct
38 Correct 1156 ms 3980 KB Output is correct
39 Correct 1010 ms 3976 KB Output is correct
40 Correct 948 ms 3976 KB Output is correct
41 Correct 894 ms 4008 KB Output is correct
42 Correct 773 ms 3960 KB Output is correct
43 Correct 1937 ms 6376 KB Output is correct
44 Correct 153 ms 2800 KB Output is correct
45 Correct 206 ms 4200 KB Output is correct
46 Correct 231 ms 4072 KB Output is correct
47 Correct 1665 ms 6456 KB Output is correct
48 Correct 1993 ms 6384 KB Output is correct
49 Correct 1836 ms 6408 KB Output is correct
50 Correct 1038 ms 4840 KB Output is correct
51 Correct 996 ms 4768 KB Output is correct
52 Correct 971 ms 4756 KB Output is correct
53 Correct 1535 ms 5704 KB Output is correct
54 Correct 1488 ms 5704 KB Output is correct
55 Correct 1622 ms 5740 KB Output is correct
56 Correct 1475 ms 6372 KB Output is correct
57 Correct 1796 ms 6456 KB Output is correct
58 Correct 2009 ms 6364 KB Output is correct
59 Correct 2221 ms 6456 KB Output is correct
60 Correct 2217 ms 6560 KB Output is correct
61 Correct 2207 ms 6580 KB Output is correct
62 Correct 1782 ms 5968 KB Output is correct
63 Correct 1726 ms 6156 KB Output is correct
64 Correct 1887 ms 6188 KB Output is correct
65 Correct 1663 ms 5804 KB Output is correct
66 Correct 1809 ms 4844 KB Output is correct
67 Correct 2282 ms 4852 KB Output is correct
68 Correct 1948 ms 4848 KB Output is correct
69 Correct 1450 ms 4824 KB Output is correct
70 Correct 2234 ms 4852 KB Output is correct
71 Correct 2280 ms 5008 KB Output is correct
72 Correct 2285 ms 4748 KB Output is correct
73 Correct 1894 ms 4804 KB Output is correct
74 Correct 1966 ms 4888 KB Output is correct
75 Correct 1950 ms 4832 KB Output is correct
76 Correct 1663 ms 4808 KB Output is correct
77 Correct 1574 ms 4720 KB Output is correct
78 Correct 1545 ms 4836 KB Output is correct
79 Correct 1390 ms 4756 KB Output is correct
80 Correct 1323 ms 4784 KB Output is correct
81 Correct 1502 ms 4716 KB Output is correct
82 Correct 1147 ms 4788 KB Output is correct
83 Correct 1118 ms 4788 KB Output is correct
84 Correct 1127 ms 4756 KB Output is correct
85 Correct 2912 ms 6444 KB Output is correct
86 Correct 301 ms 4048 KB Output is correct
87 Correct 385 ms 4052 KB Output is correct
88 Correct 2477 ms 6368 KB Output is correct
89 Correct 2943 ms 6528 KB Output is correct
90 Correct 2623 ms 6452 KB Output is correct
91 Correct 2009 ms 4868 KB Output is correct
92 Correct 1970 ms 4724 KB Output is correct
93 Correct 2656 ms 4716 KB Output is correct
94 Correct 2402 ms 5704 KB Output is correct
95 Correct 2405 ms 5700 KB Output is correct
96 Correct 2682 ms 5804 KB Output is correct
97 Correct 1967 ms 6380 KB Output is correct
98 Correct 1812 ms 6452 KB Output is correct
99 Correct 2716 ms 6356 KB Output is correct
100 Correct 2736 ms 6448 KB Output is correct
101 Correct 2805 ms 6512 KB Output is correct
102 Correct 2599 ms 6492 KB Output is correct
103 Correct 2919 ms 5976 KB Output is correct
104 Correct 2835 ms 9164 KB Output is correct
105 Correct 1992 ms 9408 KB Output is correct
106 Correct 1580 ms 8880 KB Output is correct
107 Correct 2188 ms 9428 KB Output is correct
108 Correct 2753 ms 9828 KB Output is correct
109 Correct 2484 ms 7780 KB Output is correct