oj.uz

Submission #211415

# Submission time Handle Problem Language Result Execution time Memory
211415 2020-03-20T10:12:00 Z VEGAnn Bridges (APIO19_bridges) C++14
100 / 100
 2795 ms 26100 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 = 1000;
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 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 mem = sz(stk);

            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) > mem){
                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 8 ms 6272 KB Output is correct
2 Correct 11 ms 6272 KB Output is correct
3 Correct 38 ms 10496 KB Output is correct
4 Correct 13 ms 6528 KB Output is correct
5 Correct 20 ms 10496 KB Output is correct
6 Correct 27 ms 10496 KB Output is correct
7 Correct 20 ms 10496 KB Output is correct
8 Correct 21 ms 10496 KB Output is correct
9 Correct 22 ms 10488 KB Output is correct
10 Correct 22 ms 10496 KB Output is correct
11 Correct 31 ms 10496 KB Output is correct
12 Correct 24 ms 10496 KB Output is correct
13 Correct 27 ms 10488 KB Output is correct
14 Correct 27 ms 10496 KB Output is correct
15 Correct 25 ms 10496 KB Output is correct
16 Correct 21 ms 10496 KB Output is correct
17 Correct 20 ms 10496 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1698 ms 19048 KB Output is correct
2 Correct 1696 ms 19172 KB Output is correct
3 Correct 1696 ms 18992 KB Output is correct
4 Correct 1752 ms 19096 KB Output is correct
5 Correct 1782 ms 19164 KB Output is correct
6 Correct 2218 ms 19304 KB Output is correct
7 Correct 2205 ms 19516 KB Output is correct
8 Correct 2206 ms 19172 KB Output is correct
9 Correct 81 ms 8564 KB Output is correct
10 Correct 1032 ms 16264 KB Output is correct
11 Correct 929 ms 16240 KB Output is correct
12 Correct 1188 ms 18260 KB Output is correct
13 Correct 1608 ms 20460 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1350 ms 17228 KB Output is correct
2 Correct 914 ms 14552 KB Output is correct
3 Correct 1535 ms 17512 KB Output is correct
4 Correct 1320 ms 17512 KB Output is correct
5 Correct 104 ms 8540 KB Output is correct
6 Correct 1472 ms 17256 KB Output is correct
7 Correct 1245 ms 17280 KB Output is correct
8 Correct 1109 ms 17272 KB Output is correct
9 Correct 891 ms 16236 KB Output is correct
10 Correct 827 ms 16108 KB Output is correct
11 Correct 1073 ms 18280 KB Output is correct
12 Correct 981 ms 18412 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2129 ms 16372 KB Output is correct
2 Correct 90 ms 9984 KB Output is correct
3 Correct 182 ms 13912 KB Output is correct
4 Correct 88 ms 11756 KB Output is correct
5 Correct 586 ms 16148 KB Output is correct
6 Correct 1727 ms 20200 KB Output is correct
7 Correct 581 ms 16108 KB Output is correct
8 Correct 732 ms 16020 KB Output is correct
9 Correct 730 ms 16112 KB Output is correct
10 Correct 632 ms 16108 KB Output is correct
11 Correct 1183 ms 17848 KB Output is correct
12 Correct 1173 ms 17896 KB Output is correct
13 Correct 969 ms 18028 KB Output is correct
14 Correct 567 ms 16360 KB Output is correct
15 Correct 571 ms 16232 KB Output is correct
16 Correct 1643 ms 19560 KB Output is correct
17 Correct 1651 ms 19816 KB Output is correct
18 Correct 1713 ms 19820 KB Output is correct
19 Correct 1704 ms 19692 KB Output is correct
20 Correct 1092 ms 18540 KB Output is correct
21 Correct 1145 ms 18928 KB Output is correct
22 Correct 1487 ms 19308 KB Output is correct
23 Correct 559 ms 15208 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1698 ms 19048 KB Output is correct
2 Correct 1696 ms 19172 KB Output is correct
3 Correct 1696 ms 18992 KB Output is correct
4 Correct 1752 ms 19096 KB Output is correct
5 Correct 1782 ms 19164 KB Output is correct
6 Correct 2218 ms 19304 KB Output is correct
7 Correct 2205 ms 19516 KB Output is correct
8 Correct 2206 ms 19172 KB Output is correct
9 Correct 81 ms 8564 KB Output is correct
10 Correct 1032 ms 16264 KB Output is correct
11 Correct 929 ms 16240 KB Output is correct
12 Correct 1188 ms 18260 KB Output is correct
13 Correct 1608 ms 20460 KB Output is correct
14 Correct 1350 ms 17228 KB Output is correct
15 Correct 914 ms 14552 KB Output is correct
16 Correct 1535 ms 17512 KB Output is correct
17 Correct 1320 ms 17512 KB Output is correct
18 Correct 104 ms 8540 KB Output is correct
19 Correct 1472 ms 17256 KB Output is correct
20 Correct 1245 ms 17280 KB Output is correct
21 Correct 1109 ms 17272 KB Output is correct
22 Correct 891 ms 16236 KB Output is correct
23 Correct 827 ms 16108 KB Output is correct
24 Correct 1073 ms 18280 KB Output is correct
25 Correct 981 ms 18412 KB Output is correct
26 Correct 1482 ms 19156 KB Output is correct
27 Correct 1822 ms 19304 KB Output is correct
28 Correct 1630 ms 19180 KB Output is correct
29 Correct 1214 ms 19308 KB Output is correct
30 Correct 1783 ms 19488 KB Output is correct
31 Correct 2005 ms 19328 KB Output is correct
32 Correct 1934 ms 19144 KB Output is correct
33 Correct 1788 ms 19096 KB Output is correct
34 Correct 1834 ms 19048 KB Output is correct
35 Correct 1794 ms 19084 KB Output is correct
36 Correct 1424 ms 19148 KB Output is correct
37 Correct 1404 ms 19016 KB Output is correct
38 Correct 1427 ms 18996 KB Output is correct
39 Correct 1041 ms 18012 KB Output is correct
40 Correct 997 ms 17916 KB Output is correct
41 Correct 977 ms 17928 KB Output is correct
42 Correct 1194 ms 20332 KB Output is correct
43 Correct 1216 ms 20200 KB Output is correct
44 Correct 1210 ms 20204 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 6272 KB Output is correct
2 Correct 11 ms 6272 KB Output is correct
3 Correct 38 ms 10496 KB Output is correct
4 Correct 13 ms 6528 KB Output is correct
5 Correct 20 ms 10496 KB Output is correct
6 Correct 27 ms 10496 KB Output is correct
7 Correct 20 ms 10496 KB Output is correct
8 Correct 21 ms 10496 KB Output is correct
9 Correct 22 ms 10488 KB Output is correct
10 Correct 22 ms 10496 KB Output is correct
11 Correct 31 ms 10496 KB Output is correct
12 Correct 24 ms 10496 KB Output is correct
13 Correct 27 ms 10488 KB Output is correct
14 Correct 27 ms 10496 KB Output is correct
15 Correct 25 ms 10496 KB Output is correct
16 Correct 21 ms 10496 KB Output is correct
17 Correct 20 ms 10496 KB Output is correct
18 Correct 1698 ms 19048 KB Output is correct
19 Correct 1696 ms 19172 KB Output is correct
20 Correct 1696 ms 18992 KB Output is correct
21 Correct 1752 ms 19096 KB Output is correct
22 Correct 1782 ms 19164 KB Output is correct
23 Correct 2218 ms 19304 KB Output is correct
24 Correct 2205 ms 19516 KB Output is correct
25 Correct 2206 ms 19172 KB Output is correct
26 Correct 81 ms 8564 KB Output is correct
27 Correct 1032 ms 16264 KB Output is correct
28 Correct 929 ms 16240 KB Output is correct
29 Correct 1188 ms 18260 KB Output is correct
30 Correct 1608 ms 20460 KB Output is correct
31 Correct 1350 ms 17228 KB Output is correct
32 Correct 914 ms 14552 KB Output is correct
33 Correct 1535 ms 17512 KB Output is correct
34 Correct 1320 ms 17512 KB Output is correct
35 Correct 104 ms 8540 KB Output is correct
36 Correct 1472 ms 17256 KB Output is correct
37 Correct 1245 ms 17280 KB Output is correct
38 Correct 1109 ms 17272 KB Output is correct
39 Correct 891 ms 16236 KB Output is correct
40 Correct 827 ms 16108 KB Output is correct
41 Correct 1073 ms 18280 KB Output is correct
42 Correct 981 ms 18412 KB Output is correct
43 Correct 2129 ms 16372 KB Output is correct
44 Correct 90 ms 9984 KB Output is correct
45 Correct 182 ms 13912 KB Output is correct
46 Correct 88 ms 11756 KB Output is correct
47 Correct 586 ms 16148 KB Output is correct
48 Correct 1727 ms 20200 KB Output is correct
49 Correct 581 ms 16108 KB Output is correct
50 Correct 732 ms 16020 KB Output is correct
51 Correct 730 ms 16112 KB Output is correct
52 Correct 632 ms 16108 KB Output is correct
53 Correct 1183 ms 17848 KB Output is correct
54 Correct 1173 ms 17896 KB Output is correct
55 Correct 969 ms 18028 KB Output is correct
56 Correct 567 ms 16360 KB Output is correct
57 Correct 571 ms 16232 KB Output is correct
58 Correct 1643 ms 19560 KB Output is correct
59 Correct 1651 ms 19816 KB Output is correct
60 Correct 1713 ms 19820 KB Output is correct
61 Correct 1704 ms 19692 KB Output is correct
62 Correct 1092 ms 18540 KB Output is correct
63 Correct 1145 ms 18928 KB Output is correct
64 Correct 1487 ms 19308 KB Output is correct
65 Correct 559 ms 15208 KB Output is correct
66 Correct 1482 ms 19156 KB Output is correct
67 Correct 1822 ms 19304 KB Output is correct
68 Correct 1630 ms 19180 KB Output is correct
69 Correct 1214 ms 19308 KB Output is correct
70 Correct 1783 ms 19488 KB Output is correct
71 Correct 2005 ms 19328 KB Output is correct
72 Correct 1934 ms 19144 KB Output is correct
73 Correct 1788 ms 19096 KB Output is correct
74 Correct 1834 ms 19048 KB Output is correct
75 Correct 1794 ms 19084 KB Output is correct
76 Correct 1424 ms 19148 KB Output is correct
77 Correct 1404 ms 19016 KB Output is correct
78 Correct 1427 ms 18996 KB Output is correct
79 Correct 1041 ms 18012 KB Output is correct
80 Correct 997 ms 17916 KB Output is correct
81 Correct 977 ms 17928 KB Output is correct
82 Correct 1194 ms 20332 KB Output is correct
83 Correct 1216 ms 20200 KB Output is correct
84 Correct 1210 ms 20204 KB Output is correct
85 Correct 2475 ms 26084 KB Output is correct
86 Correct 211 ms 18804 KB Output is correct
87 Correct 138 ms 16496 KB Output is correct
88 Correct 1020 ms 20832 KB Output is correct
89 Correct 2529 ms 26100 KB Output is correct
90 Correct 1050 ms 20212 KB Output is correct
91 Correct 1830 ms 21972 KB Output is correct
92 Correct 1824 ms 21916 KB Output is correct
93 Correct 2392 ms 21740 KB Output is correct
94 Correct 2227 ms 23740 KB Output is correct
95 Correct 2243 ms 23816 KB Output is correct
96 Correct 2427 ms 23560 KB Output is correct
97 Correct 725 ms 20640 KB Output is correct
98 Correct 863 ms 20076 KB Output is correct
99 Correct 2664 ms 25568 KB Output is correct
100 Correct 2635 ms 25696 KB Output is correct
101 Correct 2695 ms 25968 KB Output is correct
102 Correct 2795 ms 25660 KB Output is correct
103 Correct 2700 ms 24200 KB Output is correct
104 Correct 2612 ms 24080 KB Output is correct
105 Correct 2243 ms 25140 KB Output is correct
106 Correct 1880 ms 24636 KB Output is correct
107 Correct 1606 ms 23124 KB Output is correct
108 Correct 2624 ms 25116 KB Output is correct
109 Correct 1260 ms 19172 KB Output is correct