oj.uz

Submission #707623

# Submission time Handle Problem Language Result Execution time Memory
707623 2023-03-09T14:43:19 Z He_Huanglu Bridges (APIO19_bridges) C++17
100 / 100
 2441 ms 5836 KB 
#include <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
using namespace std;

const int N = 5e4 + 2, L = 1e5 + 2;
int n, m, q, from[L], to[L], d[L], par[N], ans[L];
short ok[L];
pair<int, ii> lst[L];
stack <ii> st;
stack <int> _st;


int root(int u)
{
    return par[u] < 0 ? u : root(par[u]);
}
void join(int u, int v, int tp)
{
    u = root(u), v = root(v);
    if(u == v) return ;
    if(par[u] > par[v]) swap(u, v);
    if(tp)
    {
        st.push({v, par[v]});
        st.push({u, par[u]});
    }
    par[u] += par[v];
    par[v] = u;
}
void undo()
{
    while (!st.empty())
    {
        par[st.top().fi] = st.top().se;
        st.pop();
    }
    while (!_st.empty())
    {
        ok[_st.top()] = 1;
        _st.pop();
    }
}


main ()
{
    cin.tie(0)->sync_with_stdio(0);
    if(fopen("task.inp", "r"))
    {
        freopen("task.inp", "r", stdin);
        freopen("wa.out", "w", stdout);
    }
    cin >> n >> m;
    for(int i = 1; i <= m; i++) cin >> from[i] >> to[i] >> d[i];
    cin >> q;
    for(int i = 1; i <= q; i++)
    {
        cin >> lst[i].fi >> lst[i].se.fi >> lst[i].se.se;
    }
    const int S = 1000;
    int lim = ceil(1.0 * q / S);
    for(int t = 0; t < lim; t++)
    {
        vector <pair<int, ii> > change, query;
        vector <int> remain;
        vector <ii> vt;
        for(int i = min(q, (t + 1) * S); i >= t * S + 1; i--)
        {
            if(lst[i].fi == 1)
            {
                ok[lst[i].se.fi] = 1;
                change.push_back({i, lst[i].se});
                vt.push_back(lst[i].se);
            }
            else query.push_back({i, lst[i].se});
        }
        for(int i = 1; i <= m; i++)
        {
            if(!ok[i]) remain.push_back(i);
            else change.push_back({0, {i, d[i]}});
        }
        sort(remain.begin(), remain.end(), [] (int x, int y) {
             return d[x] > d[y];
        });
        sort(query.begin(), query.end(), [] (pair<int, ii> x, pair<int, ii> y) {
             return x.se.se > y.se.se;
        });
        for(int i = 1; i <= n; i++) par[i] = -1;
        while (!st.empty()) st.pop();
        int it = 0;
        for(auto[id, e] : query)
        {
            int x = e.fi, w = e.se;
            while (it < remain.size() && d[remain[it]] >= w)
            {
                int i = remain[it];
                join(from[i], to[i], 0);
                it++;
            }
            for(auto[jd, _e] : change)
            {
                int i = _e.fi, r = _e.se;
                if(jd < id)
                {
                    if(r >= w && ok[i] != 2) join(from[i], to[i], 1);
                    ok[i] = 2;
                    _st.push(i);
                }
            }
            ans[id] = -par[root(x)];
            undo();
        }
        for(int i = vt.size() - 1; i >= 0; i--)
        {
            ii e = vt[i];
            ok[e.fi] = 0;
            d[e.fi] = e.se;
        }
    }
    for(int i = 1; i <= q; i++) if(lst[i].fi == 2) cout << ans[i] << "\n";

}

Compilation message

bridges.cpp:47:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   47 | main ()
      | ^~~~
bridges.cpp: In function 'int main()':
bridges.cpp:96:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |             while (it < remain.size() && d[remain[it]] >= w)
      |                    ~~~^~~~~~~~~~~~~~~
bridges.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("task.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:53:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |         freopen("wa.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 49 ms 532 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 27 ms 524 KB Output is correct
6 Correct 26 ms 552 KB Output is correct
7 Correct 31 ms 552 KB Output is correct
8 Correct 29 ms 556 KB Output is correct
9 Correct 33 ms 556 KB Output is correct
10 Correct 29 ms 548 KB Output is correct
11 Correct 29 ms 524 KB Output is correct
12 Correct 32 ms 552 KB Output is correct
13 Correct 37 ms 596 KB Output is correct
14 Correct 36 ms 536 KB Output is correct
15 Correct 32 ms 560 KB Output is correct
16 Correct 32 ms 548 KB Output is correct
17 Correct 31 ms 468 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1533 ms 3284 KB Output is correct
2 Correct 1568 ms 3516 KB Output is correct
3 Correct 1562 ms 3436 KB Output is correct
4 Correct 1590 ms 3364 KB Output is correct
5 Correct 1597 ms 3356 KB Output is correct
6 Correct 2341 ms 3424 KB Output is correct
7 Correct 2375 ms 3364 KB Output is correct
8 Correct 2336 ms 3452 KB Output is correct
9 Correct 30 ms 2004 KB Output is correct
10 Correct 1459 ms 3248 KB Output is correct
11 Correct 1371 ms 3356 KB Output is correct
12 Correct 1217 ms 3596 KB Output is correct
13 Correct 1200 ms 3544 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1271 ms 2936 KB Output is correct
2 Correct 1102 ms 2584 KB Output is correct
3 Correct 1541 ms 3184 KB Output is correct
4 Correct 1415 ms 2936 KB Output is correct
5 Correct 34 ms 1996 KB Output is correct
6 Correct 1430 ms 2864 KB Output is correct
7 Correct 1201 ms 2864 KB Output is correct
8 Correct 1047 ms 3012 KB Output is correct
9 Correct 723 ms 3048 KB Output is correct
10 Correct 669 ms 2768 KB Output is correct
11 Correct 768 ms 2976 KB Output is correct
12 Correct 659 ms 2940 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1404 ms 4528 KB Output is correct
2 Correct 32 ms 3228 KB Output is correct
3 Correct 147 ms 3684 KB Output is correct
4 Correct 75 ms 3748 KB Output is correct
5 Correct 674 ms 5512 KB Output is correct
6 Correct 1350 ms 5348 KB Output is correct
7 Correct 720 ms 5340 KB Output is correct
8 Correct 636 ms 4336 KB Output is correct
9 Correct 627 ms 4300 KB Output is correct
10 Correct 625 ms 4296 KB Output is correct
11 Correct 1050 ms 5072 KB Output is correct
12 Correct 994 ms 4968 KB Output is correct
13 Correct 1041 ms 4944 KB Output is correct
14 Correct 615 ms 5280 KB Output is correct
15 Correct 642 ms 5404 KB Output is correct
16 Correct 1378 ms 5808 KB Output is correct
17 Correct 1404 ms 5652 KB Output is correct
18 Correct 1373 ms 5836 KB Output is correct
19 Correct 1343 ms 5268 KB Output is correct
20 Correct 1170 ms 5352 KB Output is correct
21 Correct 1144 ms 5232 KB Output is correct
22 Correct 1341 ms 5292 KB Output is correct
23 Correct 763 ms 5176 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1533 ms 3284 KB Output is correct
2 Correct 1568 ms 3516 KB Output is correct
3 Correct 1562 ms 3436 KB Output is correct
4 Correct 1590 ms 3364 KB Output is correct
5 Correct 1597 ms 3356 KB Output is correct
6 Correct 2341 ms 3424 KB Output is correct
7 Correct 2375 ms 3364 KB Output is correct
8 Correct 2336 ms 3452 KB Output is correct
9 Correct 30 ms 2004 KB Output is correct
10 Correct 1459 ms 3248 KB Output is correct
11 Correct 1371 ms 3356 KB Output is correct
12 Correct 1217 ms 3596 KB Output is correct
13 Correct 1200 ms 3544 KB Output is correct
14 Correct 1271 ms 2936 KB Output is correct
15 Correct 1102 ms 2584 KB Output is correct
16 Correct 1541 ms 3184 KB Output is correct
17 Correct 1415 ms 2936 KB Output is correct
18 Correct 34 ms 1996 KB Output is correct
19 Correct 1430 ms 2864 KB Output is correct
20 Correct 1201 ms 2864 KB Output is correct
21 Correct 1047 ms 3012 KB Output is correct
22 Correct 723 ms 3048 KB Output is correct
23 Correct 669 ms 2768 KB Output is correct
24 Correct 768 ms 2976 KB Output is correct
25 Correct 659 ms 2940 KB Output is correct
26 Correct 1517 ms 3380 KB Output is correct
27 Correct 2031 ms 3344 KB Output is correct
28 Correct 1606 ms 3284 KB Output is correct
29 Correct 1173 ms 3264 KB Output is correct
30 Correct 1872 ms 3396 KB Output is correct
31 Correct 1891 ms 3304 KB Output is correct
32 Correct 1907 ms 3432 KB Output is correct
33 Correct 1559 ms 3500 KB Output is correct
34 Correct 1576 ms 3608 KB Output is correct
35 Correct 1616 ms 3480 KB Output is correct
36 Correct 1235 ms 3496 KB Output is correct
37 Correct 1203 ms 3308 KB Output is correct
38 Correct 1211 ms 3400 KB Output is correct
39 Correct 842 ms 3336 KB Output is correct
40 Correct 877 ms 3372 KB Output is correct
41 Correct 818 ms 3352 KB Output is correct
42 Correct 855 ms 3464 KB Output is correct
43 Correct 821 ms 3352 KB Output is correct
44 Correct 834 ms 3324 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 49 ms 532 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 27 ms 524 KB Output is correct
6 Correct 26 ms 552 KB Output is correct
7 Correct 31 ms 552 KB Output is correct
8 Correct 29 ms 556 KB Output is correct
9 Correct 33 ms 556 KB Output is correct
10 Correct 29 ms 548 KB Output is correct
11 Correct 29 ms 524 KB Output is correct
12 Correct 32 ms 552 KB Output is correct
13 Correct 37 ms 596 KB Output is correct
14 Correct 36 ms 536 KB Output is correct
15 Correct 32 ms 560 KB Output is correct
16 Correct 32 ms 548 KB Output is correct
17 Correct 31 ms 468 KB Output is correct
18 Correct 1533 ms 3284 KB Output is correct
19 Correct 1568 ms 3516 KB Output is correct
20 Correct 1562 ms 3436 KB Output is correct
21 Correct 1590 ms 3364 KB Output is correct
22 Correct 1597 ms 3356 KB Output is correct
23 Correct 2341 ms 3424 KB Output is correct
24 Correct 2375 ms 3364 KB Output is correct
25 Correct 2336 ms 3452 KB Output is correct
26 Correct 30 ms 2004 KB Output is correct
27 Correct 1459 ms 3248 KB Output is correct
28 Correct 1371 ms 3356 KB Output is correct
29 Correct 1217 ms 3596 KB Output is correct
30 Correct 1200 ms 3544 KB Output is correct
31 Correct 1271 ms 2936 KB Output is correct
32 Correct 1102 ms 2584 KB Output is correct
33 Correct 1541 ms 3184 KB Output is correct
34 Correct 1415 ms 2936 KB Output is correct
35 Correct 34 ms 1996 KB Output is correct
36 Correct 1430 ms 2864 KB Output is correct
37 Correct 1201 ms 2864 KB Output is correct
38 Correct 1047 ms 3012 KB Output is correct
39 Correct 723 ms 3048 KB Output is correct
40 Correct 669 ms 2768 KB Output is correct
41 Correct 768 ms 2976 KB Output is correct
42 Correct 659 ms 2940 KB Output is correct
43 Correct 1404 ms 4528 KB Output is correct
44 Correct 32 ms 3228 KB Output is correct
45 Correct 147 ms 3684 KB Output is correct
46 Correct 75 ms 3748 KB Output is correct
47 Correct 674 ms 5512 KB Output is correct
48 Correct 1350 ms 5348 KB Output is correct
49 Correct 720 ms 5340 KB Output is correct
50 Correct 636 ms 4336 KB Output is correct
51 Correct 627 ms 4300 KB Output is correct
52 Correct 625 ms 4296 KB Output is correct
53 Correct 1050 ms 5072 KB Output is correct
54 Correct 994 ms 4968 KB Output is correct
55 Correct 1041 ms 4944 KB Output is correct
56 Correct 615 ms 5280 KB Output is correct
57 Correct 642 ms 5404 KB Output is correct
58 Correct 1378 ms 5808 KB Output is correct
59 Correct 1404 ms 5652 KB Output is correct
60 Correct 1373 ms 5836 KB Output is correct
61 Correct 1343 ms 5268 KB Output is correct
62 Correct 1170 ms 5352 KB Output is correct
63 Correct 1144 ms 5232 KB Output is correct
64 Correct 1341 ms 5292 KB Output is correct
65 Correct 763 ms 5176 KB Output is correct
66 Correct 1517 ms 3380 KB Output is correct
67 Correct 2031 ms 3344 KB Output is correct
68 Correct 1606 ms 3284 KB Output is correct
69 Correct 1173 ms 3264 KB Output is correct
70 Correct 1872 ms 3396 KB Output is correct
71 Correct 1891 ms 3304 KB Output is correct
72 Correct 1907 ms 3432 KB Output is correct
73 Correct 1559 ms 3500 KB Output is correct
74 Correct 1576 ms 3608 KB Output is correct
75 Correct 1616 ms 3480 KB Output is correct
76 Correct 1235 ms 3496 KB Output is correct
77 Correct 1203 ms 3308 KB Output is correct
78 Correct 1211 ms 3400 KB Output is correct
79 Correct 842 ms 3336 KB Output is correct
80 Correct 877 ms 3372 KB Output is correct
81 Correct 818 ms 3352 KB Output is correct
82 Correct 855 ms 3464 KB Output is correct
83 Correct 821 ms 3352 KB Output is correct
84 Correct 834 ms 3324 KB Output is correct
85 Correct 2168 ms 5608 KB Output is correct
86 Correct 210 ms 3932 KB Output is correct
87 Correct 141 ms 3948 KB Output is correct
88 Correct 1492 ms 5664 KB Output is correct
89 Correct 2169 ms 5776 KB Output is correct
90 Correct 1473 ms 5420 KB Output is correct
91 Correct 1664 ms 4388 KB Output is correct
92 Correct 1647 ms 4436 KB Output is correct
93 Correct 2441 ms 4516 KB Output is correct
94 Correct 1851 ms 5316 KB Output is correct
95 Correct 1907 ms 5280 KB Output is correct
96 Correct 2142 ms 5124 KB Output is correct
97 Correct 914 ms 5508 KB Output is correct
98 Correct 1028 ms 5448 KB Output is correct
99 Correct 2312 ms 5532 KB Output is correct
100 Correct 2219 ms 5736 KB Output is correct
101 Correct 2226 ms 5544 KB Output is correct
102 Correct 2211 ms 5620 KB Output is correct
103 Correct 2309 ms 5168 KB Output is correct
104 Correct 2285 ms 5308 KB Output is correct
105 Correct 1624 ms 5188 KB Output is correct
106 Correct 1257 ms 5404 KB Output is correct
107 Correct 1482 ms 5648 KB Output is correct
108 Correct 2208 ms 5676 KB Output is correct
109 Correct 1664 ms 5272 KB Output is correct