oj.uz

Submission #953028

# Submission time Handle Problem Language Result Execution time Memory
953028 2024-03-25T10:29:31 Z Vladth11 Bridges (APIO19_bridges) C++14
100 / 100
 2807 ms 13084 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
#pragma GCC optimize("Ofast") 
 
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
 
const ll NMAX = 50001;
const int INF = 1e9;
const ll nrbits = 20;
const ll MOD = 998244353;
const int BLOCK = 770;
 
int n;
 
class DSU{
public:
    int pa[NMAX * 5], sz[NMAX * 5];
    int cnt;
    struct save_dsu{
        int ra, rb, pa, pb, sza, szb;
    };
    stack <save_dsu> st;
    void init(){
        while(st.size())
            st.pop();
        cnt = n;
        for(int i = 1; i <= n; i++){
            pa[i] = i;
            sz[i] = 1;
        }
    }
    void del(){
        cnt--;
    }
    int add(){
        ++cnt;
        pa[cnt] = cnt;
        sz[cnt] = 1;
        return cnt;
    }
    int root(int a){
        if(pa[a] == a)
            return a;
        return root(pa[a]); /// hai ca vad
    }
    void merge(int a, int b){
        int ra = root(a);
        int rb = root(b);
        st.push((save_dsu){ra, rb, pa[ra], pa[rb], sz[ra], sz[rb]});
        if(ra == rb)
            return;
        if(sz[ra] < sz[rb])
            swap(ra, rb);
        pa[rb] = ra;
        sz[ra] += sz[rb];
    }
    void rollback(){
        save_dsu x = st.top();
        st.pop();
        int ra = x.ra;
        int rb = x.rb;
        pa[ra] = x.ra;
        pa[rb] = x.rb;
        sz[ra] = x.sza;
        sz[rb] = x.szb;
    }
    int szComp(int a){
        return sz[root(a)];
    }
}dsu;
 
struct edge{
    int a, b, c;
}edges[NMAX * 2], query[NMAX * 2];
 
int banned[NMAX * 2];
 
vector <pii> events;
 
bool cmp(pii a, pii b){
    int prim = 0;
    int sec = 0;
    if(a.second == 0){
        prim = query[a.first].c;
    }else{
        prim = edges[a.first].c;
    }
    if(b.second == 0){
        sec = query[b.first].c;
    }else{
        sec = edges[b.first].c;
    }
    if(prim != sec)
        return prim > sec;
    return a.second > b.second;
}
 
int f[NMAX * 2];
int sol[NMAX * 2];
 
signed main() {
#ifdef HOME
    ifstream cin(".in");
    ofstream cout(".out");
#endif // HOME
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int m, i, q;
    cin >> n >> m;
    for(i = 1; i <= m; i++){
        cin >> edges[i].a >> edges[i].b >> edges[i].c;
        f[i] = -1;
    }
    cin >> q;
    for(i = 0; i < q; i++){
        cin >> query[i].a >> query[i].b >> query[i].c;
    }
    for(i = 0; i < q; i += BLOCK){
        dsu.init();
        events.clear();
        for(int j = i; j < min(q, i + BLOCK); j++){
            if(query[j].a == 1)
                banned[query[j].b] = 1;
            else
                events.push_back({j, 0});
        }
        for(int i = 1; i <= m; i++){
            if(!banned[i]){
                events.push_back({i, 1});
            }
        }
        sort(events.begin(), events.end(), cmp);
        for(auto x : events){
            if(x.second == 1){
                dsu.merge(edges[x.first].a, edges[x.first].b);
            }else{
                int cc = 0;
                for(int j = x.first - 1; j >= i; j--){
                    if(query[j].a == 1 && f[query[j].b] != x.first){
                        if(query[j].c >= query[x.first].c){
                            cc++;
                            dsu.merge(edges[query[j].b].a, edges[query[j].b].b);
                        }
                        f[query[j].b] = x.first;
                    }
                }
                for(int j = x.first + 1; j < min(q, i + BLOCK); j++){
                    if(query[j].a == 1 && f[query[j].b] != x.first){
                        if(edges[query[j].b].c >= query[x.first].c){ /// diferenta
                            cc++;
                            dsu.merge(edges[query[j].b].a, edges[query[j].b].b);
                        }
                        f[query[j].b] = x.first;
                    }
                }
                sol[x.first] = dsu.szComp(query[x.first].b);
                while(cc--){
                    dsu.rollback();
                }
            }
        }
        for(int j = i; j < min(q, i + BLOCK); j++){
            if(query[j].a == 1){
                banned[query[j].b] = 0;
                edges[query[j].b].c = query[j].c;
            }
        }
    }
    for(i = 0; i < q; i++){
        if(query[i].a == 2)
            cout << sol[i] << "\n";
    }
    return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 25 ms 4640 KB Output is correct
4 Correct 9 ms 4440 KB Output is correct
5 Correct 19 ms 4444 KB Output is correct
6 Correct 16 ms 4444 KB Output is correct
7 Correct 19 ms 4444 KB Output is correct
8 Correct 16 ms 4444 KB Output is correct
9 Correct 14 ms 4444 KB Output is correct
10 Correct 17 ms 4444 KB Output is correct
11 Correct 16 ms 4636 KB Output is correct
12 Correct 21 ms 4444 KB Output is correct
13 Correct 21 ms 4612 KB Output is correct
14 Correct 20 ms 4444 KB Output is correct
15 Correct 18 ms 4444 KB Output is correct
16 Correct 16 ms 4444 KB Output is correct
17 Correct 15 ms 4440 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1371 ms 6940 KB Output is correct
2 Correct 1390 ms 6948 KB Output is correct
3 Correct 1424 ms 6816 KB Output is correct
4 Correct 1407 ms 6856 KB Output is correct
5 Correct 1504 ms 7164 KB Output is correct
6 Correct 1668 ms 7440 KB Output is correct
7 Correct 1789 ms 7196 KB Output is correct
8 Correct 1703 ms 7200 KB Output is correct
9 Correct 79 ms 4876 KB Output is correct
10 Correct 859 ms 6956 KB Output is correct
11 Correct 873 ms 6944 KB Output is correct
12 Correct 1325 ms 7432 KB Output is correct
13 Correct 1392 ms 7228 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1016 ms 6428 KB Output is correct
2 Correct 455 ms 5140 KB Output is correct
3 Correct 988 ms 6180 KB Output is correct
4 Correct 954 ms 6352 KB Output is correct
5 Correct 79 ms 4944 KB Output is correct
6 Correct 997 ms 6352 KB Output is correct
7 Correct 900 ms 6356 KB Output is correct
8 Correct 891 ms 6488 KB Output is correct
9 Correct 826 ms 6352 KB Output is correct
10 Correct 818 ms 6196 KB Output is correct
11 Correct 779 ms 6480 KB Output is correct
12 Correct 768 ms 6160 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2504 ms 9148 KB Output is correct
2 Correct 78 ms 4752 KB Output is correct
3 Correct 256 ms 8392 KB Output is correct
4 Correct 142 ms 8392 KB Output is correct
5 Correct 1463 ms 9192 KB Output is correct
6 Correct 2538 ms 9208 KB Output is correct
7 Correct 1497 ms 9196 KB Output is correct
8 Correct 1162 ms 7144 KB Output is correct
9 Correct 1174 ms 6964 KB Output is correct
10 Correct 1202 ms 7144 KB Output is correct
11 Correct 1869 ms 8680 KB Output is correct
12 Correct 1848 ms 8196 KB Output is correct
13 Correct 1850 ms 8204 KB Output is correct
14 Correct 1276 ms 9452 KB Output is correct
15 Correct 1405 ms 9360 KB Output is correct
16 Correct 2579 ms 9084 KB Output is correct
17 Correct 2574 ms 9364 KB Output is correct
18 Correct 2501 ms 9172 KB Output is correct
19 Correct 2502 ms 9316 KB Output is correct
20 Correct 2129 ms 9176 KB Output is correct
21 Correct 2133 ms 8864 KB Output is correct
22 Correct 2415 ms 9256 KB Output is correct
23 Correct 1483 ms 8732 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1371 ms 6940 KB Output is correct
2 Correct 1390 ms 6948 KB Output is correct
3 Correct 1424 ms 6816 KB Output is correct
4 Correct 1407 ms 6856 KB Output is correct
5 Correct 1504 ms 7164 KB Output is correct
6 Correct 1668 ms 7440 KB Output is correct
7 Correct 1789 ms 7196 KB Output is correct
8 Correct 1703 ms 7200 KB Output is correct
9 Correct 79 ms 4876 KB Output is correct
10 Correct 859 ms 6956 KB Output is correct
11 Correct 873 ms 6944 KB Output is correct
12 Correct 1325 ms 7432 KB Output is correct
13 Correct 1392 ms 7228 KB Output is correct
14 Correct 1016 ms 6428 KB Output is correct
15 Correct 455 ms 5140 KB Output is correct
16 Correct 988 ms 6180 KB Output is correct
17 Correct 954 ms 6352 KB Output is correct
18 Correct 79 ms 4944 KB Output is correct
19 Correct 997 ms 6352 KB Output is correct
20 Correct 900 ms 6356 KB Output is correct
21 Correct 891 ms 6488 KB Output is correct
22 Correct 826 ms 6352 KB Output is correct
23 Correct 818 ms 6196 KB Output is correct
24 Correct 779 ms 6480 KB Output is correct
25 Correct 768 ms 6160 KB Output is correct
26 Correct 1348 ms 6948 KB Output is correct
27 Correct 1491 ms 7100 KB Output is correct
28 Correct 1428 ms 7064 KB Output is correct
29 Correct 1279 ms 7132 KB Output is correct
30 Correct 1500 ms 7076 KB Output is correct
31 Correct 1543 ms 7124 KB Output is correct
32 Correct 1550 ms 7592 KB Output is correct
33 Correct 1486 ms 7112 KB Output is correct
34 Correct 1432 ms 7068 KB Output is correct
35 Correct 1427 ms 7164 KB Output is correct
36 Correct 1326 ms 6936 KB Output is correct
37 Correct 1295 ms 7132 KB Output is correct
38 Correct 1286 ms 7124 KB Output is correct
39 Correct 1295 ms 7308 KB Output is correct
40 Correct 1260 ms 7192 KB Output is correct
41 Correct 1264 ms 7120 KB Output is correct
42 Correct 1137 ms 7112 KB Output is correct
43 Correct 1185 ms 7020 KB Output is correct
44 Correct 1133 ms 7108 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 25 ms 4640 KB Output is correct
4 Correct 9 ms 4440 KB Output is correct
5 Correct 19 ms 4444 KB Output is correct
6 Correct 16 ms 4444 KB Output is correct
7 Correct 19 ms 4444 KB Output is correct
8 Correct 16 ms 4444 KB Output is correct
9 Correct 14 ms 4444 KB Output is correct
10 Correct 17 ms 4444 KB Output is correct
11 Correct 16 ms 4636 KB Output is correct
12 Correct 21 ms 4444 KB Output is correct
13 Correct 21 ms 4612 KB Output is correct
14 Correct 20 ms 4444 KB Output is correct
15 Correct 18 ms 4444 KB Output is correct
16 Correct 16 ms 4444 KB Output is correct
17 Correct 15 ms 4440 KB Output is correct
18 Correct 1371 ms 6940 KB Output is correct
19 Correct 1390 ms 6948 KB Output is correct
20 Correct 1424 ms 6816 KB Output is correct
21 Correct 1407 ms 6856 KB Output is correct
22 Correct 1504 ms 7164 KB Output is correct
23 Correct 1668 ms 7440 KB Output is correct
24 Correct 1789 ms 7196 KB Output is correct
25 Correct 1703 ms 7200 KB Output is correct
26 Correct 79 ms 4876 KB Output is correct
27 Correct 859 ms 6956 KB Output is correct
28 Correct 873 ms 6944 KB Output is correct
29 Correct 1325 ms 7432 KB Output is correct
30 Correct 1392 ms 7228 KB Output is correct
31 Correct 1016 ms 6428 KB Output is correct
32 Correct 455 ms 5140 KB Output is correct
33 Correct 988 ms 6180 KB Output is correct
34 Correct 954 ms 6352 KB Output is correct
35 Correct 79 ms 4944 KB Output is correct
36 Correct 997 ms 6352 KB Output is correct
37 Correct 900 ms 6356 KB Output is correct
38 Correct 891 ms 6488 KB Output is correct
39 Correct 826 ms 6352 KB Output is correct
40 Correct 818 ms 6196 KB Output is correct
41 Correct 779 ms 6480 KB Output is correct
42 Correct 768 ms 6160 KB Output is correct
43 Correct 2504 ms 9148 KB Output is correct
44 Correct 78 ms 4752 KB Output is correct
45 Correct 256 ms 8392 KB Output is correct
46 Correct 142 ms 8392 KB Output is correct
47 Correct 1463 ms 9192 KB Output is correct
48 Correct 2538 ms 9208 KB Output is correct
49 Correct 1497 ms 9196 KB Output is correct
50 Correct 1162 ms 7144 KB Output is correct
51 Correct 1174 ms 6964 KB Output is correct
52 Correct 1202 ms 7144 KB Output is correct
53 Correct 1869 ms 8680 KB Output is correct
54 Correct 1848 ms 8196 KB Output is correct
55 Correct 1850 ms 8204 KB Output is correct
56 Correct 1276 ms 9452 KB Output is correct
57 Correct 1405 ms 9360 KB Output is correct
58 Correct 2579 ms 9084 KB Output is correct
59 Correct 2574 ms 9364 KB Output is correct
60 Correct 2501 ms 9172 KB Output is correct
61 Correct 2502 ms 9316 KB Output is correct
62 Correct 2129 ms 9176 KB Output is correct
63 Correct 2133 ms 8864 KB Output is correct
64 Correct 2415 ms 9256 KB Output is correct
65 Correct 1483 ms 8732 KB Output is correct
66 Correct 1348 ms 6948 KB Output is correct
67 Correct 1491 ms 7100 KB Output is correct
68 Correct 1428 ms 7064 KB Output is correct
69 Correct 1279 ms 7132 KB Output is correct
70 Correct 1500 ms 7076 KB Output is correct
71 Correct 1543 ms 7124 KB Output is correct
72 Correct 1550 ms 7592 KB Output is correct
73 Correct 1486 ms 7112 KB Output is correct
74 Correct 1432 ms 7068 KB Output is correct
75 Correct 1427 ms 7164 KB Output is correct
76 Correct 1326 ms 6936 KB Output is correct
77 Correct 1295 ms 7132 KB Output is correct
78 Correct 1286 ms 7124 KB Output is correct
79 Correct 1295 ms 7308 KB Output is correct
80 Correct 1260 ms 7192 KB Output is correct
81 Correct 1264 ms 7120 KB Output is correct
82 Correct 1137 ms 7112 KB Output is correct
83 Correct 1185 ms 7020 KB Output is correct
84 Correct 1133 ms 7108 KB Output is correct
85 Correct 2793 ms 9188 KB Output is correct
86 Correct 285 ms 10796 KB Output is correct
87 Correct 158 ms 10772 KB Output is correct
88 Correct 1709 ms 11588 KB Output is correct
89 Correct 2758 ms 13084 KB Output is correct
90 Correct 1657 ms 11560 KB Output is correct
91 Correct 1490 ms 9616 KB Output is correct
92 Correct 1451 ms 9792 KB Output is correct
93 Correct 1738 ms 9928 KB Output is correct
94 Correct 2170 ms 11280 KB Output is correct
95 Correct 2118 ms 11252 KB Output is correct
96 Correct 2341 ms 12204 KB Output is correct
97 Correct 1537 ms 11660 KB Output is correct
98 Correct 1464 ms 11196 KB Output is correct
99 Correct 2771 ms 12740 KB Output is correct
100 Correct 2776 ms 12964 KB Output is correct
101 Correct 2807 ms 12880 KB Output is correct
102 Correct 2777 ms 12996 KB Output is correct
103 Correct 2467 ms 11792 KB Output is correct
104 Correct 2498 ms 11756 KB Output is correct
105 Correct 2162 ms 11596 KB Output is correct
106 Correct 1892 ms 11104 KB Output is correct
107 Correct 2160 ms 12164 KB Output is correct
108 Correct 2640 ms 12584 KB Output is correct
109 Correct 1766 ms 10696 KB Output is correct