oj.uz

Submission #963943

# Submission time Handle Problem Language Result Execution time Memory
963943 2024-04-16T04:40:13 Z oblantis Bridges (APIO19_bridges) C++17
100 / 100
 2822 ms 8540 KB 
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
#define uid(a, b) uniform_int_distribution<int>(a, b)(mt)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll inf = 1e18;
const int mod = 1e9+7;
const int maxn = 1e5+5;
const int sq = 317;
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int u[maxn], v[maxn], d[maxn], D[maxn], E[maxn], p[maxn], sz[maxn], a[maxn], b[maxn], wt[maxn];
bool ok[maxn];
bool c(int x, int y){
    return d[x] < d[y];
}
bool cmp(int x, int y){
    return b[x] < b[y];
}
int fnd(int x){
    while(p[x] != x)x = p[x];
    return x;
}
void solve() {
    int n, m, q;
    cin >> n >> m;
    for(int i = 0; i < m; i++){
        cin >> u[i] >> v[i] >> d[i];
        --u[i], --v[i];
        E[i] = i;
        D[i] = d[i];
    }
    cin >> q;
    for(int j = 0; j < q; j++){
        cin >> wt[j] >> a[j] >> b[j];
        --a[j];
    }
    vt<int> ch, qu;
    int out[q];
    for(int i = 0; i < q; i += sq){
            ch.clear(), qu.clear();
            for(int j = i; j < q && j / sq == i / sq; j++){
                if(wt[j] == 2){
                    qu.pb(j);
                }
                else {
                    ok[a[j]] = 1;
                    ch.pb(j);
                }
            }
            for(int i = 0; i < n; i++)p[i] = i, sz[i] = 1;
            sort(E, E + m, c);
            sort(all(qu), cmp);
            int sz1 = ch.size(), sz2 = qu.size(), r = m - 1;
            for(int j = sz2 - 1; j >= 0; j--){
                int it = qu[j];
                while(r >= 0 && d[E[r]] >= b[it]){
                    if(!ok[E[r]]){
                        int U = fnd(u[E[r]]), V = fnd(v[E[r]]);
                        if(U != V){
                            if(sz[U] > sz[V])swap(U, V);
                            p[U] = V, sz[V] += sz[U];
                        }
                    }
                    r--;
                }
                for(int o = 0; o < sz1 && ch[o] < it; o++){
                    D[a[ch[o]]] = b[ch[o]];
                }
                stack<int> rlx;
                for(int o = 0; o < sz1; o++){
                    if(D[a[ch[o]]] >= b[it]){
                        D[a[ch[o]]] = 0;
                        int U = fnd(u[a[ch[o]]]), V = fnd(v[a[ch[o]]]);
                        if(U != V){
                            if(sz[U] > sz[V])swap(U, V);
                            p[U] = V, sz[V] += sz[U];
                            rlx.push(U);
                        }
                    }
                }
                out[it] = sz[fnd(a[it])];
                while(!rlx.empty()){
                    int j = rlx.top();
                    sz[p[j]] -= sz[j];
                    p[j] = j;
                    rlx.pop();
                }
                for(int o = 0; o < sz1; o++)D[a[ch[o]]] = d[a[ch[o]]];
            }
            for(auto j : ch){
                ok[a[j]] = 0;
                D[a[j]] = d[a[j]] = b[j];
            }
    }
    for(int i = 0; i < q; i++){
        if(wt[i] == 2)cout << out[i] << '\n';
    }
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int times = 1; //cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 10 ms 856 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 7 ms 600 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 9 ms 604 KB Output is correct
9 Correct 8 ms 736 KB Output is correct
10 Correct 8 ms 604 KB Output is correct
11 Correct 8 ms 812 KB Output is correct
12 Correct 8 ms 740 KB Output is correct
13 Correct 10 ms 600 KB Output is correct
14 Correct 9 ms 604 KB Output is correct
15 Correct 9 ms 604 KB Output is correct
16 Correct 7 ms 600 KB Output is correct
17 Correct 7 ms 608 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1141 ms 6228 KB Output is correct
2 Correct 1097 ms 6188 KB Output is correct
3 Correct 1120 ms 6184 KB Output is correct
4 Correct 1089 ms 6248 KB Output is correct
5 Correct 1095 ms 6236 KB Output is correct
6 Correct 1173 ms 6228 KB Output is correct
7 Correct 1142 ms 6264 KB Output is correct
8 Correct 1164 ms 6288 KB Output is correct
9 Correct 28 ms 3408 KB Output is correct
10 Correct 582 ms 5072 KB Output is correct
11 Correct 555 ms 5200 KB Output is correct
12 Correct 940 ms 6160 KB Output is correct
13 Correct 1000 ms 6156 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 777 ms 5352 KB Output is correct
2 Correct 243 ms 3924 KB Output is correct
3 Correct 735 ms 5076 KB Output is correct
4 Correct 746 ms 5360 KB Output is correct
5 Correct 26 ms 3444 KB Output is correct
6 Correct 757 ms 5200 KB Output is correct
7 Correct 720 ms 5256 KB Output is correct
8 Correct 705 ms 5268 KB Output is correct
9 Correct 627 ms 5480 KB Output is correct
10 Correct 626 ms 5456 KB Output is correct
11 Correct 659 ms 5276 KB Output is correct
12 Correct 666 ms 5260 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1543 ms 8440 KB Output is correct
2 Correct 27 ms 3420 KB Output is correct
3 Correct 156 ms 4444 KB Output is correct
4 Correct 109 ms 4456 KB Output is correct
5 Correct 1180 ms 6920 KB Output is correct
6 Correct 1524 ms 8444 KB Output is correct
7 Correct 1199 ms 6900 KB Output is correct
8 Correct 594 ms 6072 KB Output is correct
9 Correct 594 ms 6228 KB Output is correct
10 Correct 602 ms 6188 KB Output is correct
11 Correct 1107 ms 7320 KB Output is correct
12 Correct 1040 ms 7468 KB Output is correct
13 Correct 1074 ms 7248 KB Output is correct
14 Correct 1179 ms 7152 KB Output is correct
15 Correct 1149 ms 7156 KB Output is correct
16 Correct 1560 ms 8368 KB Output is correct
17 Correct 1629 ms 8336 KB Output is correct
18 Correct 1574 ms 8452 KB Output is correct
19 Correct 1579 ms 8440 KB Output is correct
20 Correct 1335 ms 7744 KB Output is correct
21 Correct 1316 ms 7688 KB Output is correct
22 Correct 1667 ms 8360 KB Output is correct
23 Correct 1139 ms 6540 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1141 ms 6228 KB Output is correct
2 Correct 1097 ms 6188 KB Output is correct
3 Correct 1120 ms 6184 KB Output is correct
4 Correct 1089 ms 6248 KB Output is correct
5 Correct 1095 ms 6236 KB Output is correct
6 Correct 1173 ms 6228 KB Output is correct
7 Correct 1142 ms 6264 KB Output is correct
8 Correct 1164 ms 6288 KB Output is correct
9 Correct 28 ms 3408 KB Output is correct
10 Correct 582 ms 5072 KB Output is correct
11 Correct 555 ms 5200 KB Output is correct
12 Correct 940 ms 6160 KB Output is correct
13 Correct 1000 ms 6156 KB Output is correct
14 Correct 777 ms 5352 KB Output is correct
15 Correct 243 ms 3924 KB Output is correct
16 Correct 735 ms 5076 KB Output is correct
17 Correct 746 ms 5360 KB Output is correct
18 Correct 26 ms 3444 KB Output is correct
19 Correct 757 ms 5200 KB Output is correct
20 Correct 720 ms 5256 KB Output is correct
21 Correct 705 ms 5268 KB Output is correct
22 Correct 627 ms 5480 KB Output is correct
23 Correct 626 ms 5456 KB Output is correct
24 Correct 659 ms 5276 KB Output is correct
25 Correct 666 ms 5260 KB Output is correct
26 Correct 1194 ms 6204 KB Output is correct
27 Correct 1299 ms 6000 KB Output is correct
28 Correct 1274 ms 6244 KB Output is correct
29 Correct 1139 ms 6196 KB Output is correct
30 Correct 1223 ms 6072 KB Output is correct
31 Correct 1186 ms 6028 KB Output is correct
32 Correct 1228 ms 6036 KB Output is correct
33 Correct 1228 ms 6320 KB Output is correct
34 Correct 1183 ms 6236 KB Output is correct
35 Correct 1261 ms 6236 KB Output is correct
36 Correct 1092 ms 6184 KB Output is correct
37 Correct 1137 ms 6172 KB Output is correct
38 Correct 1098 ms 6168 KB Output is correct
39 Correct 998 ms 6192 KB Output is correct
40 Correct 1020 ms 6204 KB Output is correct
41 Correct 1000 ms 6188 KB Output is correct
42 Correct 959 ms 6164 KB Output is correct
43 Correct 1071 ms 6148 KB Output is correct
44 Correct 978 ms 6152 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 10 ms 856 KB Output is correct
4 Correct 3 ms 608 KB Output is correct
5 Correct 7 ms 600 KB Output is correct
6 Correct 6 ms 604 KB Output is correct
7 Correct 7 ms 600 KB Output is correct
8 Correct 9 ms 604 KB Output is correct
9 Correct 8 ms 736 KB Output is correct
10 Correct 8 ms 604 KB Output is correct
11 Correct 8 ms 812 KB Output is correct
12 Correct 8 ms 740 KB Output is correct
13 Correct 10 ms 600 KB Output is correct
14 Correct 9 ms 604 KB Output is correct
15 Correct 9 ms 604 KB Output is correct
16 Correct 7 ms 600 KB Output is correct
17 Correct 7 ms 608 KB Output is correct
18 Correct 1141 ms 6228 KB Output is correct
19 Correct 1097 ms 6188 KB Output is correct
20 Correct 1120 ms 6184 KB Output is correct
21 Correct 1089 ms 6248 KB Output is correct
22 Correct 1095 ms 6236 KB Output is correct
23 Correct 1173 ms 6228 KB Output is correct
24 Correct 1142 ms 6264 KB Output is correct
25 Correct 1164 ms 6288 KB Output is correct
26 Correct 28 ms 3408 KB Output is correct
27 Correct 582 ms 5072 KB Output is correct
28 Correct 555 ms 5200 KB Output is correct
29 Correct 940 ms 6160 KB Output is correct
30 Correct 1000 ms 6156 KB Output is correct
31 Correct 777 ms 5352 KB Output is correct
32 Correct 243 ms 3924 KB Output is correct
33 Correct 735 ms 5076 KB Output is correct
34 Correct 746 ms 5360 KB Output is correct
35 Correct 26 ms 3444 KB Output is correct
36 Correct 757 ms 5200 KB Output is correct
37 Correct 720 ms 5256 KB Output is correct
38 Correct 705 ms 5268 KB Output is correct
39 Correct 627 ms 5480 KB Output is correct
40 Correct 626 ms 5456 KB Output is correct
41 Correct 659 ms 5276 KB Output is correct
42 Correct 666 ms 5260 KB Output is correct
43 Correct 1543 ms 8440 KB Output is correct
44 Correct 27 ms 3420 KB Output is correct
45 Correct 156 ms 4444 KB Output is correct
46 Correct 109 ms 4456 KB Output is correct
47 Correct 1180 ms 6920 KB Output is correct
48 Correct 1524 ms 8444 KB Output is correct
49 Correct 1199 ms 6900 KB Output is correct
50 Correct 594 ms 6072 KB Output is correct
51 Correct 594 ms 6228 KB Output is correct
52 Correct 602 ms 6188 KB Output is correct
53 Correct 1107 ms 7320 KB Output is correct
54 Correct 1040 ms 7468 KB Output is correct
55 Correct 1074 ms 7248 KB Output is correct
56 Correct 1179 ms 7152 KB Output is correct
57 Correct 1149 ms 7156 KB Output is correct
58 Correct 1560 ms 8368 KB Output is correct
59 Correct 1629 ms 8336 KB Output is correct
60 Correct 1574 ms 8452 KB Output is correct
61 Correct 1579 ms 8440 KB Output is correct
62 Correct 1335 ms 7744 KB Output is correct
63 Correct 1316 ms 7688 KB Output is correct
64 Correct 1667 ms 8360 KB Output is correct
65 Correct 1139 ms 6540 KB Output is correct
66 Correct 1194 ms 6204 KB Output is correct
67 Correct 1299 ms 6000 KB Output is correct
68 Correct 1274 ms 6244 KB Output is correct
69 Correct 1139 ms 6196 KB Output is correct
70 Correct 1223 ms 6072 KB Output is correct
71 Correct 1186 ms 6028 KB Output is correct
72 Correct 1228 ms 6036 KB Output is correct
73 Correct 1228 ms 6320 KB Output is correct
74 Correct 1183 ms 6236 KB Output is correct
75 Correct 1261 ms 6236 KB Output is correct
76 Correct 1092 ms 6184 KB Output is correct
77 Correct 1137 ms 6172 KB Output is correct
78 Correct 1098 ms 6168 KB Output is correct
79 Correct 998 ms 6192 KB Output is correct
80 Correct 1020 ms 6204 KB Output is correct
81 Correct 1000 ms 6188 KB Output is correct
82 Correct 959 ms 6164 KB Output is correct
83 Correct 1071 ms 6148 KB Output is correct
84 Correct 978 ms 6152 KB Output is correct
85 Correct 2822 ms 8540 KB Output is correct
86 Correct 289 ms 4536 KB Output is correct
87 Correct 124 ms 4652 KB Output is correct
88 Correct 1329 ms 6756 KB Output is correct
89 Correct 2608 ms 8292 KB Output is correct
90 Correct 1361 ms 6952 KB Output is correct
91 Correct 1145 ms 6132 KB Output is correct
92 Correct 1167 ms 6244 KB Output is correct
93 Correct 1264 ms 6064 KB Output is correct
94 Correct 2052 ms 7148 KB Output is correct
95 Correct 1897 ms 7292 KB Output is correct
96 Correct 1955 ms 7092 KB Output is correct
97 Correct 1264 ms 6956 KB Output is correct
98 Correct 1327 ms 6700 KB Output is correct
99 Correct 2661 ms 8216 KB Output is correct
100 Correct 2664 ms 8180 KB Output is correct
101 Correct 2699 ms 8300 KB Output is correct
102 Correct 2790 ms 8304 KB Output is correct
103 Correct 2178 ms 7644 KB Output is correct
104 Correct 2203 ms 7604 KB Output is correct
105 Correct 2110 ms 7464 KB Output is correct
106 Correct 1859 ms 7132 KB Output is correct
107 Correct 1917 ms 7592 KB Output is correct
108 Correct 2626 ms 8180 KB Output is correct
109 Correct 1312 ms 6376 KB Output is correct