oj.uz

답안 #947540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947540 2024-03-16T11:00:06 Z kigash 다리 (APIO19_bridges) C++17
100 / 100
 1538 ms 153740 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] = p[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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4960 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 29 ms 11624 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 28 ms 12140 KB Output is correct
6 Correct 21 ms 12368 KB Output is correct
7 Correct 23 ms 12368 KB Output is correct
8 Correct 30 ms 10844 KB Output is correct
9 Correct 36 ms 16720 KB Output is correct
10 Correct 30 ms 11612 KB Output is correct
11 Correct 33 ms 11784 KB Output is correct
12 Correct 36 ms 14020 KB Output is correct
13 Correct 36 ms 12112 KB Output is correct
14 Correct 34 ms 11348 KB Output is correct
15 Correct 36 ms 12116 KB Output is correct
16 Correct 27 ms 14952 KB Output is correct
17 Correct 28 ms 13908 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 809 ms 99488 KB Output is correct
2 Correct 854 ms 98660 KB Output is correct
3 Correct 815 ms 98264 KB Output is correct
4 Correct 847 ms 99040 KB Output is correct
5 Correct 867 ms 98848 KB Output is correct
6 Correct 993 ms 153740 KB Output is correct
7 Correct 1035 ms 149548 KB Output is correct
8 Correct 985 ms 149224 KB Output is correct
9 Correct 27 ms 6156 KB Output is correct
10 Correct 509 ms 121320 KB Output is correct
11 Correct 506 ms 120148 KB Output is correct
12 Correct 690 ms 80336 KB Output is correct
13 Correct 692 ms 75392 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 637 ms 88768 KB Output is correct
2 Correct 417 ms 102700 KB Output is correct
3 Correct 699 ms 115796 KB Output is correct
4 Correct 628 ms 88228 KB Output is correct
5 Correct 35 ms 6376 KB Output is correct
6 Correct 681 ms 108288 KB Output is correct
7 Correct 589 ms 80380 KB Output is correct
8 Correct 558 ms 64180 KB Output is correct
9 Correct 513 ms 55716 KB Output is correct
10 Correct 456 ms 43920 KB Output is correct
11 Correct 476 ms 53460 KB Output is correct
12 Correct 442 ms 43304 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1175 ms 44240 KB Output is correct
2 Correct 26 ms 6572 KB Output is correct
3 Correct 129 ms 9112 KB Output is correct
4 Correct 62 ms 9204 KB Output is correct
5 Correct 562 ms 44032 KB Output is correct
6 Correct 1163 ms 45092 KB Output is correct
7 Correct 557 ms 44640 KB Output is correct
8 Correct 540 ms 42904 KB Output is correct
9 Correct 535 ms 42124 KB Output is correct
10 Correct 552 ms 43524 KB Output is correct
11 Correct 876 ms 44304 KB Output is correct
12 Correct 846 ms 44384 KB Output is correct
13 Correct 906 ms 43920 KB Output is correct
14 Correct 523 ms 44428 KB Output is correct
15 Correct 548 ms 44444 KB Output is correct
16 Correct 1236 ms 45144 KB Output is correct
17 Correct 1215 ms 45380 KB Output is correct
18 Correct 1219 ms 46228 KB Output is correct
19 Correct 1192 ms 45072 KB Output is correct
20 Correct 983 ms 43836 KB Output is correct
21 Correct 1028 ms 43360 KB Output is correct
22 Correct 1148 ms 44572 KB Output is correct
23 Correct 652 ms 42884 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 809 ms 99488 KB Output is correct
2 Correct 854 ms 98660 KB Output is correct
3 Correct 815 ms 98264 KB Output is correct
4 Correct 847 ms 99040 KB Output is correct
5 Correct 867 ms 98848 KB Output is correct
6 Correct 993 ms 153740 KB Output is correct
7 Correct 1035 ms 149548 KB Output is correct
8 Correct 985 ms 149224 KB Output is correct
9 Correct 27 ms 6156 KB Output is correct
10 Correct 509 ms 121320 KB Output is correct
11 Correct 506 ms 120148 KB Output is correct
12 Correct 690 ms 80336 KB Output is correct
13 Correct 692 ms 75392 KB Output is correct
14 Correct 637 ms 88768 KB Output is correct
15 Correct 417 ms 102700 KB Output is correct
16 Correct 699 ms 115796 KB Output is correct
17 Correct 628 ms 88228 KB Output is correct
18 Correct 35 ms 6376 KB Output is correct
19 Correct 681 ms 108288 KB Output is correct
20 Correct 589 ms 80380 KB Output is correct
21 Correct 558 ms 64180 KB Output is correct
22 Correct 513 ms 55716 KB Output is correct
23 Correct 456 ms 43920 KB Output is correct
24 Correct 476 ms 53460 KB Output is correct
25 Correct 442 ms 43304 KB Output is correct
26 Correct 893 ms 99076 KB Output is correct
27 Correct 967 ms 125184 KB Output is correct
28 Correct 933 ms 96388 KB Output is correct
29 Correct 700 ms 60296 KB Output is correct
30 Correct 921 ms 111604 KB Output is correct
31 Correct 944 ms 114456 KB Output is correct
32 Correct 950 ms 114844 KB Output is correct
33 Correct 874 ms 96632 KB Output is correct
34 Correct 870 ms 98424 KB Output is correct
35 Correct 836 ms 98420 KB Output is correct
36 Correct 708 ms 67760 KB Output is correct
37 Correct 698 ms 64988 KB Output is correct
38 Correct 700 ms 64640 KB Output is correct
39 Correct 603 ms 51232 KB Output is correct
40 Correct 615 ms 51880 KB Output is correct
41 Correct 603 ms 48892 KB Output is correct
42 Correct 579 ms 49380 KB Output is correct
43 Correct 584 ms 50140 KB Output is correct
44 Correct 581 ms 47848 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4960 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 29 ms 11624 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 28 ms 12140 KB Output is correct
6 Correct 21 ms 12368 KB Output is correct
7 Correct 23 ms 12368 KB Output is correct
8 Correct 30 ms 10844 KB Output is correct
9 Correct 36 ms 16720 KB Output is correct
10 Correct 30 ms 11612 KB Output is correct
11 Correct 33 ms 11784 KB Output is correct
12 Correct 36 ms 14020 KB Output is correct
13 Correct 36 ms 12112 KB Output is correct
14 Correct 34 ms 11348 KB Output is correct
15 Correct 36 ms 12116 KB Output is correct
16 Correct 27 ms 14952 KB Output is correct
17 Correct 28 ms 13908 KB Output is correct
18 Correct 809 ms 99488 KB Output is correct
19 Correct 854 ms 98660 KB Output is correct
20 Correct 815 ms 98264 KB Output is correct
21 Correct 847 ms 99040 KB Output is correct
22 Correct 867 ms 98848 KB Output is correct
23 Correct 993 ms 153740 KB Output is correct
24 Correct 1035 ms 149548 KB Output is correct
25 Correct 985 ms 149224 KB Output is correct
26 Correct 27 ms 6156 KB Output is correct
27 Correct 509 ms 121320 KB Output is correct
28 Correct 506 ms 120148 KB Output is correct
29 Correct 690 ms 80336 KB Output is correct
30 Correct 692 ms 75392 KB Output is correct
31 Correct 637 ms 88768 KB Output is correct
32 Correct 417 ms 102700 KB Output is correct
33 Correct 699 ms 115796 KB Output is correct
34 Correct 628 ms 88228 KB Output is correct
35 Correct 35 ms 6376 KB Output is correct
36 Correct 681 ms 108288 KB Output is correct
37 Correct 589 ms 80380 KB Output is correct
38 Correct 558 ms 64180 KB Output is correct
39 Correct 513 ms 55716 KB Output is correct
40 Correct 456 ms 43920 KB Output is correct
41 Correct 476 ms 53460 KB Output is correct
42 Correct 442 ms 43304 KB Output is correct
43 Correct 1175 ms 44240 KB Output is correct
44 Correct 26 ms 6572 KB Output is correct
45 Correct 129 ms 9112 KB Output is correct
46 Correct 62 ms 9204 KB Output is correct
47 Correct 562 ms 44032 KB Output is correct
48 Correct 1163 ms 45092 KB Output is correct
49 Correct 557 ms 44640 KB Output is correct
50 Correct 540 ms 42904 KB Output is correct
51 Correct 535 ms 42124 KB Output is correct
52 Correct 552 ms 43524 KB Output is correct
53 Correct 876 ms 44304 KB Output is correct
54 Correct 846 ms 44384 KB Output is correct
55 Correct 906 ms 43920 KB Output is correct
56 Correct 523 ms 44428 KB Output is correct
57 Correct 548 ms 44444 KB Output is correct
58 Correct 1236 ms 45144 KB Output is correct
59 Correct 1215 ms 45380 KB Output is correct
60 Correct 1219 ms 46228 KB Output is correct
61 Correct 1192 ms 45072 KB Output is correct
62 Correct 983 ms 43836 KB Output is correct
63 Correct 1028 ms 43360 KB Output is correct
64 Correct 1148 ms 44572 KB Output is correct
65 Correct 652 ms 42884 KB Output is correct
66 Correct 893 ms 99076 KB Output is correct
67 Correct 967 ms 125184 KB Output is correct
68 Correct 933 ms 96388 KB Output is correct
69 Correct 700 ms 60296 KB Output is correct
70 Correct 921 ms 111604 KB Output is correct
71 Correct 944 ms 114456 KB Output is correct
72 Correct 950 ms 114844 KB Output is correct
73 Correct 874 ms 96632 KB Output is correct
74 Correct 870 ms 98424 KB Output is correct
75 Correct 836 ms 98420 KB Output is correct
76 Correct 708 ms 67760 KB Output is correct
77 Correct 698 ms 64988 KB Output is correct
78 Correct 700 ms 64640 KB Output is correct
79 Correct 603 ms 51232 KB Output is correct
80 Correct 615 ms 51880 KB Output is correct
81 Correct 603 ms 48892 KB Output is correct
82 Correct 579 ms 49380 KB Output is correct
83 Correct 584 ms 50140 KB Output is correct
84 Correct 581 ms 47848 KB Output is correct
85 Correct 1447 ms 102748 KB Output is correct
86 Correct 147 ms 15780 KB Output is correct
87 Correct 81 ms 20036 KB Output is correct
88 Correct 855 ms 112408 KB Output is correct
89 Correct 1470 ms 102592 KB Output is correct
90 Correct 820 ms 120312 KB Output is correct
91 Correct 906 ms 99916 KB Output is correct
92 Correct 864 ms 100844 KB Output is correct
93 Correct 1020 ms 133456 KB Output is correct
94 Correct 1237 ms 100976 KB Output is correct
95 Correct 1182 ms 100236 KB Output is correct
96 Correct 1197 ms 138924 KB Output is correct
97 Correct 665 ms 71472 KB Output is correct
98 Correct 683 ms 70192 KB Output is correct
99 Correct 1450 ms 103804 KB Output is correct
100 Correct 1468 ms 102948 KB Output is correct
101 Correct 1455 ms 100892 KB Output is correct
102 Correct 1538 ms 100852 KB Output is correct
103 Correct 1407 ms 144296 KB Output is correct
104 Correct 1440 ms 143484 KB Output is correct
105 Correct 1144 ms 77984 KB Output is correct
106 Correct 953 ms 60292 KB Output is correct
107 Correct 1122 ms 84212 KB Output is correct
108 Correct 1453 ms 134180 KB Output is correct
109 Correct 946 ms 144468 KB Output is correct