oj.uz

Submission #963941

# Submission time Handle Problem Language Result Execution time Memory
963941 2024-04-16T04:33:26 Z oblantis Bridges (APIO19_bridges) C++17
73 / 100
 3000 ms 8452 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 = 400;
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){
    if(p[x] == x)return x;
    return fnd(p[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<pii> 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, V});
                        }
                    }
                }
                out[it] = sz[fnd(a[it])];
                while(!rlx.empty()){
                    pii j = rlx.top();
                    p[j.ff] = j.ff;
                    sz[j.ss] -= sz[j.ff];
                    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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 860 KB Output is correct
4 Correct 5 ms 608 KB Output is correct
5 Correct 8 ms 804 KB Output is correct
6 Correct 10 ms 600 KB Output is correct
7 Correct 8 ms 604 KB Output is correct
8 Correct 11 ms 824 KB Output is correct
9 Correct 8 ms 604 KB Output is correct
10 Correct 9 ms 604 KB Output is correct
11 Correct 9 ms 604 KB Output is correct
12 Correct 10 ms 600 KB Output is correct
13 Correct 11 ms 808 KB Output is correct
14 Correct 13 ms 604 KB Output is correct
15 Correct 10 ms 600 KB Output is correct
16 Correct 9 ms 604 KB Output is correct
17 Correct 11 ms 604 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1377 ms 4992 KB Output is correct
2 Correct 1312 ms 4992 KB Output is correct
3 Correct 1348 ms 4988 KB Output is correct
4 Correct 1344 ms 4988 KB Output is correct
5 Correct 1336 ms 4984 KB Output is correct
6 Correct 1413 ms 5240 KB Output is correct
7 Correct 1407 ms 5244 KB Output is correct
8 Correct 1390 ms 5244 KB Output is correct
9 Correct 29 ms 3184 KB Output is correct
10 Correct 783 ms 4480 KB Output is correct
11 Correct 715 ms 4476 KB Output is correct
12 Correct 1201 ms 5248 KB Output is correct
13 Correct 1200 ms 5240 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 939 ms 4500 KB Output is correct
2 Correct 307 ms 3412 KB Output is correct
3 Correct 929 ms 4248 KB Output is correct
4 Correct 914 ms 4508 KB Output is correct
5 Correct 28 ms 3156 KB Output is correct
6 Correct 940 ms 4248 KB Output is correct
7 Correct 851 ms 4248 KB Output is correct
8 Correct 843 ms 4368 KB Output is correct
9 Correct 813 ms 4500 KB Output is correct
10 Correct 768 ms 4436 KB Output is correct
11 Correct 768 ms 4252 KB Output is correct
12 Correct 752 ms 4256 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1875 ms 6668 KB Output is correct
2 Correct 32 ms 3660 KB Output is correct
3 Correct 195 ms 4428 KB Output is correct
4 Correct 142 ms 4544 KB Output is correct
5 Correct 1496 ms 6916 KB Output is correct
6 Correct 1920 ms 8452 KB Output is correct
7 Correct 1445 ms 6900 KB Output is correct
8 Correct 878 ms 6072 KB Output is correct
9 Correct 853 ms 6192 KB Output is correct
10 Correct 821 ms 6188 KB Output is correct
11 Correct 1402 ms 7316 KB Output is correct
12 Correct 1322 ms 7472 KB Output is correct
13 Correct 1358 ms 7404 KB Output is correct
14 Correct 1461 ms 7164 KB Output is correct
15 Correct 1398 ms 7160 KB Output is correct
16 Correct 1984 ms 8204 KB Output is correct
17 Correct 1985 ms 8200 KB Output is correct
18 Correct 1983 ms 8208 KB Output is correct
19 Correct 2001 ms 8204 KB Output is correct
20 Correct 1663 ms 7728 KB Output is correct
21 Correct 1721 ms 7692 KB Output is correct
22 Correct 1916 ms 8352 KB Output is correct
23 Correct 1273 ms 6536 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1377 ms 4992 KB Output is correct
2 Correct 1312 ms 4992 KB Output is correct
3 Correct 1348 ms 4988 KB Output is correct
4 Correct 1344 ms 4988 KB Output is correct
5 Correct 1336 ms 4984 KB Output is correct
6 Correct 1413 ms 5240 KB Output is correct
7 Correct 1407 ms 5244 KB Output is correct
8 Correct 1390 ms 5244 KB Output is correct
9 Correct 29 ms 3184 KB Output is correct
10 Correct 783 ms 4480 KB Output is correct
11 Correct 715 ms 4476 KB Output is correct
12 Correct 1201 ms 5248 KB Output is correct
13 Correct 1200 ms 5240 KB Output is correct
14 Correct 939 ms 4500 KB Output is correct
15 Correct 307 ms 3412 KB Output is correct
16 Correct 929 ms 4248 KB Output is correct
17 Correct 914 ms 4508 KB Output is correct
18 Correct 28 ms 3156 KB Output is correct
19 Correct 940 ms 4248 KB Output is correct
20 Correct 851 ms 4248 KB Output is correct
21 Correct 843 ms 4368 KB Output is correct
22 Correct 813 ms 4500 KB Output is correct
23 Correct 768 ms 4436 KB Output is correct
24 Correct 768 ms 4252 KB Output is correct
25 Correct 752 ms 4256 KB Output is correct
26 Correct 1385 ms 5280 KB Output is correct
27 Correct 1474 ms 5232 KB Output is correct
28 Correct 1424 ms 5220 KB Output is correct
29 Correct 1340 ms 5172 KB Output is correct
30 Correct 1435 ms 5044 KB Output is correct
31 Correct 1393 ms 5008 KB Output is correct
32 Correct 1412 ms 5016 KB Output is correct
33 Correct 1417 ms 5212 KB Output is correct
34 Correct 1405 ms 5212 KB Output is correct
35 Correct 1383 ms 5204 KB Output is correct
36 Correct 1373 ms 5156 KB Output is correct
37 Correct 1332 ms 5168 KB Output is correct
38 Correct 1328 ms 5144 KB Output is correct
39 Correct 1250 ms 5168 KB Output is correct
40 Correct 1204 ms 5168 KB Output is correct
41 Correct 1294 ms 5164 KB Output is correct
42 Correct 1202 ms 5144 KB Output is correct
43 Correct 1163 ms 5128 KB Output is correct
44 Correct 1258 ms 5132 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 860 KB Output is correct
4 Correct 5 ms 608 KB Output is correct
5 Correct 8 ms 804 KB Output is correct
6 Correct 10 ms 600 KB Output is correct
7 Correct 8 ms 604 KB Output is correct
8 Correct 11 ms 824 KB Output is correct
9 Correct 8 ms 604 KB Output is correct
10 Correct 9 ms 604 KB Output is correct
11 Correct 9 ms 604 KB Output is correct
12 Correct 10 ms 600 KB Output is correct
13 Correct 11 ms 808 KB Output is correct
14 Correct 13 ms 604 KB Output is correct
15 Correct 10 ms 600 KB Output is correct
16 Correct 9 ms 604 KB Output is correct
17 Correct 11 ms 604 KB Output is correct
18 Correct 1377 ms 4992 KB Output is correct
19 Correct 1312 ms 4992 KB Output is correct
20 Correct 1348 ms 4988 KB Output is correct
21 Correct 1344 ms 4988 KB Output is correct
22 Correct 1336 ms 4984 KB Output is correct
23 Correct 1413 ms 5240 KB Output is correct
24 Correct 1407 ms 5244 KB Output is correct
25 Correct 1390 ms 5244 KB Output is correct
26 Correct 29 ms 3184 KB Output is correct
27 Correct 783 ms 4480 KB Output is correct
28 Correct 715 ms 4476 KB Output is correct
29 Correct 1201 ms 5248 KB Output is correct
30 Correct 1200 ms 5240 KB Output is correct
31 Correct 939 ms 4500 KB Output is correct
32 Correct 307 ms 3412 KB Output is correct
33 Correct 929 ms 4248 KB Output is correct
34 Correct 914 ms 4508 KB Output is correct
35 Correct 28 ms 3156 KB Output is correct
36 Correct 940 ms 4248 KB Output is correct
37 Correct 851 ms 4248 KB Output is correct
38 Correct 843 ms 4368 KB Output is correct
39 Correct 813 ms 4500 KB Output is correct
40 Correct 768 ms 4436 KB Output is correct
41 Correct 768 ms 4252 KB Output is correct
42 Correct 752 ms 4256 KB Output is correct
43 Correct 1875 ms 6668 KB Output is correct
44 Correct 32 ms 3660 KB Output is correct
45 Correct 195 ms 4428 KB Output is correct
46 Correct 142 ms 4544 KB Output is correct
47 Correct 1496 ms 6916 KB Output is correct
48 Correct 1920 ms 8452 KB Output is correct
49 Correct 1445 ms 6900 KB Output is correct
50 Correct 878 ms 6072 KB Output is correct
51 Correct 853 ms 6192 KB Output is correct
52 Correct 821 ms 6188 KB Output is correct
53 Correct 1402 ms 7316 KB Output is correct
54 Correct 1322 ms 7472 KB Output is correct
55 Correct 1358 ms 7404 KB Output is correct
56 Correct 1461 ms 7164 KB Output is correct
57 Correct 1398 ms 7160 KB Output is correct
58 Correct 1984 ms 8204 KB Output is correct
59 Correct 1985 ms 8200 KB Output is correct
60 Correct 1983 ms 8208 KB Output is correct
61 Correct 2001 ms 8204 KB Output is correct
62 Correct 1663 ms 7728 KB Output is correct
63 Correct 1721 ms 7692 KB Output is correct
64 Correct 1916 ms 8352 KB Output is correct
65 Correct 1273 ms 6536 KB Output is correct
66 Correct 1385 ms 5280 KB Output is correct
67 Correct 1474 ms 5232 KB Output is correct
68 Correct 1424 ms 5220 KB Output is correct
69 Correct 1340 ms 5172 KB Output is correct
70 Correct 1435 ms 5044 KB Output is correct
71 Correct 1393 ms 5008 KB Output is correct
72 Correct 1412 ms 5016 KB Output is correct
73 Correct 1417 ms 5212 KB Output is correct
74 Correct 1405 ms 5212 KB Output is correct
75 Correct 1383 ms 5204 KB Output is correct
76 Correct 1373 ms 5156 KB Output is correct
77 Correct 1332 ms 5168 KB Output is correct
78 Correct 1328 ms 5144 KB Output is correct
79 Correct 1250 ms 5168 KB Output is correct
80 Correct 1204 ms 5168 KB Output is correct
81 Correct 1294 ms 5164 KB Output is correct
82 Correct 1202 ms 5144 KB Output is correct
83 Correct 1163 ms 5128 KB Output is correct
84 Correct 1258 ms 5132 KB Output is correct
85 Execution timed out 3044 ms 8020 KB Time limit exceeded
86 Halted 0 ms 0 KB -