oj.uz

Submission #963937

# Submission time Handle Problem Language Result Execution time Memory
963937 2024-04-16T04:28:03 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 = 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){
    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 12 ms 860 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 9 ms 616 KB Output is correct
8 Correct 9 ms 820 KB Output is correct
9 Correct 7 ms 740 KB Output is correct
10 Correct 8 ms 604 KB Output is correct
11 Correct 8 ms 604 KB Output is correct
12 Correct 9 ms 636 KB Output is correct
13 Correct 10 ms 604 KB Output is correct
14 Correct 9 ms 600 KB Output is correct
15 Correct 9 ms 604 KB Output is correct
16 Correct 9 ms 740 KB Output is correct
17 Correct 7 ms 604 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1652 ms 6488 KB Output is correct
2 Correct 1601 ms 6196 KB Output is correct
3 Correct 1679 ms 6196 KB Output is correct
4 Correct 1588 ms 6288 KB Output is correct
5 Correct 1600 ms 6248 KB Output is correct
6 Correct 1645 ms 6260 KB Output is correct
7 Correct 1691 ms 6268 KB Output is correct
8 Correct 1638 ms 6304 KB Output is correct
9 Correct 30 ms 3552 KB Output is correct
10 Correct 862 ms 5080 KB Output is correct
11 Correct 840 ms 5072 KB Output is correct
12 Correct 1456 ms 6176 KB Output is correct
13 Correct 1537 ms 6168 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1129 ms 5352 KB Output is correct
2 Correct 308 ms 3920 KB Output is correct
3 Correct 1038 ms 5256 KB Output is correct
4 Correct 1064 ms 5368 KB Output is correct
5 Correct 29 ms 3416 KB Output is correct
6 Correct 1076 ms 5252 KB Output is correct
7 Correct 1030 ms 5264 KB Output is correct
8 Correct 1037 ms 5276 KB Output is correct
9 Correct 924 ms 5492 KB Output is correct
10 Correct 947 ms 5272 KB Output is correct
11 Correct 985 ms 5264 KB Output is correct
12 Correct 930 ms 5268 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2423 ms 8436 KB Output is correct
2 Correct 34 ms 3448 KB Output is correct
3 Correct 234 ms 4424 KB Output is correct
4 Correct 191 ms 4544 KB Output is correct
5 Correct 1889 ms 6992 KB Output is correct
6 Correct 2408 ms 8444 KB Output is correct
7 Correct 1806 ms 6896 KB Output is correct
8 Correct 1062 ms 6228 KB Output is correct
9 Correct 1048 ms 6352 KB Output is correct
10 Correct 1070 ms 6188 KB Output is correct
11 Correct 1815 ms 7324 KB Output is correct
12 Correct 1710 ms 7468 KB Output is correct
13 Correct 1901 ms 7200 KB Output is correct
14 Correct 1882 ms 7152 KB Output is correct
15 Correct 1912 ms 7156 KB Output is correct
16 Correct 2491 ms 8372 KB Output is correct
17 Correct 2546 ms 8332 KB Output is correct
18 Correct 2618 ms 8452 KB Output is correct
19 Correct 2557 ms 8444 KB Output is correct
20 Correct 2187 ms 7732 KB Output is correct
21 Correct 2150 ms 7692 KB Output is correct
22 Correct 2562 ms 8356 KB Output is correct
23 Correct 1658 ms 6540 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1652 ms 6488 KB Output is correct
2 Correct 1601 ms 6196 KB Output is correct
3 Correct 1679 ms 6196 KB Output is correct
4 Correct 1588 ms 6288 KB Output is correct
5 Correct 1600 ms 6248 KB Output is correct
6 Correct 1645 ms 6260 KB Output is correct
7 Correct 1691 ms 6268 KB Output is correct
8 Correct 1638 ms 6304 KB Output is correct
9 Correct 30 ms 3552 KB Output is correct
10 Correct 862 ms 5080 KB Output is correct
11 Correct 840 ms 5072 KB Output is correct
12 Correct 1456 ms 6176 KB Output is correct
13 Correct 1537 ms 6168 KB Output is correct
14 Correct 1129 ms 5352 KB Output is correct
15 Correct 308 ms 3920 KB Output is correct
16 Correct 1038 ms 5256 KB Output is correct
17 Correct 1064 ms 5368 KB Output is correct
18 Correct 29 ms 3416 KB Output is correct
19 Correct 1076 ms 5252 KB Output is correct
20 Correct 1030 ms 5264 KB Output is correct
21 Correct 1037 ms 5276 KB Output is correct
22 Correct 924 ms 5492 KB Output is correct
23 Correct 947 ms 5272 KB Output is correct
24 Correct 985 ms 5264 KB Output is correct
25 Correct 930 ms 5268 KB Output is correct
26 Correct 1743 ms 6216 KB Output is correct
27 Correct 1821 ms 6004 KB Output is correct
28 Correct 1775 ms 6240 KB Output is correct
29 Correct 1670 ms 6208 KB Output is correct
30 Correct 1755 ms 6160 KB Output is correct
31 Correct 1734 ms 6224 KB Output is correct
32 Correct 1766 ms 6044 KB Output is correct
33 Correct 1726 ms 6256 KB Output is correct
34 Correct 1723 ms 6248 KB Output is correct
35 Correct 1721 ms 6244 KB Output is correct
36 Correct 1598 ms 6184 KB Output is correct
37 Correct 1642 ms 6168 KB Output is correct
38 Correct 1647 ms 6188 KB Output is correct
39 Correct 1534 ms 6204 KB Output is correct
40 Correct 1490 ms 6212 KB Output is correct
41 Correct 1477 ms 6196 KB Output is correct
42 Correct 1562 ms 6172 KB Output is correct
43 Correct 1521 ms 6152 KB Output is correct
44 Correct 1504 ms 6164 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 12 ms 860 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 8 ms 628 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 9 ms 616 KB Output is correct
8 Correct 9 ms 820 KB Output is correct
9 Correct 7 ms 740 KB Output is correct
10 Correct 8 ms 604 KB Output is correct
11 Correct 8 ms 604 KB Output is correct
12 Correct 9 ms 636 KB Output is correct
13 Correct 10 ms 604 KB Output is correct
14 Correct 9 ms 600 KB Output is correct
15 Correct 9 ms 604 KB Output is correct
16 Correct 9 ms 740 KB Output is correct
17 Correct 7 ms 604 KB Output is correct
18 Correct 1652 ms 6488 KB Output is correct
19 Correct 1601 ms 6196 KB Output is correct
20 Correct 1679 ms 6196 KB Output is correct
21 Correct 1588 ms 6288 KB Output is correct
22 Correct 1600 ms 6248 KB Output is correct
23 Correct 1645 ms 6260 KB Output is correct
24 Correct 1691 ms 6268 KB Output is correct
25 Correct 1638 ms 6304 KB Output is correct
26 Correct 30 ms 3552 KB Output is correct
27 Correct 862 ms 5080 KB Output is correct
28 Correct 840 ms 5072 KB Output is correct
29 Correct 1456 ms 6176 KB Output is correct
30 Correct 1537 ms 6168 KB Output is correct
31 Correct 1129 ms 5352 KB Output is correct
32 Correct 308 ms 3920 KB Output is correct
33 Correct 1038 ms 5256 KB Output is correct
34 Correct 1064 ms 5368 KB Output is correct
35 Correct 29 ms 3416 KB Output is correct
36 Correct 1076 ms 5252 KB Output is correct
37 Correct 1030 ms 5264 KB Output is correct
38 Correct 1037 ms 5276 KB Output is correct
39 Correct 924 ms 5492 KB Output is correct
40 Correct 947 ms 5272 KB Output is correct
41 Correct 985 ms 5264 KB Output is correct
42 Correct 930 ms 5268 KB Output is correct
43 Correct 2423 ms 8436 KB Output is correct
44 Correct 34 ms 3448 KB Output is correct
45 Correct 234 ms 4424 KB Output is correct
46 Correct 191 ms 4544 KB Output is correct
47 Correct 1889 ms 6992 KB Output is correct
48 Correct 2408 ms 8444 KB Output is correct
49 Correct 1806 ms 6896 KB Output is correct
50 Correct 1062 ms 6228 KB Output is correct
51 Correct 1048 ms 6352 KB Output is correct
52 Correct 1070 ms 6188 KB Output is correct
53 Correct 1815 ms 7324 KB Output is correct
54 Correct 1710 ms 7468 KB Output is correct
55 Correct 1901 ms 7200 KB Output is correct
56 Correct 1882 ms 7152 KB Output is correct
57 Correct 1912 ms 7156 KB Output is correct
58 Correct 2491 ms 8372 KB Output is correct
59 Correct 2546 ms 8332 KB Output is correct
60 Correct 2618 ms 8452 KB Output is correct
61 Correct 2557 ms 8444 KB Output is correct
62 Correct 2187 ms 7732 KB Output is correct
63 Correct 2150 ms 7692 KB Output is correct
64 Correct 2562 ms 8356 KB Output is correct
65 Correct 1658 ms 6540 KB Output is correct
66 Correct 1743 ms 6216 KB Output is correct
67 Correct 1821 ms 6004 KB Output is correct
68 Correct 1775 ms 6240 KB Output is correct
69 Correct 1670 ms 6208 KB Output is correct
70 Correct 1755 ms 6160 KB Output is correct
71 Correct 1734 ms 6224 KB Output is correct
72 Correct 1766 ms 6044 KB Output is correct
73 Correct 1726 ms 6256 KB Output is correct
74 Correct 1723 ms 6248 KB Output is correct
75 Correct 1721 ms 6244 KB Output is correct
76 Correct 1598 ms 6184 KB Output is correct
77 Correct 1642 ms 6168 KB Output is correct
78 Correct 1647 ms 6188 KB Output is correct
79 Correct 1534 ms 6204 KB Output is correct
80 Correct 1490 ms 6212 KB Output is correct
81 Correct 1477 ms 6196 KB Output is correct
82 Correct 1562 ms 6172 KB Output is correct
83 Correct 1521 ms 6152 KB Output is correct
84 Correct 1504 ms 6164 KB Output is correct
85 Execution timed out 3009 ms 8068 KB Time limit exceeded
86 Halted 0 ms 0 KB -