oj.uz

Submission #963940

# Submission time Handle Problem Language Result Execution time Memory
963940 2024-04-16T04:31:34 Z oblantis Bridges (APIO19_bridges) C++17
59 / 100
 3000 ms 8068 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 = 220;
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 0 ms 348 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 10 ms 852 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 7 ms 604 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 8 ms 600 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 8 ms 604 KB Output is correct
11 Correct 8 ms 600 KB Output is correct
12 Correct 8 ms 808 KB Output is correct
13 Correct 9 ms 860 KB Output is correct
14 Correct 8 ms 604 KB Output is correct
15 Correct 11 ms 728 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 6 ms 740 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2244 ms 6232 KB Output is correct
2 Correct 2221 ms 6184 KB Output is correct
3 Correct 2227 ms 6188 KB Output is correct
4 Correct 2285 ms 6240 KB Output is correct
5 Correct 2213 ms 6244 KB Output is correct
6 Correct 2295 ms 6256 KB Output is correct
7 Correct 2266 ms 6264 KB Output is correct
8 Correct 2176 ms 6292 KB Output is correct
9 Correct 28 ms 3412 KB Output is correct
10 Correct 1155 ms 5076 KB Output is correct
11 Correct 1150 ms 5204 KB Output is correct
12 Correct 1939 ms 6164 KB Output is correct
13 Correct 2128 ms 6156 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1484 ms 5348 KB Output is correct
2 Correct 357 ms 3820 KB Output is correct
3 Correct 1424 ms 5080 KB Output is correct
4 Correct 1401 ms 5384 KB Output is correct
5 Correct 31 ms 3420 KB Output is correct
6 Correct 1451 ms 5240 KB Output is correct
7 Correct 1417 ms 5252 KB Output is correct
8 Correct 1367 ms 5268 KB Output is correct
9 Correct 1254 ms 5488 KB Output is correct
10 Correct 1270 ms 5512 KB Output is correct
11 Correct 1368 ms 5252 KB Output is correct
12 Correct 1284 ms 5200 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3043 ms 8068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2244 ms 6232 KB Output is correct
2 Correct 2221 ms 6184 KB Output is correct
3 Correct 2227 ms 6188 KB Output is correct
4 Correct 2285 ms 6240 KB Output is correct
5 Correct 2213 ms 6244 KB Output is correct
6 Correct 2295 ms 6256 KB Output is correct
7 Correct 2266 ms 6264 KB Output is correct
8 Correct 2176 ms 6292 KB Output is correct
9 Correct 28 ms 3412 KB Output is correct
10 Correct 1155 ms 5076 KB Output is correct
11 Correct 1150 ms 5204 KB Output is correct
12 Correct 1939 ms 6164 KB Output is correct
13 Correct 2128 ms 6156 KB Output is correct
14 Correct 1484 ms 5348 KB Output is correct
15 Correct 357 ms 3820 KB Output is correct
16 Correct 1424 ms 5080 KB Output is correct
17 Correct 1401 ms 5384 KB Output is correct
18 Correct 31 ms 3420 KB Output is correct
19 Correct 1451 ms 5240 KB Output is correct
20 Correct 1417 ms 5252 KB Output is correct
21 Correct 1367 ms 5268 KB Output is correct
22 Correct 1254 ms 5488 KB Output is correct
23 Correct 1270 ms 5512 KB Output is correct
24 Correct 1368 ms 5252 KB Output is correct
25 Correct 1284 ms 5200 KB Output is correct
26 Correct 2281 ms 5760 KB Output is correct
27 Correct 2346 ms 5756 KB Output is correct
28 Correct 2323 ms 5756 KB Output is correct
29 Correct 2285 ms 5756 KB Output is correct
30 Correct 2348 ms 5756 KB Output is correct
31 Correct 2314 ms 5760 KB Output is correct
32 Correct 2359 ms 5760 KB Output is correct
33 Correct 2299 ms 5756 KB Output is correct
34 Correct 2316 ms 5756 KB Output is correct
35 Correct 2365 ms 5752 KB Output is correct
36 Correct 2253 ms 5752 KB Output is correct
37 Correct 2316 ms 5756 KB Output is correct
38 Correct 2340 ms 5756 KB Output is correct
39 Correct 2031 ms 5760 KB Output is correct
40 Correct 2016 ms 5752 KB Output is correct
41 Correct 2107 ms 5756 KB Output is correct
42 Correct 2049 ms 5852 KB Output is correct
43 Correct 2064 ms 5752 KB Output is correct
44 Correct 2082 ms 5760 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 472 KB Output is correct
3 Correct 10 ms 852 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 7 ms 604 KB Output is correct
6 Correct 7 ms 604 KB Output is correct
7 Correct 8 ms 600 KB Output is correct
8 Correct 8 ms 600 KB Output is correct
9 Correct 6 ms 604 KB Output is correct
10 Correct 8 ms 604 KB Output is correct
11 Correct 8 ms 600 KB Output is correct
12 Correct 8 ms 808 KB Output is correct
13 Correct 9 ms 860 KB Output is correct
14 Correct 8 ms 604 KB Output is correct
15 Correct 11 ms 728 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 6 ms 740 KB Output is correct
18 Correct 2244 ms 6232 KB Output is correct
19 Correct 2221 ms 6184 KB Output is correct
20 Correct 2227 ms 6188 KB Output is correct
21 Correct 2285 ms 6240 KB Output is correct
22 Correct 2213 ms 6244 KB Output is correct
23 Correct 2295 ms 6256 KB Output is correct
24 Correct 2266 ms 6264 KB Output is correct
25 Correct 2176 ms 6292 KB Output is correct
26 Correct 28 ms 3412 KB Output is correct
27 Correct 1155 ms 5076 KB Output is correct
28 Correct 1150 ms 5204 KB Output is correct
29 Correct 1939 ms 6164 KB Output is correct
30 Correct 2128 ms 6156 KB Output is correct
31 Correct 1484 ms 5348 KB Output is correct
32 Correct 357 ms 3820 KB Output is correct
33 Correct 1424 ms 5080 KB Output is correct
34 Correct 1401 ms 5384 KB Output is correct
35 Correct 31 ms 3420 KB Output is correct
36 Correct 1451 ms 5240 KB Output is correct
37 Correct 1417 ms 5252 KB Output is correct
38 Correct 1367 ms 5268 KB Output is correct
39 Correct 1254 ms 5488 KB Output is correct
40 Correct 1270 ms 5512 KB Output is correct
41 Correct 1368 ms 5252 KB Output is correct
42 Correct 1284 ms 5200 KB Output is correct
43 Execution timed out 3043 ms 8068 KB Time limit exceeded
44 Halted 0 ms 0 KB -