oj.uz

Submission #511262

# Submission time Handle Problem Language Result Execution time Memory
511262 2022-01-15T13:10:08 Z blue Bridges (APIO19_bridges) C++17
100 / 100
 2748 ms 6856 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
 
using vi = vector<int>;
 
const int rt = 946;
 
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 1 ms 204 KB Output is correct
3 Correct 54 ms 588 KB Output is correct
4 Correct 14 ms 556 KB Output is correct
5 Correct 38 ms 556 KB Output is correct
6 Correct 34 ms 548 KB Output is correct
7 Correct 34 ms 540 KB Output is correct
8 Correct 35 ms 460 KB Output is correct
9 Correct 33 ms 540 KB Output is correct
10 Correct 38 ms 548 KB Output is correct
11 Correct 39 ms 548 KB Output is correct
12 Correct 40 ms 568 KB Output is correct
13 Correct 50 ms 536 KB Output is correct
14 Correct 42 ms 552 KB Output is correct
15 Correct 43 ms 460 KB Output is correct
16 Correct 34 ms 544 KB Output is correct
17 Correct 34 ms 460 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1607 ms 4952 KB Output is correct
2 Correct 1619 ms 4964 KB Output is correct
3 Correct 1615 ms 4884 KB Output is correct
4 Correct 1726 ms 4896 KB Output is correct
5 Correct 1746 ms 4992 KB Output is correct
6 Correct 2402 ms 4960 KB Output is correct
7 Correct 2452 ms 4860 KB Output is correct
8 Correct 2413 ms 4976 KB Output is correct
9 Correct 148 ms 2808 KB Output is correct
10 Correct 1575 ms 4960 KB Output is correct
11 Correct 1653 ms 4804 KB Output is correct
12 Correct 1565 ms 4800 KB Output is correct
13 Correct 1482 ms 4716 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1402 ms 3980 KB Output is correct
2 Correct 972 ms 3084 KB Output is correct
3 Correct 1546 ms 3980 KB Output is correct
4 Correct 1381 ms 3968 KB Output is correct
5 Correct 161 ms 2772 KB Output is correct
6 Correct 1394 ms 4076 KB Output is correct
7 Correct 1250 ms 3968 KB Output is correct
8 Correct 1078 ms 4100 KB Output is correct
9 Correct 965 ms 4044 KB Output is correct
10 Correct 881 ms 4024 KB Output is correct
11 Correct 856 ms 4024 KB Output is correct
12 Correct 751 ms 3964 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1831 ms 6472 KB Output is correct
2 Correct 134 ms 2796 KB Output is correct
3 Correct 179 ms 4056 KB Output is correct
4 Correct 207 ms 4052 KB Output is correct
5 Correct 1567 ms 6372 KB Output is correct
6 Correct 1868 ms 6376 KB Output is correct
7 Correct 1644 ms 6504 KB Output is correct
8 Correct 974 ms 4780 KB Output is correct
9 Correct 992 ms 4924 KB Output is correct
10 Correct 1004 ms 4984 KB Output is correct
11 Correct 1457 ms 6044 KB Output is correct
12 Correct 1375 ms 5840 KB Output is correct
13 Correct 1387 ms 5856 KB Output is correct
14 Correct 1414 ms 6516 KB Output is correct
15 Correct 1457 ms 6376 KB Output is correct
16 Correct 1792 ms 6516 KB Output is correct
17 Correct 1878 ms 6652 KB Output is correct
18 Correct 1886 ms 6544 KB Output is correct
19 Correct 1875 ms 6352 KB Output is correct
20 Correct 1565 ms 6036 KB Output is correct
21 Correct 1567 ms 6140 KB Output is correct
22 Correct 1772 ms 6264 KB Output is correct
23 Correct 1467 ms 5784 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1607 ms 4952 KB Output is correct
2 Correct 1619 ms 4964 KB Output is correct
3 Correct 1615 ms 4884 KB Output is correct
4 Correct 1726 ms 4896 KB Output is correct
5 Correct 1746 ms 4992 KB Output is correct
6 Correct 2402 ms 4960 KB Output is correct
7 Correct 2452 ms 4860 KB Output is correct
8 Correct 2413 ms 4976 KB Output is correct
9 Correct 148 ms 2808 KB Output is correct
10 Correct 1575 ms 4960 KB Output is correct
11 Correct 1653 ms 4804 KB Output is correct
12 Correct 1565 ms 4800 KB Output is correct
13 Correct 1482 ms 4716 KB Output is correct
14 Correct 1402 ms 3980 KB Output is correct
15 Correct 972 ms 3084 KB Output is correct
16 Correct 1546 ms 3980 KB Output is correct
17 Correct 1381 ms 3968 KB Output is correct
18 Correct 161 ms 2772 KB Output is correct
19 Correct 1394 ms 4076 KB Output is correct
20 Correct 1250 ms 3968 KB Output is correct
21 Correct 1078 ms 4100 KB Output is correct
22 Correct 965 ms 4044 KB Output is correct
23 Correct 881 ms 4024 KB Output is correct
24 Correct 856 ms 4024 KB Output is correct
25 Correct 751 ms 3964 KB Output is correct
26 Correct 1655 ms 4880 KB Output is correct
27 Correct 1974 ms 4884 KB Output is correct
28 Correct 1699 ms 4948 KB Output is correct
29 Correct 1389 ms 4812 KB Output is correct
30 Correct 1953 ms 4868 KB Output is correct
31 Correct 1953 ms 4788 KB Output is correct
32 Correct 1959 ms 4860 KB Output is correct
33 Correct 1751 ms 4796 KB Output is correct
34 Correct 1711 ms 4900 KB Output is correct
35 Correct 1719 ms 4780 KB Output is correct
36 Correct 1400 ms 4840 KB Output is correct
37 Correct 1438 ms 4964 KB Output is correct
38 Correct 1375 ms 4904 KB Output is correct
39 Correct 1205 ms 4924 KB Output is correct
40 Correct 1164 ms 4904 KB Output is correct
41 Correct 1157 ms 4912 KB Output is correct
42 Correct 1000 ms 4848 KB Output is correct
43 Correct 1060 ms 4880 KB Output is correct
44 Correct 1091 ms 4852 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 1 ms 204 KB Output is correct
3 Correct 54 ms 588 KB Output is correct
4 Correct 14 ms 556 KB Output is correct
5 Correct 38 ms 556 KB Output is correct
6 Correct 34 ms 548 KB Output is correct
7 Correct 34 ms 540 KB Output is correct
8 Correct 35 ms 460 KB Output is correct
9 Correct 33 ms 540 KB Output is correct
10 Correct 38 ms 548 KB Output is correct
11 Correct 39 ms 548 KB Output is correct
12 Correct 40 ms 568 KB Output is correct
13 Correct 50 ms 536 KB Output is correct
14 Correct 42 ms 552 KB Output is correct
15 Correct 43 ms 460 KB Output is correct
16 Correct 34 ms 544 KB Output is correct
17 Correct 34 ms 460 KB Output is correct
18 Correct 1607 ms 4952 KB Output is correct
19 Correct 1619 ms 4964 KB Output is correct
20 Correct 1615 ms 4884 KB Output is correct
21 Correct 1726 ms 4896 KB Output is correct
22 Correct 1746 ms 4992 KB Output is correct
23 Correct 2402 ms 4960 KB Output is correct
24 Correct 2452 ms 4860 KB Output is correct
25 Correct 2413 ms 4976 KB Output is correct
26 Correct 148 ms 2808 KB Output is correct
27 Correct 1575 ms 4960 KB Output is correct
28 Correct 1653 ms 4804 KB Output is correct
29 Correct 1565 ms 4800 KB Output is correct
30 Correct 1482 ms 4716 KB Output is correct
31 Correct 1402 ms 3980 KB Output is correct
32 Correct 972 ms 3084 KB Output is correct
33 Correct 1546 ms 3980 KB Output is correct
34 Correct 1381 ms 3968 KB Output is correct
35 Correct 161 ms 2772 KB Output is correct
36 Correct 1394 ms 4076 KB Output is correct
37 Correct 1250 ms 3968 KB Output is correct
38 Correct 1078 ms 4100 KB Output is correct
39 Correct 965 ms 4044 KB Output is correct
40 Correct 881 ms 4024 KB Output is correct
41 Correct 856 ms 4024 KB Output is correct
42 Correct 751 ms 3964 KB Output is correct
43 Correct 1831 ms 6472 KB Output is correct
44 Correct 134 ms 2796 KB Output is correct
45 Correct 179 ms 4056 KB Output is correct
46 Correct 207 ms 4052 KB Output is correct
47 Correct 1567 ms 6372 KB Output is correct
48 Correct 1868 ms 6376 KB Output is correct
49 Correct 1644 ms 6504 KB Output is correct
50 Correct 974 ms 4780 KB Output is correct
51 Correct 992 ms 4924 KB Output is correct
52 Correct 1004 ms 4984 KB Output is correct
53 Correct 1457 ms 6044 KB Output is correct
54 Correct 1375 ms 5840 KB Output is correct
55 Correct 1387 ms 5856 KB Output is correct
56 Correct 1414 ms 6516 KB Output is correct
57 Correct 1457 ms 6376 KB Output is correct
58 Correct 1792 ms 6516 KB Output is correct
59 Correct 1878 ms 6652 KB Output is correct
60 Correct 1886 ms 6544 KB Output is correct
61 Correct 1875 ms 6352 KB Output is correct
62 Correct 1565 ms 6036 KB Output is correct
63 Correct 1567 ms 6140 KB Output is correct
64 Correct 1772 ms 6264 KB Output is correct
65 Correct 1467 ms 5784 KB Output is correct
66 Correct 1655 ms 4880 KB Output is correct
67 Correct 1974 ms 4884 KB Output is correct
68 Correct 1699 ms 4948 KB Output is correct
69 Correct 1389 ms 4812 KB Output is correct
70 Correct 1953 ms 4868 KB Output is correct
71 Correct 1953 ms 4788 KB Output is correct
72 Correct 1959 ms 4860 KB Output is correct
73 Correct 1751 ms 4796 KB Output is correct
74 Correct 1711 ms 4900 KB Output is correct
75 Correct 1719 ms 4780 KB Output is correct
76 Correct 1400 ms 4840 KB Output is correct
77 Correct 1438 ms 4964 KB Output is correct
78 Correct 1375 ms 4904 KB Output is correct
79 Correct 1205 ms 4924 KB Output is correct
80 Correct 1164 ms 4904 KB Output is correct
81 Correct 1157 ms 4912 KB Output is correct
82 Correct 1000 ms 4848 KB Output is correct
83 Correct 1060 ms 4880 KB Output is correct
84 Correct 1091 ms 4852 KB Output is correct
85 Correct 2446 ms 6412 KB Output is correct
86 Correct 257 ms 4176 KB Output is correct
87 Correct 243 ms 4128 KB Output is correct
88 Correct 2232 ms 6428 KB Output is correct
89 Correct 2432 ms 6464 KB Output is correct
90 Correct 2204 ms 6624 KB Output is correct
91 Correct 1845 ms 4952 KB Output is correct
92 Correct 1762 ms 4840 KB Output is correct
93 Correct 2449 ms 4728 KB Output is correct
94 Correct 2197 ms 5848 KB Output is correct
95 Correct 2164 ms 5780 KB Output is correct
96 Correct 2478 ms 5968 KB Output is correct
97 Correct 1902 ms 6744 KB Output is correct
98 Correct 1749 ms 6580 KB Output is correct
99 Correct 2548 ms 6436 KB Output is correct
100 Correct 2504 ms 6608 KB Output is correct
101 Correct 2544 ms 6856 KB Output is correct
102 Correct 2538 ms 6704 KB Output is correct
103 Correct 2748 ms 6116 KB Output is correct
104 Correct 2643 ms 5936 KB Output is correct
105 Correct 1893 ms 6216 KB Output is correct
106 Correct 1505 ms 5700 KB Output is correct
107 Correct 1862 ms 6156 KB Output is correct
108 Correct 2422 ms 6264 KB Output is correct
109 Correct 2166 ms 6224 KB Output is correct