oj.uz

Submission #953030

# Submission time Handle Problem Language Result Execution time Memory
953030 2024-03-25T10:33:56 Z Vladth11 Bridges (APIO19_bridges) C++14
100 / 100
 2289 ms 9548 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 = 1370;
 
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 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 38 ms 4640 KB Output is correct
4 Correct 13 ms 4444 KB Output is correct
5 Correct 27 ms 4632 KB Output is correct
6 Correct 21 ms 4444 KB Output is correct
7 Correct 20 ms 4636 KB Output is correct
8 Correct 21 ms 4444 KB Output is correct
9 Correct 19 ms 4444 KB Output is correct
10 Correct 21 ms 4440 KB Output is correct
11 Correct 21 ms 4616 KB Output is correct
12 Correct 23 ms 4444 KB Output is correct
13 Correct 28 ms 4656 KB Output is correct
14 Correct 27 ms 4624 KB Output is correct
15 Correct 25 ms 4440 KB Output is correct
16 Correct 19 ms 4444 KB Output is correct
17 Correct 20 ms 4632 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1168 ms 6860 KB Output is correct
2 Correct 1220 ms 7104 KB Output is correct
3 Correct 1209 ms 7180 KB Output is correct
4 Correct 1325 ms 7188 KB Output is correct
5 Correct 1297 ms 6936 KB Output is correct
6 Correct 1905 ms 7196 KB Output is correct
7 Correct 1905 ms 7144 KB Output is correct
8 Correct 1938 ms 7400 KB Output is correct
9 Correct 124 ms 4752 KB Output is correct
10 Correct 947 ms 6948 KB Output is correct
11 Correct 920 ms 6936 KB Output is correct
12 Correct 1012 ms 7212 KB Output is correct
13 Correct 1122 ms 7116 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 906 ms 6356 KB Output is correct
2 Correct 630 ms 5140 KB Output is correct
3 Correct 977 ms 6800 KB Output is correct
4 Correct 880 ms 6136 KB Output is correct
5 Correct 118 ms 4764 KB Output is correct
6 Correct 958 ms 6436 KB Output is correct
7 Correct 805 ms 6376 KB Output is correct
8 Correct 741 ms 6136 KB Output is correct
9 Correct 641 ms 6432 KB Output is correct
10 Correct 624 ms 6448 KB Output is correct
11 Correct 608 ms 6156 KB Output is correct
12 Correct 538 ms 6096 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1508 ms 9300 KB Output is correct
2 Correct 117 ms 4948 KB Output is correct
3 Correct 175 ms 8404 KB Output is correct
4 Correct 133 ms 8396 KB Output is correct
5 Correct 909 ms 9548 KB Output is correct
6 Correct 1520 ms 9344 KB Output is correct
7 Correct 907 ms 9412 KB Output is correct
8 Correct 746 ms 6956 KB Output is correct
9 Correct 764 ms 6960 KB Output is correct
10 Correct 772 ms 7220 KB Output is correct
11 Correct 1127 ms 8072 KB Output is correct
12 Correct 1113 ms 8128 KB Output is correct
13 Correct 1153 ms 8396 KB Output is correct
14 Correct 811 ms 9544 KB Output is correct
15 Correct 859 ms 9464 KB Output is correct
16 Correct 1479 ms 9280 KB Output is correct
17 Correct 1545 ms 9416 KB Output is correct
18 Correct 1505 ms 9188 KB Output is correct
19 Correct 1538 ms 9288 KB Output is correct
20 Correct 1250 ms 8796 KB Output is correct
21 Correct 1254 ms 8924 KB Output is correct
22 Correct 1443 ms 9260 KB Output is correct
23 Correct 920 ms 8904 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1168 ms 6860 KB Output is correct
2 Correct 1220 ms 7104 KB Output is correct
3 Correct 1209 ms 7180 KB Output is correct
4 Correct 1325 ms 7188 KB Output is correct
5 Correct 1297 ms 6936 KB Output is correct
6 Correct 1905 ms 7196 KB Output is correct
7 Correct 1905 ms 7144 KB Output is correct
8 Correct 1938 ms 7400 KB Output is correct
9 Correct 124 ms 4752 KB Output is correct
10 Correct 947 ms 6948 KB Output is correct
11 Correct 920 ms 6936 KB Output is correct
12 Correct 1012 ms 7212 KB Output is correct
13 Correct 1122 ms 7116 KB Output is correct
14 Correct 906 ms 6356 KB Output is correct
15 Correct 630 ms 5140 KB Output is correct
16 Correct 977 ms 6800 KB Output is correct
17 Correct 880 ms 6136 KB Output is correct
18 Correct 118 ms 4764 KB Output is correct
19 Correct 958 ms 6436 KB Output is correct
20 Correct 805 ms 6376 KB Output is correct
21 Correct 741 ms 6136 KB Output is correct
22 Correct 641 ms 6432 KB Output is correct
23 Correct 624 ms 6448 KB Output is correct
24 Correct 608 ms 6156 KB Output is correct
25 Correct 538 ms 6096 KB Output is correct
26 Correct 1132 ms 6940 KB Output is correct
27 Correct 1334 ms 7084 KB Output is correct
28 Correct 1187 ms 6968 KB Output is correct
29 Correct 938 ms 7016 KB Output is correct
30 Correct 1397 ms 7168 KB Output is correct
31 Correct 1451 ms 7112 KB Output is correct
32 Correct 1423 ms 7148 KB Output is correct
33 Correct 1217 ms 6940 KB Output is correct
34 Correct 1242 ms 7100 KB Output is correct
35 Correct 1215 ms 6988 KB Output is correct
36 Correct 973 ms 7120 KB Output is correct
37 Correct 963 ms 7140 KB Output is correct
38 Correct 957 ms 7132 KB Output is correct
39 Correct 872 ms 6912 KB Output is correct
40 Correct 882 ms 7108 KB Output is correct
41 Correct 876 ms 6924 KB Output is correct
42 Correct 731 ms 7096 KB Output is correct
43 Correct 728 ms 7160 KB Output is correct
44 Correct 730 ms 6928 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 38 ms 4640 KB Output is correct
4 Correct 13 ms 4444 KB Output is correct
5 Correct 27 ms 4632 KB Output is correct
6 Correct 21 ms 4444 KB Output is correct
7 Correct 20 ms 4636 KB Output is correct
8 Correct 21 ms 4444 KB Output is correct
9 Correct 19 ms 4444 KB Output is correct
10 Correct 21 ms 4440 KB Output is correct
11 Correct 21 ms 4616 KB Output is correct
12 Correct 23 ms 4444 KB Output is correct
13 Correct 28 ms 4656 KB Output is correct
14 Correct 27 ms 4624 KB Output is correct
15 Correct 25 ms 4440 KB Output is correct
16 Correct 19 ms 4444 KB Output is correct
17 Correct 20 ms 4632 KB Output is correct
18 Correct 1168 ms 6860 KB Output is correct
19 Correct 1220 ms 7104 KB Output is correct
20 Correct 1209 ms 7180 KB Output is correct
21 Correct 1325 ms 7188 KB Output is correct
22 Correct 1297 ms 6936 KB Output is correct
23 Correct 1905 ms 7196 KB Output is correct
24 Correct 1905 ms 7144 KB Output is correct
25 Correct 1938 ms 7400 KB Output is correct
26 Correct 124 ms 4752 KB Output is correct
27 Correct 947 ms 6948 KB Output is correct
28 Correct 920 ms 6936 KB Output is correct
29 Correct 1012 ms 7212 KB Output is correct
30 Correct 1122 ms 7116 KB Output is correct
31 Correct 906 ms 6356 KB Output is correct
32 Correct 630 ms 5140 KB Output is correct
33 Correct 977 ms 6800 KB Output is correct
34 Correct 880 ms 6136 KB Output is correct
35 Correct 118 ms 4764 KB Output is correct
36 Correct 958 ms 6436 KB Output is correct
37 Correct 805 ms 6376 KB Output is correct
38 Correct 741 ms 6136 KB Output is correct
39 Correct 641 ms 6432 KB Output is correct
40 Correct 624 ms 6448 KB Output is correct
41 Correct 608 ms 6156 KB Output is correct
42 Correct 538 ms 6096 KB Output is correct
43 Correct 1508 ms 9300 KB Output is correct
44 Correct 117 ms 4948 KB Output is correct
45 Correct 175 ms 8404 KB Output is correct
46 Correct 133 ms 8396 KB Output is correct
47 Correct 909 ms 9548 KB Output is correct
48 Correct 1520 ms 9344 KB Output is correct
49 Correct 907 ms 9412 KB Output is correct
50 Correct 746 ms 6956 KB Output is correct
51 Correct 764 ms 6960 KB Output is correct
52 Correct 772 ms 7220 KB Output is correct
53 Correct 1127 ms 8072 KB Output is correct
54 Correct 1113 ms 8128 KB Output is correct
55 Correct 1153 ms 8396 KB Output is correct
56 Correct 811 ms 9544 KB Output is correct
57 Correct 859 ms 9464 KB Output is correct
58 Correct 1479 ms 9280 KB Output is correct
59 Correct 1545 ms 9416 KB Output is correct
60 Correct 1505 ms 9188 KB Output is correct
61 Correct 1538 ms 9288 KB Output is correct
62 Correct 1250 ms 8796 KB Output is correct
63 Correct 1254 ms 8924 KB Output is correct
64 Correct 1443 ms 9260 KB Output is correct
65 Correct 920 ms 8904 KB Output is correct
66 Correct 1132 ms 6940 KB Output is correct
67 Correct 1334 ms 7084 KB Output is correct
68 Correct 1187 ms 6968 KB Output is correct
69 Correct 938 ms 7016 KB Output is correct
70 Correct 1397 ms 7168 KB Output is correct
71 Correct 1451 ms 7112 KB Output is correct
72 Correct 1423 ms 7148 KB Output is correct
73 Correct 1217 ms 6940 KB Output is correct
74 Correct 1242 ms 7100 KB Output is correct
75 Correct 1215 ms 6988 KB Output is correct
76 Correct 973 ms 7120 KB Output is correct
77 Correct 963 ms 7140 KB Output is correct
78 Correct 957 ms 7132 KB Output is correct
79 Correct 872 ms 6912 KB Output is correct
80 Correct 882 ms 7108 KB Output is correct
81 Correct 876 ms 6924 KB Output is correct
82 Correct 731 ms 7096 KB Output is correct
83 Correct 728 ms 7160 KB Output is correct
84 Correct 730 ms 6928 KB Output is correct
85 Correct 1957 ms 8976 KB Output is correct
86 Correct 209 ms 8556 KB Output is correct
87 Correct 137 ms 8644 KB Output is correct
88 Correct 1304 ms 9160 KB Output is correct
89 Correct 1954 ms 9084 KB Output is correct
90 Correct 1309 ms 9268 KB Output is correct
91 Correct 1303 ms 6980 KB Output is correct
92 Correct 1272 ms 6896 KB Output is correct
93 Correct 1804 ms 7116 KB Output is correct
94 Correct 1762 ms 8068 KB Output is correct
95 Correct 1661 ms 8136 KB Output is correct
96 Correct 2109 ms 8072 KB Output is correct
97 Correct 1043 ms 9204 KB Output is correct
98 Correct 1071 ms 8928 KB Output is correct
99 Correct 2009 ms 8996 KB Output is correct
100 Correct 2054 ms 8896 KB Output is correct
101 Correct 2127 ms 8908 KB Output is correct
102 Correct 2031 ms 8904 KB Output is correct
103 Correct 2248 ms 8520 KB Output is correct
104 Correct 2289 ms 8524 KB Output is correct
105 Correct 1567 ms 8248 KB Output is correct
106 Correct 1237 ms 8076 KB Output is correct
107 Correct 1527 ms 8604 KB Output is correct
108 Correct 2147 ms 8984 KB Output is correct
109 Correct 1536 ms 8380 KB Output is correct