oj.uz

Submission #600378

# Submission time Handle Problem Language Result Execution time Memory
600378 2022-07-20T19:28:43 Z Ozy Bridges (APIO19_bridges) C++17
100 / 100
 2707 ms 413036 KB 
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)

#define MAX 100000

#define w first
#define ini second.first
#define fin second.second
#define tipo first
#define x second.first
#define y second.second

#define C 1500

lli n,m,q,a,b,c,cont,l,r;
lli bfijos[MAX+2], respuestas[MAX + 2];
pair<lli, pair<lli,lli> > puentes[MAX+2];
vector< pair<lli, pair<lli,lli> > > querys;
vector<lli> porUnir[MAX + 2];
lli dsu[MAX + 2], tam[MAX + 2];
stack<lli> stackdsu;

lli sube(lli a){
    while (a != dsu[a]) a = dsu[a];
    return a;
}

void une(lli a, lli b, bool registra){
    a = sube(a);
    b = sube(b);
    if (a == b) return;
    if (tam[a] > tam[b]) swap(a, b);
    dsu[a] = b;
    tam[b] += tam[a];
    if (registra) stackdsu.push(a);
}

void separa(lli a){
    tam[dsu[a]] -= tam[a];
    dsu[a] = a;
}

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

    cin >> n >> m;
    rep(i,1,m) {
        cin >> a >> b >> c;
        puentes[i] = {c,{a,b}};
    }

    cin >> q;
    cont = 1;

    querys.push_back({0,{0,0}});
    rep(Q,1,q) {
        cin >> a >> b >> c;
        querys.push_back({a,{b,c}});
    }

    l = 1;
    r = min(l + C, q);
    while(l <= q){

        //preparo la cubeta
        fill(bfijos, bfijos+m+2, 1);
        vector<lli> fijos, cambian, procesar;

        // primera vuelta
        rep(i, l, r) if (querys[i].tipo == 1) bfijos[querys[i].x] = 0;
        rep(i, 1, m) if(bfijos[i]) fijos.push_back(i); else cambian.push_back(i);

        // segunda vuelta
        rep(i, l, r){
            if (querys[i].tipo == 1) puentes[querys[i].x].w = querys[i].y;
            else {
                for(auto puente : cambian){
                    if (puentes[puente].w >= querys[i].y) porUnir[i].push_back(puente);
                }
                procesar.push_back(i);
            }
        }

        //proceso la cubeta
        sort(fijos.begin(), fijos.end(), [&](lli a, lli b){return puentes[a].w > puentes[b].w;});
        sort(procesar.begin(), procesar.end(), [&](lli a, lli b){return querys[a].y > querys[b].y;});

        // inicializa dsu
        fill(tam + 1, tam + n + 1, 1);
        iota(dsu, dsu + n + 1, 0);

        a = b = 0;
        while (b < procesar.size()){
            lli idq = procesar[b];

            while (a < fijos.size() && puentes[fijos[a]].w >= querys[idq].y){
                une(puentes[fijos[a]].ini, puentes[fijos[a]].fin, false);
                ++a;
            }

            for(auto var : porUnir[idq]) une(puentes[var].ini, puentes[var].fin, true);

            lli tmp = sube(querys[idq].x);
            respuestas[idq] = tam[tmp];

            while(!stackdsu.empty()){
                separa(stackdsu.top());
                stackdsu.pop();
            }
            b++;
        }

        l = r + 1;
        r = min(l + C, q);
    }

    rep(i, 1, q){
        if (querys[i].tipo == 2) cout << respuestas[i] << "\n";
    }
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:101:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         while (b < procesar.size()){
      |                ~~^~~~~~~~~~~~~~~~~
bridges.cpp:104:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |             while (a < fijos.size() && puentes[fijos[a]].w >= querys[idq].y){
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 43 ms 16984 KB Output is correct
4 Correct 5 ms 3268 KB Output is correct
5 Correct 13 ms 6252 KB Output is correct
6 Correct 11 ms 6148 KB Output is correct
7 Correct 13 ms 6100 KB Output is correct
8 Correct 15 ms 5756 KB Output is correct
9 Correct 17 ms 8200 KB Output is correct
10 Correct 15 ms 6088 KB Output is correct
11 Correct 14 ms 6016 KB Output is correct
12 Correct 17 ms 6868 KB Output is correct
13 Correct 20 ms 8028 KB Output is correct
14 Correct 18 ms 7300 KB Output is correct
15 Correct 15 ms 6316 KB Output is correct
16 Correct 16 ms 6932 KB Output is correct
17 Correct 15 ms 6996 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1485 ms 228340 KB Output is correct
2 Correct 1457 ms 230120 KB Output is correct
3 Correct 1491 ms 231100 KB Output is correct
4 Correct 1460 ms 229516 KB Output is correct
5 Correct 1463 ms 230756 KB Output is correct
6 Correct 2447 ms 410628 KB Output is correct
7 Correct 2425 ms 412152 KB Output is correct
8 Correct 2457 ms 411600 KB Output is correct
9 Correct 34 ms 7508 KB Output is correct
10 Correct 1501 ms 309972 KB Output is correct
11 Correct 1401 ms 270884 KB Output is correct
12 Correct 1199 ms 189712 KB Output is correct
13 Correct 1192 ms 158504 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1305 ms 227668 KB Output is correct
2 Correct 1163 ms 316140 KB Output is correct
3 Correct 1625 ms 321416 KB Output is correct
4 Correct 1272 ms 227816 KB Output is correct
5 Correct 34 ms 7488 KB Output is correct
6 Correct 1493 ms 296732 KB Output is correct
7 Correct 1144 ms 201148 KB Output is correct
8 Correct 928 ms 147868 KB Output is correct
9 Correct 725 ms 110948 KB Output is correct
10 Correct 625 ms 77432 KB Output is correct
11 Correct 740 ms 104800 KB Output is correct
12 Correct 611 ms 76176 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1012 ms 12180 KB Output is correct
2 Correct 34 ms 6204 KB Output is correct
3 Correct 118 ms 8152 KB Output is correct
4 Correct 65 ms 8068 KB Output is correct
5 Correct 528 ms 12096 KB Output is correct
6 Correct 988 ms 12096 KB Output is correct
7 Correct 529 ms 12168 KB Output is correct
8 Correct 498 ms 9468 KB Output is correct
9 Correct 494 ms 9400 KB Output is correct
10 Correct 508 ms 9684 KB Output is correct
11 Correct 756 ms 11080 KB Output is correct
12 Correct 746 ms 10848 KB Output is correct
13 Correct 757 ms 11192 KB Output is correct
14 Correct 483 ms 12208 KB Output is correct
15 Correct 509 ms 12252 KB Output is correct
16 Correct 1016 ms 12284 KB Output is correct
17 Correct 1018 ms 11944 KB Output is correct
18 Correct 1052 ms 12128 KB Output is correct
19 Correct 1050 ms 12100 KB Output is correct
20 Correct 874 ms 11636 KB Output is correct
21 Correct 896 ms 11568 KB Output is correct
22 Correct 1057 ms 12080 KB Output is correct
23 Correct 601 ms 11312 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1485 ms 228340 KB Output is correct
2 Correct 1457 ms 230120 KB Output is correct
3 Correct 1491 ms 231100 KB Output is correct
4 Correct 1460 ms 229516 KB Output is correct
5 Correct 1463 ms 230756 KB Output is correct
6 Correct 2447 ms 410628 KB Output is correct
7 Correct 2425 ms 412152 KB Output is correct
8 Correct 2457 ms 411600 KB Output is correct
9 Correct 34 ms 7508 KB Output is correct
10 Correct 1501 ms 309972 KB Output is correct
11 Correct 1401 ms 270884 KB Output is correct
12 Correct 1199 ms 189712 KB Output is correct
13 Correct 1192 ms 158504 KB Output is correct
14 Correct 1305 ms 227668 KB Output is correct
15 Correct 1163 ms 316140 KB Output is correct
16 Correct 1625 ms 321416 KB Output is correct
17 Correct 1272 ms 227816 KB Output is correct
18 Correct 34 ms 7488 KB Output is correct
19 Correct 1493 ms 296732 KB Output is correct
20 Correct 1144 ms 201148 KB Output is correct
21 Correct 928 ms 147868 KB Output is correct
22 Correct 725 ms 110948 KB Output is correct
23 Correct 625 ms 77432 KB Output is correct
24 Correct 740 ms 104800 KB Output is correct
25 Correct 611 ms 76176 KB Output is correct
26 Correct 1626 ms 229140 KB Output is correct
27 Correct 2091 ms 325104 KB Output is correct
28 Correct 1607 ms 223912 KB Output is correct
29 Correct 916 ms 82824 KB Output is correct
30 Correct 1993 ms 280560 KB Output is correct
31 Correct 2021 ms 289104 KB Output is correct
32 Correct 2021 ms 290988 KB Output is correct
33 Correct 1588 ms 223596 KB Output is correct
34 Correct 1599 ms 224148 KB Output is correct
35 Correct 1612 ms 225596 KB Output is correct
36 Correct 1033 ms 104164 KB Output is correct
37 Correct 1010 ms 99588 KB Output is correct
38 Correct 973 ms 93828 KB Output is correct
39 Correct 694 ms 46168 KB Output is correct
40 Correct 717 ms 43956 KB Output is correct
41 Correct 674 ms 42820 KB Output is correct
42 Correct 683 ms 44560 KB Output is correct
43 Correct 671 ms 42684 KB Output is correct
44 Correct 659 ms 41040 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 43 ms 16984 KB Output is correct
4 Correct 5 ms 3268 KB Output is correct
5 Correct 13 ms 6252 KB Output is correct
6 Correct 11 ms 6148 KB Output is correct
7 Correct 13 ms 6100 KB Output is correct
8 Correct 15 ms 5756 KB Output is correct
9 Correct 17 ms 8200 KB Output is correct
10 Correct 15 ms 6088 KB Output is correct
11 Correct 14 ms 6016 KB Output is correct
12 Correct 17 ms 6868 KB Output is correct
13 Correct 20 ms 8028 KB Output is correct
14 Correct 18 ms 7300 KB Output is correct
15 Correct 15 ms 6316 KB Output is correct
16 Correct 16 ms 6932 KB Output is correct
17 Correct 15 ms 6996 KB Output is correct
18 Correct 1485 ms 228340 KB Output is correct
19 Correct 1457 ms 230120 KB Output is correct
20 Correct 1491 ms 231100 KB Output is correct
21 Correct 1460 ms 229516 KB Output is correct
22 Correct 1463 ms 230756 KB Output is correct
23 Correct 2447 ms 410628 KB Output is correct
24 Correct 2425 ms 412152 KB Output is correct
25 Correct 2457 ms 411600 KB Output is correct
26 Correct 34 ms 7508 KB Output is correct
27 Correct 1501 ms 309972 KB Output is correct
28 Correct 1401 ms 270884 KB Output is correct
29 Correct 1199 ms 189712 KB Output is correct
30 Correct 1192 ms 158504 KB Output is correct
31 Correct 1305 ms 227668 KB Output is correct
32 Correct 1163 ms 316140 KB Output is correct
33 Correct 1625 ms 321416 KB Output is correct
34 Correct 1272 ms 227816 KB Output is correct
35 Correct 34 ms 7488 KB Output is correct
36 Correct 1493 ms 296732 KB Output is correct
37 Correct 1144 ms 201148 KB Output is correct
38 Correct 928 ms 147868 KB Output is correct
39 Correct 725 ms 110948 KB Output is correct
40 Correct 625 ms 77432 KB Output is correct
41 Correct 740 ms 104800 KB Output is correct
42 Correct 611 ms 76176 KB Output is correct
43 Correct 1012 ms 12180 KB Output is correct
44 Correct 34 ms 6204 KB Output is correct
45 Correct 118 ms 8152 KB Output is correct
46 Correct 65 ms 8068 KB Output is correct
47 Correct 528 ms 12096 KB Output is correct
48 Correct 988 ms 12096 KB Output is correct
49 Correct 529 ms 12168 KB Output is correct
50 Correct 498 ms 9468 KB Output is correct
51 Correct 494 ms 9400 KB Output is correct
52 Correct 508 ms 9684 KB Output is correct
53 Correct 756 ms 11080 KB Output is correct
54 Correct 746 ms 10848 KB Output is correct
55 Correct 757 ms 11192 KB Output is correct
56 Correct 483 ms 12208 KB Output is correct
57 Correct 509 ms 12252 KB Output is correct
58 Correct 1016 ms 12284 KB Output is correct
59 Correct 1018 ms 11944 KB Output is correct
60 Correct 1052 ms 12128 KB Output is correct
61 Correct 1050 ms 12100 KB Output is correct
62 Correct 874 ms 11636 KB Output is correct
63 Correct 896 ms 11568 KB Output is correct
64 Correct 1057 ms 12080 KB Output is correct
65 Correct 601 ms 11312 KB Output is correct
66 Correct 1626 ms 229140 KB Output is correct
67 Correct 2091 ms 325104 KB Output is correct
68 Correct 1607 ms 223912 KB Output is correct
69 Correct 916 ms 82824 KB Output is correct
70 Correct 1993 ms 280560 KB Output is correct
71 Correct 2021 ms 289104 KB Output is correct
72 Correct 2021 ms 290988 KB Output is correct
73 Correct 1588 ms 223596 KB Output is correct
74 Correct 1599 ms 224148 KB Output is correct
75 Correct 1612 ms 225596 KB Output is correct
76 Correct 1033 ms 104164 KB Output is correct
77 Correct 1010 ms 99588 KB Output is correct
78 Correct 973 ms 93828 KB Output is correct
79 Correct 694 ms 46168 KB Output is correct
80 Correct 717 ms 43956 KB Output is correct
81 Correct 674 ms 42820 KB Output is correct
82 Correct 683 ms 44560 KB Output is correct
83 Correct 671 ms 42684 KB Output is correct
84 Correct 659 ms 41040 KB Output is correct
85 Correct 1874 ms 234948 KB Output is correct
86 Correct 172 ms 30208 KB Output is correct
87 Correct 140 ms 46892 KB Output is correct
88 Correct 1329 ms 295784 KB Output is correct
89 Correct 1843 ms 229920 KB Output is correct
90 Correct 1354 ms 300868 KB Output is correct
91 Correct 1679 ms 230396 KB Output is correct
92 Correct 1666 ms 229684 KB Output is correct
93 Correct 2707 ms 412208 KB Output is correct
94 Correct 1627 ms 232896 KB Output is correct
95 Correct 1666 ms 231704 KB Output is correct
96 Correct 2073 ms 411428 KB Output is correct
97 Correct 784 ms 116268 KB Output is correct
98 Correct 899 ms 109244 KB Output is correct
99 Correct 1955 ms 238108 KB Output is correct
100 Correct 1992 ms 234984 KB Output is correct
101 Correct 1920 ms 233552 KB Output is correct
102 Correct 1906 ms 232768 KB Output is correct
103 Correct 2345 ms 413036 KB Output is correct
104 Correct 2380 ms 413024 KB Output is correct
105 Correct 1420 ms 163976 KB Output is correct
106 Correct 1071 ms 94180 KB Output is correct
107 Correct 1298 ms 187524 KB Output is correct
108 Correct 2178 ms 402184 KB Output is correct
109 Correct 1792 ms 410744 KB Output is correct