oj.uz

Submission #211432

# Submission time Handle Problem Language Result Execution time Memory
211432 2020-03-20T10:34:21 Z VEGAnn Bridges (APIO19_bridges) C++14
100 / 100
 2505 ms 24328 KB 
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define sz(x) ((int)x.size())
#define pll pair<ll, ll>
#define MP make_pair
#define PB push_back
#define pii pair<int, int>
#define pi3 pair<pii, int>
#define ft first
#define sd second
#define MP3(a,b,c) MP(MP(a,b),c)
using namespace std;
typedef long long ll;
const int N = 50100;
const int M = 100100;
const int Q = 100100;
const int CO = 200100;
const int oo = 2e9;
const int B = 1300;
const int MB = M / B + 10;
stack<pi3> stk;
vector<int> g[N], vc, ed[CO], vec, qr;
int n, m, U[M], V[M], D[M], q, ans[Q], tt = 0, mrk[M], loc[M];
int vls[B][B], tp[Q], l[Q], r[Q], siz[N], pr[N];

bool cmp(int x, int y){
    return r[x] > r[y];
}

int Get(int x){ return (x == pr[x] ? x : Get(pr[x])); }

void Link(int x, int y){
    x = Get(x);
    y = Get(y);

    if (x == y) return;

    if (siz[x] < siz[y]) swap(x, y);

    stk.push(MP3(x, y, pr[y]));
    pr[y] = x;
    siz[x] += siz[y];
}

int get(int x){ return (x == pr[x] ? x : pr[x] = get(pr[x]));}

void link(int x, int y){
    x = get(x);
    y = get(y);

    if (x == y) return;

    if (siz[x] < siz[y]) swap(x, y);

    pr[y] = x;
    siz[x] += siz[y];
}

int main(){

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#else
    ios_base::sync_with_stdio(0); cin.tie(0);
#endif // _LOCAL

    cin >> n >> m;

    for (int i = 0; i < m; i++){
        cin >> U[i] >> V[i] >> D[i];
        U[i]--; V[i]--;

        g[U[i]].PB(i);
        g[V[i]].PB(i);
        vc.PB(D[i]);
    }

    cin >> q;

    for (int i = 0; i < q; i++) {
        cin >> tp[i] >> l[i] >> r[i];
        l[i]--;
        vc.PB(r[i]);
    }

    sort(all(vc));
    vc.resize(unique(all(vc)) - vc.begin());

    for (int i = 0; i < m; i++)
        D[i] = lower_bound(all(vc), D[i]) - vc.begin();

    for (int i = 0; i < q; i++)
        r[i] = lower_bound(all(vc), r[i]) - vc.begin();

    for (int it = 0; it < q; it += B){
        int bd = min(q, it + B);

        tt++;
        vec.clear();
        qr.clear();

        for (int i = it; i < bd; i++)
            if (tp[i] == 1) {
                if (mrk[l[i]] < tt) {
                    mrk[l[i]] = tt;
                    loc[l[i]] = sz(vec);
                    vec.PB(l[i]);
                }
            } else qr.PB(i);

        for (int i = it; i < bd; i++){
            int nm = i - it;

            if (i == it){
                for (int j = 0; j < sz(vec); j++)
                    vls[nm][j] = D[vec[j]];
            } else {
                for (int j = 0; j < sz(vec); j++)
                    vls[nm][j] = vls[nm - 1][j];
            }

            if (tp[i] == 1)
                vls[nm][loc[l[i]]] = r[i];
        }

        for (int i = 0; i < m; i++)
            if (mrk[i] < tt)
                ed[D[i]].PB(i);

        for (int i = 0; i < n; i++){
            siz[i] = 1;
            pr[i] = i;
        }

        if (sz(qr)){
            sort(all(qr), cmp);
        }

        while (sz(stk)) stk.pop();
        int lst = sz(vc) - 1;

        for (int nm : qr){
            while (lst >= 0 && lst >= r[nm]){

                if (sz(ed[lst])){
                    for (int nw : ed[lst])
                        link(U[nw], V[nw]);
                    ed[lst].clear();
                }

                lst--;
            }

            int gt = nm - it;

            for (int i = 0; i < sz(vec); i++)
                if (vls[gt][i] >= r[nm])
                    Link(U[vec[i]], V[vec[i]]);

            ans[nm] = siz[Get(l[nm])];

            while (sz(stk) > 0){
                pi3 cr = stk.top();
                stk.pop();

                siz[cr.ft.ft] -= siz[cr.ft.sd];
                pr[cr.ft.sd] = cr.sd;
            }
        }

        while (lst >= 0){
            ed[lst].clear();
            lst--;
        }

        //end
        for (int i = 0; i < sz(vec); i++)
            D[vec[i]] = vls[bd - it - 1][i];
    }

    for (int i = 0; i < q; i++)
        if (tp[i] == 2)
            cout << ans[i] << '\n';

    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6272 KB Output is correct
2 Correct 7 ms 6272 KB Output is correct
3 Correct 35 ms 13184 KB Output is correct
4 Correct 13 ms 6528 KB Output is correct
5 Correct 27 ms 12160 KB Output is correct
6 Correct 18 ms 12160 KB Output is correct
7 Correct 21 ms 12288 KB Output is correct
8 Correct 22 ms 12280 KB Output is correct
9 Correct 22 ms 12288 KB Output is correct
10 Correct 23 ms 12288 KB Output is correct
11 Correct 23 ms 12288 KB Output is correct
12 Correct 24 ms 12288 KB Output is correct
13 Correct 28 ms 12544 KB Output is correct
14 Correct 26 ms 12544 KB Output is correct
15 Correct 25 ms 12288 KB Output is correct
16 Correct 21 ms 12288 KB Output is correct
17 Correct 22 ms 12288 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1468 ms 21320 KB Output is correct
2 Correct 1475 ms 21164 KB Output is correct
3 Correct 1478 ms 21200 KB Output is correct
4 Correct 1548 ms 21228 KB Output is correct
5 Correct 1589 ms 21100 KB Output is correct
6 Correct 2283 ms 21560 KB Output is correct
7 Correct 2354 ms 21404 KB Output is correct
8 Correct 2255 ms 21480 KB Output is correct
9 Correct 81 ms 8568 KB Output is correct
10 Correct 1196 ms 18612 KB Output is correct
11 Correct 1117 ms 18536 KB Output is correct
12 Correct 1048 ms 19792 KB Output is correct
13 Correct 1371 ms 22432 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1184 ms 19696 KB Output is correct
2 Correct 999 ms 17288 KB Output is correct
3 Correct 1452 ms 19768 KB Output is correct
4 Correct 1213 ms 19692 KB Output is correct
5 Correct 83 ms 8540 KB Output is correct
6 Correct 1390 ms 19816 KB Output is correct
7 Correct 1102 ms 19688 KB Output is correct
8 Correct 959 ms 19704 KB Output is correct
9 Correct 674 ms 18028 KB Output is correct
10 Correct 610 ms 17772 KB Output is correct
11 Correct 885 ms 20588 KB Output is correct
12 Correct 757 ms 20588 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1319 ms 15708 KB Output is correct
2 Correct 81 ms 8564 KB Output is correct
3 Correct 143 ms 12140 KB Output is correct
4 Correct 64 ms 9712 KB Output is correct
5 Correct 336 ms 13544 KB Output is correct
6 Correct 1280 ms 15592 KB Output is correct
7 Correct 332 ms 13552 KB Output is correct
8 Correct 526 ms 12776 KB Output is correct
9 Correct 530 ms 12780 KB Output is correct
10 Correct 444 ms 13032 KB Output is correct
11 Correct 907 ms 13928 KB Output is correct
12 Correct 899 ms 14060 KB Output is correct
13 Correct 744 ms 14288 KB Output is correct
14 Correct 325 ms 13676 KB Output is correct
15 Correct 354 ms 13804 KB Output is correct
16 Correct 1251 ms 15236 KB Output is correct
17 Correct 1253 ms 15340 KB Output is correct
18 Correct 1265 ms 15340 KB Output is correct
19 Correct 1272 ms 15456 KB Output is correct
20 Correct 824 ms 14696 KB Output is correct
21 Correct 818 ms 14828 KB Output is correct
22 Correct 1073 ms 15364 KB Output is correct
23 Correct 372 ms 12268 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1468 ms 21320 KB Output is correct
2 Correct 1475 ms 21164 KB Output is correct
3 Correct 1478 ms 21200 KB Output is correct
4 Correct 1548 ms 21228 KB Output is correct
5 Correct 1589 ms 21100 KB Output is correct
6 Correct 2283 ms 21560 KB Output is correct
7 Correct 2354 ms 21404 KB Output is correct
8 Correct 2255 ms 21480 KB Output is correct
9 Correct 81 ms 8568 KB Output is correct
10 Correct 1196 ms 18612 KB Output is correct
11 Correct 1117 ms 18536 KB Output is correct
12 Correct 1048 ms 19792 KB Output is correct
13 Correct 1371 ms 22432 KB Output is correct
14 Correct 1184 ms 19696 KB Output is correct
15 Correct 999 ms 17288 KB Output is correct
16 Correct 1452 ms 19768 KB Output is correct
17 Correct 1213 ms 19692 KB Output is correct
18 Correct 83 ms 8540 KB Output is correct
19 Correct 1390 ms 19816 KB Output is correct
20 Correct 1102 ms 19688 KB Output is correct
21 Correct 959 ms 19704 KB Output is correct
22 Correct 674 ms 18028 KB Output is correct
23 Correct 610 ms 17772 KB Output is correct
24 Correct 885 ms 20588 KB Output is correct
25 Correct 757 ms 20588 KB Output is correct
26 Correct 1430 ms 21408 KB Output is correct
27 Correct 1847 ms 21332 KB Output is correct
28 Correct 1533 ms 21356 KB Output is correct
29 Correct 1056 ms 21240 KB Output is correct
30 Correct 1875 ms 21272 KB Output is correct
31 Correct 1877 ms 21228 KB Output is correct
32 Correct 1834 ms 21228 KB Output is correct
33 Correct 1549 ms 21412 KB Output is correct
34 Correct 1591 ms 21228 KB Output is correct
35 Correct 1544 ms 21224 KB Output is correct
36 Correct 1167 ms 21288 KB Output is correct
37 Correct 1128 ms 21224 KB Output is correct
38 Correct 1111 ms 21228 KB Output is correct
39 Correct 751 ms 19452 KB Output is correct
40 Correct 728 ms 19560 KB Output is correct
41 Correct 707 ms 19436 KB Output is correct
42 Correct 947 ms 22300 KB Output is correct
43 Correct 977 ms 22176 KB Output is correct
44 Correct 951 ms 22336 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 6272 KB Output is correct
2 Correct 7 ms 6272 KB Output is correct
3 Correct 35 ms 13184 KB Output is correct
4 Correct 13 ms 6528 KB Output is correct
5 Correct 27 ms 12160 KB Output is correct
6 Correct 18 ms 12160 KB Output is correct
7 Correct 21 ms 12288 KB Output is correct
8 Correct 22 ms 12280 KB Output is correct
9 Correct 22 ms 12288 KB Output is correct
10 Correct 23 ms 12288 KB Output is correct
11 Correct 23 ms 12288 KB Output is correct
12 Correct 24 ms 12288 KB Output is correct
13 Correct 28 ms 12544 KB Output is correct
14 Correct 26 ms 12544 KB Output is correct
15 Correct 25 ms 12288 KB Output is correct
16 Correct 21 ms 12288 KB Output is correct
17 Correct 22 ms 12288 KB Output is correct
18 Correct 1468 ms 21320 KB Output is correct
19 Correct 1475 ms 21164 KB Output is correct
20 Correct 1478 ms 21200 KB Output is correct
21 Correct 1548 ms 21228 KB Output is correct
22 Correct 1589 ms 21100 KB Output is correct
23 Correct 2283 ms 21560 KB Output is correct
24 Correct 2354 ms 21404 KB Output is correct
25 Correct 2255 ms 21480 KB Output is correct
26 Correct 81 ms 8568 KB Output is correct
27 Correct 1196 ms 18612 KB Output is correct
28 Correct 1117 ms 18536 KB Output is correct
29 Correct 1048 ms 19792 KB Output is correct
30 Correct 1371 ms 22432 KB Output is correct
31 Correct 1184 ms 19696 KB Output is correct
32 Correct 999 ms 17288 KB Output is correct
33 Correct 1452 ms 19768 KB Output is correct
34 Correct 1213 ms 19692 KB Output is correct
35 Correct 83 ms 8540 KB Output is correct
36 Correct 1390 ms 19816 KB Output is correct
37 Correct 1102 ms 19688 KB Output is correct
38 Correct 959 ms 19704 KB Output is correct
39 Correct 674 ms 18028 KB Output is correct
40 Correct 610 ms 17772 KB Output is correct
41 Correct 885 ms 20588 KB Output is correct
42 Correct 757 ms 20588 KB Output is correct
43 Correct 1319 ms 15708 KB Output is correct
44 Correct 81 ms 8564 KB Output is correct
45 Correct 143 ms 12140 KB Output is correct
46 Correct 64 ms 9712 KB Output is correct
47 Correct 336 ms 13544 KB Output is correct
48 Correct 1280 ms 15592 KB Output is correct
49 Correct 332 ms 13552 KB Output is correct
50 Correct 526 ms 12776 KB Output is correct
51 Correct 530 ms 12780 KB Output is correct
52 Correct 444 ms 13032 KB Output is correct
53 Correct 907 ms 13928 KB Output is correct
54 Correct 899 ms 14060 KB Output is correct
55 Correct 744 ms 14288 KB Output is correct
56 Correct 325 ms 13676 KB Output is correct
57 Correct 354 ms 13804 KB Output is correct
58 Correct 1251 ms 15236 KB Output is correct
59 Correct 1253 ms 15340 KB Output is correct
60 Correct 1265 ms 15340 KB Output is correct
61 Correct 1272 ms 15456 KB Output is correct
62 Correct 824 ms 14696 KB Output is correct
63 Correct 818 ms 14828 KB Output is correct
64 Correct 1073 ms 15364 KB Output is correct
65 Correct 372 ms 12268 KB Output is correct
66 Correct 1430 ms 21408 KB Output is correct
67 Correct 1847 ms 21332 KB Output is correct
68 Correct 1533 ms 21356 KB Output is correct
69 Correct 1056 ms 21240 KB Output is correct
70 Correct 1875 ms 21272 KB Output is correct
71 Correct 1877 ms 21228 KB Output is correct
72 Correct 1834 ms 21228 KB Output is correct
73 Correct 1549 ms 21412 KB Output is correct
74 Correct 1591 ms 21228 KB Output is correct
75 Correct 1544 ms 21224 KB Output is correct
76 Correct 1167 ms 21288 KB Output is correct
77 Correct 1128 ms 21224 KB Output is correct
78 Correct 1111 ms 21228 KB Output is correct
79 Correct 751 ms 19452 KB Output is correct
80 Correct 728 ms 19560 KB Output is correct
81 Correct 707 ms 19436 KB Output is correct
82 Correct 947 ms 22300 KB Output is correct
83 Correct 977 ms 22176 KB Output is correct
84 Correct 951 ms 22336 KB Output is correct
85 Correct 1894 ms 24304 KB Output is correct
86 Correct 177 ms 19564 KB Output is correct
87 Correct 91 ms 17132 KB Output is correct
88 Correct 739 ms 20588 KB Output is correct
89 Correct 1945 ms 24328 KB Output is correct
90 Correct 799 ms 20248 KB Output is correct
91 Correct 1770 ms 21132 KB Output is correct
92 Correct 1714 ms 21168 KB Output is correct
93 Correct 2505 ms 21352 KB Output is correct
94 Correct 1991 ms 22532 KB Output is correct
95 Correct 1966 ms 22660 KB Output is correct
96 Correct 2023 ms 22376 KB Output is correct
97 Correct 466 ms 19944 KB Output is correct
98 Correct 619 ms 19920 KB Output is correct
99 Correct 2163 ms 24040 KB Output is correct
100 Correct 2108 ms 24040 KB Output is correct
101 Correct 2196 ms 23972 KB Output is correct
102 Correct 2246 ms 23976 KB Output is correct
103 Correct 2028 ms 22928 KB Output is correct
104 Correct 2003 ms 22848 KB Output is correct
105 Correct 1830 ms 23876 KB Output is correct
106 Correct 1564 ms 23652 KB Output is correct
107 Correct 1310 ms 21352 KB Output is correct
108 Correct 2180 ms 23364 KB Output is correct
109 Correct 1010 ms 19052 KB Output is correct