oj.uz

Submission #947543

# Submission time Handle Problem Language Result Execution time Memory
947543 2024-03-16T11:22:47 Z kigash Bridges (APIO19_bridges) C++17
100 / 100
 1487 ms 152648 KB 
#include "bits/stdc++.h"
using namespace std;       
 
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
using ll = long long;
using ld = long double;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (ll)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
 
void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
ll binmul(ll a, ll b, ll c) { ll res = 0; while(b) { if(b&1) (res += a) %= c; (a += a) %= c; b >>= 1; } return res; }
ll binpow(ll a, ll b, ll c) { ll res = 1; while(b) { if(b&1) (res *= a) %= c; (a *= a) %= c; b >>= 1; } return res; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll inf = 1e18+7, MX = LLONG_MAX, MN = LLONG_MIN;
const ll mod = 1e9+7, N = 1e5+5;
#define ll int
ll u[N], v[N], w[N], t[N], qx[N], qy[N], ans[N], B = 1000;
ll p[N], sz[N];
vector<ll> dsu, add[N];
 
ll get(ll x) {
    while(p[x]!=x) x = p[x];
    return x;
}
 
void update(ll x, ll y) {
    x = get(x), y = get(y);
    if(x==y) return;
    if(sz[x]>sz[y]) swap(x, y);
    dsu.pb(x);
    sz[y] += sz[x], p[x] = y;
}
 
void rollback(ll s) {
    while(sz(dsu)>s) {
        ll x = dsu.back();
        dsu.pop_back();
        sz[p[x]] -= sz[x], p[x] = x;
    }
}
 
void yesyesyes() {
    ll n, m;
    cin>>n>>m;
    for(ll i=1; i<=m; i++) cin>>u[i]>>v[i]>>w[i];
    ll q;
    cin>>q;
    for(ll i=1; i<=q; i++) cin>>t[i]>>qx[i]>>qy[i];
    for(ll l=1; l<=q; l+=B) {
        ll r = min(q, l+B-1);
        vector<ll> ask, upd, used(m+1);
        for(ll i=1; i<=n; i++) p[i] = i, sz[i] = 1;
        for(ll i=l; i<=r; i++) {
            if(t[i]==1) {
                upd.pb(i);
                used[qx[i]] = 1;
            }
            else ask.pb(i);
        }
        for(ll i=l; i<=r; i++) {
            if(t[i]==1) w[qx[i]] = qy[i];
            else {
                for(auto j: upd) {
                    if(w[qx[j]]>=qy[i]) add[i].pb(qx[j]);
                }
            }
        }
        vector<ll> same;
        for(ll i=1; i<=m; i++) {
            if(!used[i]) same.pb(i);
        }
        sort(all(same), [](ll i, ll j) {
            return w[i]>w[j];
        });
        sort(all(ask), [](ll i, ll j) {
            return qy[i]>qy[j];
        });
        ll j = 0;
        for(ll i=0; i<sz(ask); i++) {
            while(j<sz(same) && w[same[j]]>=qy[ask[i]]) update(u[same[j]], v[same[j]]), j++;
            ll s = sz(dsu);
            for(auto k: add[ask[i]]) update(u[k], v[k]);
            ans[ask[i]] = sz[get(qx[ask[i]])];
            rollback(s);
        }
    }
    for(ll i=1; i<=q; i++) {
        if(t[i]==2) cout<<ans[i]<<"\n"; 
    }
    return;
}
 
signed main(/*Kigash Amir*/) {
    // freopen("");
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll tt = 1;
    // cin>>tt;
    for(ll i=1; i<=tt; i++) {
        yesyesyes();
    }
}

Compilation message

bridges.cpp: In function 'void freopen(std::string)':
bridges.cpp:17:33: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:17:73: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 | void freopen(string s) { freopen((s+".in").c_str(), "r", stdin); freopen((s+".out").c_str(), "w", stdout); }
      |                                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 32 ms 11404 KB Output is correct
4 Correct 4 ms 4700 KB Output is correct
5 Correct 28 ms 12364 KB Output is correct
6 Correct 25 ms 12320 KB Output is correct
7 Correct 23 ms 12372 KB Output is correct
8 Correct 32 ms 10836 KB Output is correct
9 Correct 35 ms 16728 KB Output is correct
10 Correct 32 ms 11612 KB Output is correct
11 Correct 30 ms 11508 KB Output is correct
12 Correct 41 ms 13908 KB Output is correct
13 Correct 34 ms 12116 KB Output is correct
14 Correct 32 ms 11212 KB Output is correct
15 Correct 36 ms 12112 KB Output is correct
16 Correct 27 ms 14932 KB Output is correct
17 Correct 28 ms 13960 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 828 ms 96344 KB Output is correct
2 Correct 823 ms 97228 KB Output is correct
3 Correct 825 ms 97628 KB Output is correct
4 Correct 851 ms 97700 KB Output is correct
5 Correct 879 ms 97652 KB Output is correct
6 Correct 960 ms 152648 KB Output is correct
7 Correct 982 ms 149400 KB Output is correct
8 Correct 997 ms 148236 KB Output is correct
9 Correct 27 ms 5208 KB Output is correct
10 Correct 518 ms 120884 KB Output is correct
11 Correct 510 ms 119988 KB Output is correct
12 Correct 703 ms 81544 KB Output is correct
13 Correct 668 ms 76380 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 649 ms 86552 KB Output is correct
2 Correct 395 ms 102524 KB Output is correct
3 Correct 671 ms 114084 KB Output is correct
4 Correct 616 ms 86364 KB Output is correct
5 Correct 27 ms 5272 KB Output is correct
6 Correct 687 ms 107476 KB Output is correct
7 Correct 603 ms 80008 KB Output is correct
8 Correct 567 ms 64636 KB Output is correct
9 Correct 461 ms 57276 KB Output is correct
10 Correct 432 ms 44372 KB Output is correct
11 Correct 471 ms 52704 KB Output is correct
12 Correct 445 ms 44048 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1190 ms 40460 KB Output is correct
2 Correct 26 ms 5212 KB Output is correct
3 Correct 127 ms 8420 KB Output is correct
4 Correct 57 ms 8448 KB Output is correct
5 Correct 575 ms 41888 KB Output is correct
6 Correct 1188 ms 44616 KB Output is correct
7 Correct 572 ms 42984 KB Output is correct
8 Correct 553 ms 42080 KB Output is correct
9 Correct 548 ms 42756 KB Output is correct
10 Correct 563 ms 41640 KB Output is correct
11 Correct 875 ms 43136 KB Output is correct
12 Correct 848 ms 43812 KB Output is correct
13 Correct 899 ms 43876 KB Output is correct
14 Correct 506 ms 41996 KB Output is correct
15 Correct 537 ms 41968 KB Output is correct
16 Correct 1161 ms 44480 KB Output is correct
17 Correct 1187 ms 44224 KB Output is correct
18 Correct 1192 ms 43332 KB Output is correct
19 Correct 1181 ms 42884 KB Output is correct
20 Correct 985 ms 42164 KB Output is correct
21 Correct 1022 ms 42220 KB Output is correct
22 Correct 1150 ms 42976 KB Output is correct
23 Correct 657 ms 41704 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 828 ms 96344 KB Output is correct
2 Correct 823 ms 97228 KB Output is correct
3 Correct 825 ms 97628 KB Output is correct
4 Correct 851 ms 97700 KB Output is correct
5 Correct 879 ms 97652 KB Output is correct
6 Correct 960 ms 152648 KB Output is correct
7 Correct 982 ms 149400 KB Output is correct
8 Correct 997 ms 148236 KB Output is correct
9 Correct 27 ms 5208 KB Output is correct
10 Correct 518 ms 120884 KB Output is correct
11 Correct 510 ms 119988 KB Output is correct
12 Correct 703 ms 81544 KB Output is correct
13 Correct 668 ms 76380 KB Output is correct
14 Correct 649 ms 86552 KB Output is correct
15 Correct 395 ms 102524 KB Output is correct
16 Correct 671 ms 114084 KB Output is correct
17 Correct 616 ms 86364 KB Output is correct
18 Correct 27 ms 5272 KB Output is correct
19 Correct 687 ms 107476 KB Output is correct
20 Correct 603 ms 80008 KB Output is correct
21 Correct 567 ms 64636 KB Output is correct
22 Correct 461 ms 57276 KB Output is correct
23 Correct 432 ms 44372 KB Output is correct
24 Correct 471 ms 52704 KB Output is correct
25 Correct 445 ms 44048 KB Output is correct
26 Correct 830 ms 98628 KB Output is correct
27 Correct 902 ms 125652 KB Output is correct
28 Correct 865 ms 96728 KB Output is correct
29 Correct 691 ms 60552 KB Output is correct
30 Correct 943 ms 111504 KB Output is correct
31 Correct 946 ms 114716 KB Output is correct
32 Correct 943 ms 114512 KB Output is correct
33 Correct 860 ms 98580 KB Output is correct
34 Correct 861 ms 98332 KB Output is correct
35 Correct 868 ms 97624 KB Output is correct
36 Correct 723 ms 66392 KB Output is correct
37 Correct 719 ms 65520 KB Output is correct
38 Correct 694 ms 64832 KB Output is correct
39 Correct 624 ms 52568 KB Output is correct
40 Correct 609 ms 50756 KB Output is correct
41 Correct 609 ms 51900 KB Output is correct
42 Correct 585 ms 52060 KB Output is correct
43 Correct 601 ms 51796 KB Output is correct
44 Correct 611 ms 50460 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 32 ms 11404 KB Output is correct
4 Correct 4 ms 4700 KB Output is correct
5 Correct 28 ms 12364 KB Output is correct
6 Correct 25 ms 12320 KB Output is correct
7 Correct 23 ms 12372 KB Output is correct
8 Correct 32 ms 10836 KB Output is correct
9 Correct 35 ms 16728 KB Output is correct
10 Correct 32 ms 11612 KB Output is correct
11 Correct 30 ms 11508 KB Output is correct
12 Correct 41 ms 13908 KB Output is correct
13 Correct 34 ms 12116 KB Output is correct
14 Correct 32 ms 11212 KB Output is correct
15 Correct 36 ms 12112 KB Output is correct
16 Correct 27 ms 14932 KB Output is correct
17 Correct 28 ms 13960 KB Output is correct
18 Correct 828 ms 96344 KB Output is correct
19 Correct 823 ms 97228 KB Output is correct
20 Correct 825 ms 97628 KB Output is correct
21 Correct 851 ms 97700 KB Output is correct
22 Correct 879 ms 97652 KB Output is correct
23 Correct 960 ms 152648 KB Output is correct
24 Correct 982 ms 149400 KB Output is correct
25 Correct 997 ms 148236 KB Output is correct
26 Correct 27 ms 5208 KB Output is correct
27 Correct 518 ms 120884 KB Output is correct
28 Correct 510 ms 119988 KB Output is correct
29 Correct 703 ms 81544 KB Output is correct
30 Correct 668 ms 76380 KB Output is correct
31 Correct 649 ms 86552 KB Output is correct
32 Correct 395 ms 102524 KB Output is correct
33 Correct 671 ms 114084 KB Output is correct
34 Correct 616 ms 86364 KB Output is correct
35 Correct 27 ms 5272 KB Output is correct
36 Correct 687 ms 107476 KB Output is correct
37 Correct 603 ms 80008 KB Output is correct
38 Correct 567 ms 64636 KB Output is correct
39 Correct 461 ms 57276 KB Output is correct
40 Correct 432 ms 44372 KB Output is correct
41 Correct 471 ms 52704 KB Output is correct
42 Correct 445 ms 44048 KB Output is correct
43 Correct 1190 ms 40460 KB Output is correct
44 Correct 26 ms 5212 KB Output is correct
45 Correct 127 ms 8420 KB Output is correct
46 Correct 57 ms 8448 KB Output is correct
47 Correct 575 ms 41888 KB Output is correct
48 Correct 1188 ms 44616 KB Output is correct
49 Correct 572 ms 42984 KB Output is correct
50 Correct 553 ms 42080 KB Output is correct
51 Correct 548 ms 42756 KB Output is correct
52 Correct 563 ms 41640 KB Output is correct
53 Correct 875 ms 43136 KB Output is correct
54 Correct 848 ms 43812 KB Output is correct
55 Correct 899 ms 43876 KB Output is correct
56 Correct 506 ms 41996 KB Output is correct
57 Correct 537 ms 41968 KB Output is correct
58 Correct 1161 ms 44480 KB Output is correct
59 Correct 1187 ms 44224 KB Output is correct
60 Correct 1192 ms 43332 KB Output is correct
61 Correct 1181 ms 42884 KB Output is correct
62 Correct 985 ms 42164 KB Output is correct
63 Correct 1022 ms 42220 KB Output is correct
64 Correct 1150 ms 42976 KB Output is correct
65 Correct 657 ms 41704 KB Output is correct
66 Correct 830 ms 98628 KB Output is correct
67 Correct 902 ms 125652 KB Output is correct
68 Correct 865 ms 96728 KB Output is correct
69 Correct 691 ms 60552 KB Output is correct
70 Correct 943 ms 111504 KB Output is correct
71 Correct 946 ms 114716 KB Output is correct
72 Correct 943 ms 114512 KB Output is correct
73 Correct 860 ms 98580 KB Output is correct
74 Correct 861 ms 98332 KB Output is correct
75 Correct 868 ms 97624 KB Output is correct
76 Correct 723 ms 66392 KB Output is correct
77 Correct 719 ms 65520 KB Output is correct
78 Correct 694 ms 64832 KB Output is correct
79 Correct 624 ms 52568 KB Output is correct
80 Correct 609 ms 50756 KB Output is correct
81 Correct 609 ms 51900 KB Output is correct
82 Correct 585 ms 52060 KB Output is correct
83 Correct 601 ms 51796 KB Output is correct
84 Correct 611 ms 50460 KB Output is correct
85 Correct 1463 ms 101392 KB Output is correct
86 Correct 153 ms 15008 KB Output is correct
87 Correct 82 ms 19364 KB Output is correct
88 Correct 797 ms 110716 KB Output is correct
89 Correct 1457 ms 99072 KB Output is correct
90 Correct 807 ms 119476 KB Output is correct
91 Correct 901 ms 98896 KB Output is correct
92 Correct 843 ms 99424 KB Output is correct
93 Correct 952 ms 133232 KB Output is correct
94 Correct 1191 ms 98716 KB Output is correct
95 Correct 1165 ms 98180 KB Output is correct
96 Correct 1201 ms 136588 KB Output is correct
97 Correct 727 ms 71728 KB Output is correct
98 Correct 686 ms 69492 KB Output is correct
99 Correct 1477 ms 102208 KB Output is correct
100 Correct 1487 ms 100576 KB Output is correct
101 Correct 1482 ms 98644 KB Output is correct
102 Correct 1481 ms 99368 KB Output is correct
103 Correct 1359 ms 142724 KB Output is correct
104 Correct 1350 ms 143128 KB Output is correct
105 Correct 1142 ms 77748 KB Output is correct
106 Correct 954 ms 59920 KB Output is correct
107 Correct 1148 ms 82964 KB Output is correct
108 Correct 1422 ms 132804 KB Output is correct
109 Correct 899 ms 142164 KB Output is correct