oj.uz

답안 #211419

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
211419 2020-03-20T10:16:40 Z VEGAnn 다리 (APIO19_bridges) C++14
100 / 100
 2736 ms 27464 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 = 1500;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6272 KB Output is correct
2 Correct 8 ms 6272 KB Output is correct
3 Correct 60 ms 15480 KB Output is correct
4 Correct 14 ms 6528 KB Output is correct
5 Correct 22 ms 13056 KB Output is correct
6 Correct 20 ms 13056 KB Output is correct
7 Correct 26 ms 13184 KB Output is correct
8 Correct 29 ms 13184 KB Output is correct
9 Correct 24 ms 13184 KB Output is correct
10 Correct 26 ms 13184 KB Output is correct
11 Correct 24 ms 13184 KB Output is correct
12 Correct 28 ms 13184 KB Output is correct
13 Correct 30 ms 13440 KB Output is correct
14 Correct 29 ms 13440 KB Output is correct
15 Correct 37 ms 13172 KB Output is correct
16 Correct 23 ms 13184 KB Output is correct
17 Correct 23 ms 13184 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1725 ms 23988 KB Output is correct
2 Correct 1696 ms 24060 KB Output is correct
3 Correct 1674 ms 24040 KB Output is correct
4 Correct 1674 ms 24312 KB Output is correct
5 Correct 1669 ms 24168 KB Output is correct
6 Correct 2601 ms 24272 KB Output is correct
7 Correct 2545 ms 24172 KB Output is correct
8 Correct 2578 ms 24232 KB Output is correct
9 Correct 81 ms 8564 KB Output is correct
10 Correct 1369 ms 21480 KB Output is correct
11 Correct 1231 ms 21228 KB Output is correct
12 Correct 1173 ms 21492 KB Output is correct
13 Correct 1493 ms 25192 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1345 ms 22252 KB Output is correct
2 Correct 1176 ms 19440 KB Output is correct
3 Correct 1660 ms 22416 KB Output is correct
4 Correct 1333 ms 22280 KB Output is correct
5 Correct 80 ms 8556 KB Output is correct
6 Correct 1545 ms 22572 KB Output is correct
7 Correct 1194 ms 22248 KB Output is correct
8 Correct 1040 ms 22180 KB Output is correct
9 Correct 720 ms 19436 KB Output is correct
10 Correct 614 ms 19232 KB Output is correct
11 Correct 964 ms 23276 KB Output is correct
12 Correct 811 ms 23272 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1215 ms 16496 KB Output is correct
2 Correct 81 ms 8560 KB Output is correct
3 Correct 132 ms 12140 KB Output is correct
4 Correct 73 ms 9712 KB Output is correct
5 Correct 418 ms 14100 KB Output is correct
6 Correct 1188 ms 16420 KB Output is correct
7 Correct 422 ms 13800 KB Output is correct
8 Correct 525 ms 13416 KB Output is correct
9 Correct 553 ms 13380 KB Output is correct
10 Correct 476 ms 13548 KB Output is correct
11 Correct 839 ms 14568 KB Output is correct
12 Correct 831 ms 14832 KB Output is correct
13 Correct 698 ms 14832 KB Output is correct
14 Correct 418 ms 13804 KB Output is correct
15 Correct 421 ms 13932 KB Output is correct
16 Correct 1173 ms 15980 KB Output is correct
17 Correct 1154 ms 15976 KB Output is correct
18 Correct 1201 ms 16136 KB Output is correct
19 Correct 1180 ms 15928 KB Output is correct
20 Correct 778 ms 15468 KB Output is correct
21 Correct 762 ms 15424 KB Output is correct
22 Correct 1024 ms 15980 KB Output is correct
23 Correct 398 ms 12776 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1725 ms 23988 KB Output is correct
2 Correct 1696 ms 24060 KB Output is correct
3 Correct 1674 ms 24040 KB Output is correct
4 Correct 1674 ms 24312 KB Output is correct
5 Correct 1669 ms 24168 KB Output is correct
6 Correct 2601 ms 24272 KB Output is correct
7 Correct 2545 ms 24172 KB Output is correct
8 Correct 2578 ms 24232 KB Output is correct
9 Correct 81 ms 8564 KB Output is correct
10 Correct 1369 ms 21480 KB Output is correct
11 Correct 1231 ms 21228 KB Output is correct
12 Correct 1173 ms 21492 KB Output is correct
13 Correct 1493 ms 25192 KB Output is correct
14 Correct 1345 ms 22252 KB Output is correct
15 Correct 1176 ms 19440 KB Output is correct
16 Correct 1660 ms 22416 KB Output is correct
17 Correct 1333 ms 22280 KB Output is correct
18 Correct 80 ms 8556 KB Output is correct
19 Correct 1545 ms 22572 KB Output is correct
20 Correct 1194 ms 22248 KB Output is correct
21 Correct 1040 ms 22180 KB Output is correct
22 Correct 720 ms 19436 KB Output is correct
23 Correct 614 ms 19232 KB Output is correct
24 Correct 964 ms 23276 KB Output is correct
25 Correct 811 ms 23272 KB Output is correct
26 Correct 1582 ms 24180 KB Output is correct
27 Correct 2150 ms 24200 KB Output is correct
28 Correct 1704 ms 24168 KB Output is correct
29 Correct 1207 ms 23968 KB Output is correct
30 Correct 2137 ms 24068 KB Output is correct
31 Correct 2266 ms 24012 KB Output is correct
32 Correct 2273 ms 23948 KB Output is correct
33 Correct 1916 ms 23904 KB Output is correct
34 Correct 1834 ms 23896 KB Output is correct
35 Correct 1791 ms 23912 KB Output is correct
36 Correct 1221 ms 23908 KB Output is correct
37 Correct 1189 ms 24044 KB Output is correct
38 Correct 1168 ms 24040 KB Output is correct
39 Correct 763 ms 21240 KB Output is correct
40 Correct 757 ms 21212 KB Output is correct
41 Correct 770 ms 21204 KB Output is correct
42 Correct 988 ms 25196 KB Output is correct
43 Correct 984 ms 25196 KB Output is correct
44 Correct 974 ms 25064 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6272 KB Output is correct
2 Correct 8 ms 6272 KB Output is correct
3 Correct 60 ms 15480 KB Output is correct
4 Correct 14 ms 6528 KB Output is correct
5 Correct 22 ms 13056 KB Output is correct
6 Correct 20 ms 13056 KB Output is correct
7 Correct 26 ms 13184 KB Output is correct
8 Correct 29 ms 13184 KB Output is correct
9 Correct 24 ms 13184 KB Output is correct
10 Correct 26 ms 13184 KB Output is correct
11 Correct 24 ms 13184 KB Output is correct
12 Correct 28 ms 13184 KB Output is correct
13 Correct 30 ms 13440 KB Output is correct
14 Correct 29 ms 13440 KB Output is correct
15 Correct 37 ms 13172 KB Output is correct
16 Correct 23 ms 13184 KB Output is correct
17 Correct 23 ms 13184 KB Output is correct
18 Correct 1725 ms 23988 KB Output is correct
19 Correct 1696 ms 24060 KB Output is correct
20 Correct 1674 ms 24040 KB Output is correct
21 Correct 1674 ms 24312 KB Output is correct
22 Correct 1669 ms 24168 KB Output is correct
23 Correct 2601 ms 24272 KB Output is correct
24 Correct 2545 ms 24172 KB Output is correct
25 Correct 2578 ms 24232 KB Output is correct
26 Correct 81 ms 8564 KB Output is correct
27 Correct 1369 ms 21480 KB Output is correct
28 Correct 1231 ms 21228 KB Output is correct
29 Correct 1173 ms 21492 KB Output is correct
30 Correct 1493 ms 25192 KB Output is correct
31 Correct 1345 ms 22252 KB Output is correct
32 Correct 1176 ms 19440 KB Output is correct
33 Correct 1660 ms 22416 KB Output is correct
34 Correct 1333 ms 22280 KB Output is correct
35 Correct 80 ms 8556 KB Output is correct
36 Correct 1545 ms 22572 KB Output is correct
37 Correct 1194 ms 22248 KB Output is correct
38 Correct 1040 ms 22180 KB Output is correct
39 Correct 720 ms 19436 KB Output is correct
40 Correct 614 ms 19232 KB Output is correct
41 Correct 964 ms 23276 KB Output is correct
42 Correct 811 ms 23272 KB Output is correct
43 Correct 1215 ms 16496 KB Output is correct
44 Correct 81 ms 8560 KB Output is correct
45 Correct 132 ms 12140 KB Output is correct
46 Correct 73 ms 9712 KB Output is correct
47 Correct 418 ms 14100 KB Output is correct
48 Correct 1188 ms 16420 KB Output is correct
49 Correct 422 ms 13800 KB Output is correct
50 Correct 525 ms 13416 KB Output is correct
51 Correct 553 ms 13380 KB Output is correct
52 Correct 476 ms 13548 KB Output is correct
53 Correct 839 ms 14568 KB Output is correct
54 Correct 831 ms 14832 KB Output is correct
55 Correct 698 ms 14832 KB Output is correct
56 Correct 418 ms 13804 KB Output is correct
57 Correct 421 ms 13932 KB Output is correct
58 Correct 1173 ms 15980 KB Output is correct
59 Correct 1154 ms 15976 KB Output is correct
60 Correct 1201 ms 16136 KB Output is correct
61 Correct 1180 ms 15928 KB Output is correct
62 Correct 778 ms 15468 KB Output is correct
63 Correct 762 ms 15424 KB Output is correct
64 Correct 1024 ms 15980 KB Output is correct
65 Correct 398 ms 12776 KB Output is correct
66 Correct 1582 ms 24180 KB Output is correct
67 Correct 2150 ms 24200 KB Output is correct
68 Correct 1704 ms 24168 KB Output is correct
69 Correct 1207 ms 23968 KB Output is correct
70 Correct 2137 ms 24068 KB Output is correct
71 Correct 2266 ms 24012 KB Output is correct
72 Correct 2273 ms 23948 KB Output is correct
73 Correct 1916 ms 23904 KB Output is correct
74 Correct 1834 ms 23896 KB Output is correct
75 Correct 1791 ms 23912 KB Output is correct
76 Correct 1221 ms 23908 KB Output is correct
77 Correct 1189 ms 24044 KB Output is correct
78 Correct 1168 ms 24040 KB Output is correct
79 Correct 763 ms 21240 KB Output is correct
80 Correct 757 ms 21212 KB Output is correct
81 Correct 770 ms 21204 KB Output is correct
82 Correct 988 ms 25196 KB Output is correct
83 Correct 984 ms 25196 KB Output is correct
84 Correct 974 ms 25064 KB Output is correct
85 Correct 2061 ms 27116 KB Output is correct
86 Correct 192 ms 21744 KB Output is correct
87 Correct 154 ms 19312 KB Output is correct
88 Correct 1129 ms 23276 KB Output is correct
89 Correct 2053 ms 27464 KB Output is correct
90 Correct 1115 ms 23020 KB Output is correct
91 Correct 1764 ms 24172 KB Output is correct
92 Correct 1768 ms 24172 KB Output is correct
93 Correct 2736 ms 24040 KB Output is correct
94 Correct 1898 ms 25704 KB Output is correct
95 Correct 1878 ms 25576 KB Output is correct
96 Correct 2430 ms 25192 KB Output is correct
97 Correct 607 ms 21736 KB Output is correct
98 Correct 849 ms 22760 KB Output is correct
99 Correct 2110 ms 26732 KB Output is correct
100 Correct 2041 ms 26728 KB Output is correct
101 Correct 2150 ms 26916 KB Output is correct
102 Correct 2132 ms 26984 KB Output is correct
103 Correct 2618 ms 25708 KB Output is correct
104 Correct 2590 ms 26048 KB Output is correct
105 Correct 1815 ms 26692 KB Output is correct
106 Correct 1445 ms 26472 KB Output is correct
107 Correct 1278 ms 23148 KB Output is correct
108 Correct 2192 ms 26400 KB Output is correct
109 Correct 1493 ms 21736 KB Output is correct