oj.uz

Submission #953027

# Submission time Handle Problem Language Result Execution time Memory
953027 2024-03-25T10:28:20 Z Vladth11 Bridges (APIO19_bridges) C++14
73 / 100
 3000 ms 9424 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 = 670;
 
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 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 22 ms 4648 KB Output is correct
4 Correct 8 ms 4620 KB Output is correct
5 Correct 18 ms 4444 KB Output is correct
6 Correct 15 ms 4624 KB Output is correct
7 Correct 14 ms 4444 KB Output is correct
8 Correct 15 ms 4444 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct
10 Correct 15 ms 4616 KB Output is correct
11 Correct 17 ms 4444 KB Output is correct
12 Correct 15 ms 4444 KB Output is correct
13 Correct 20 ms 4444 KB Output is correct
14 Correct 19 ms 4444 KB Output is correct
15 Correct 17 ms 4444 KB Output is correct
16 Correct 15 ms 4444 KB Output is correct
17 Correct 14 ms 4444 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1539 ms 7320 KB Output is correct
2 Correct 1531 ms 6972 KB Output is correct
3 Correct 1482 ms 7128 KB Output is correct
4 Correct 1551 ms 7144 KB Output is correct
5 Correct 1525 ms 7036 KB Output is correct
6 Correct 1789 ms 7200 KB Output is correct
7 Correct 1790 ms 7196 KB Output is correct
8 Correct 1879 ms 7196 KB Output is correct
9 Correct 72 ms 4752 KB Output is correct
10 Correct 883 ms 6940 KB Output is correct
11 Correct 906 ms 7120 KB Output is correct
12 Correct 1443 ms 7296 KB Output is correct
13 Correct 1429 ms 7124 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 990 ms 6172 KB Output is correct
2 Correct 430 ms 5244 KB Output is correct
3 Correct 1004 ms 6376 KB Output is correct
4 Correct 1010 ms 6396 KB Output is correct
5 Correct 72 ms 4936 KB Output is correct
6 Correct 1022 ms 6364 KB Output is correct
7 Correct 969 ms 6376 KB Output is correct
8 Correct 949 ms 6348 KB Output is correct
9 Correct 919 ms 6448 KB Output is correct
10 Correct 883 ms 6352 KB Output is correct
11 Correct 868 ms 6352 KB Output is correct
12 Correct 839 ms 6380 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2885 ms 9376 KB Output is correct
2 Correct 72 ms 4948 KB Output is correct
3 Correct 283 ms 8592 KB Output is correct
4 Correct 150 ms 8912 KB Output is correct
5 Correct 1647 ms 9200 KB Output is correct
6 Correct 2764 ms 9280 KB Output is correct
7 Correct 1625 ms 9192 KB Output is correct
8 Correct 1357 ms 7116 KB Output is correct
9 Correct 1311 ms 7112 KB Output is correct
10 Correct 1275 ms 7320 KB Output is correct
11 Correct 2067 ms 8200 KB Output is correct
12 Correct 2078 ms 8200 KB Output is correct
13 Correct 2111 ms 8212 KB Output is correct
14 Correct 1468 ms 9380 KB Output is correct
15 Correct 1589 ms 9424 KB Output is correct
16 Correct 2918 ms 9152 KB Output is correct
17 Correct 2894 ms 9344 KB Output is correct
18 Correct 2865 ms 9176 KB Output is correct
19 Correct 2791 ms 9160 KB Output is correct
20 Correct 2394 ms 8792 KB Output is correct
21 Correct 2391 ms 8792 KB Output is correct
22 Correct 2716 ms 9256 KB Output is correct
23 Correct 1730 ms 8648 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1539 ms 7320 KB Output is correct
2 Correct 1531 ms 6972 KB Output is correct
3 Correct 1482 ms 7128 KB Output is correct
4 Correct 1551 ms 7144 KB Output is correct
5 Correct 1525 ms 7036 KB Output is correct
6 Correct 1789 ms 7200 KB Output is correct
7 Correct 1790 ms 7196 KB Output is correct
8 Correct 1879 ms 7196 KB Output is correct
9 Correct 72 ms 4752 KB Output is correct
10 Correct 883 ms 6940 KB Output is correct
11 Correct 906 ms 7120 KB Output is correct
12 Correct 1443 ms 7296 KB Output is correct
13 Correct 1429 ms 7124 KB Output is correct
14 Correct 990 ms 6172 KB Output is correct
15 Correct 430 ms 5244 KB Output is correct
16 Correct 1004 ms 6376 KB Output is correct
17 Correct 1010 ms 6396 KB Output is correct
18 Correct 72 ms 4936 KB Output is correct
19 Correct 1022 ms 6364 KB Output is correct
20 Correct 969 ms 6376 KB Output is correct
21 Correct 949 ms 6348 KB Output is correct
22 Correct 919 ms 6448 KB Output is correct
23 Correct 883 ms 6352 KB Output is correct
24 Correct 868 ms 6352 KB Output is correct
25 Correct 839 ms 6380 KB Output is correct
26 Correct 1475 ms 6940 KB Output is correct
27 Correct 1627 ms 7088 KB Output is correct
28 Correct 1512 ms 7124 KB Output is correct
29 Correct 1419 ms 6940 KB Output is correct
30 Correct 1564 ms 6940 KB Output is correct
31 Correct 1618 ms 7168 KB Output is correct
32 Correct 1604 ms 6940 KB Output is correct
33 Correct 1533 ms 6816 KB Output is correct
34 Correct 1576 ms 7356 KB Output is correct
35 Correct 1554 ms 7372 KB Output is correct
36 Correct 1458 ms 7364 KB Output is correct
37 Correct 1439 ms 6940 KB Output is correct
38 Correct 1448 ms 7020 KB Output is correct
39 Correct 1473 ms 6920 KB Output is correct
40 Correct 1407 ms 7116 KB Output is correct
41 Correct 1398 ms 7048 KB Output is correct
42 Correct 1326 ms 6928 KB Output is correct
43 Correct 1304 ms 7028 KB Output is correct
44 Correct 1314 ms 7124 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 22 ms 4648 KB Output is correct
4 Correct 8 ms 4620 KB Output is correct
5 Correct 18 ms 4444 KB Output is correct
6 Correct 15 ms 4624 KB Output is correct
7 Correct 14 ms 4444 KB Output is correct
8 Correct 15 ms 4444 KB Output is correct
9 Correct 13 ms 4444 KB Output is correct
10 Correct 15 ms 4616 KB Output is correct
11 Correct 17 ms 4444 KB Output is correct
12 Correct 15 ms 4444 KB Output is correct
13 Correct 20 ms 4444 KB Output is correct
14 Correct 19 ms 4444 KB Output is correct
15 Correct 17 ms 4444 KB Output is correct
16 Correct 15 ms 4444 KB Output is correct
17 Correct 14 ms 4444 KB Output is correct
18 Correct 1539 ms 7320 KB Output is correct
19 Correct 1531 ms 6972 KB Output is correct
20 Correct 1482 ms 7128 KB Output is correct
21 Correct 1551 ms 7144 KB Output is correct
22 Correct 1525 ms 7036 KB Output is correct
23 Correct 1789 ms 7200 KB Output is correct
24 Correct 1790 ms 7196 KB Output is correct
25 Correct 1879 ms 7196 KB Output is correct
26 Correct 72 ms 4752 KB Output is correct
27 Correct 883 ms 6940 KB Output is correct
28 Correct 906 ms 7120 KB Output is correct
29 Correct 1443 ms 7296 KB Output is correct
30 Correct 1429 ms 7124 KB Output is correct
31 Correct 990 ms 6172 KB Output is correct
32 Correct 430 ms 5244 KB Output is correct
33 Correct 1004 ms 6376 KB Output is correct
34 Correct 1010 ms 6396 KB Output is correct
35 Correct 72 ms 4936 KB Output is correct
36 Correct 1022 ms 6364 KB Output is correct
37 Correct 969 ms 6376 KB Output is correct
38 Correct 949 ms 6348 KB Output is correct
39 Correct 919 ms 6448 KB Output is correct
40 Correct 883 ms 6352 KB Output is correct
41 Correct 868 ms 6352 KB Output is correct
42 Correct 839 ms 6380 KB Output is correct
43 Correct 2885 ms 9376 KB Output is correct
44 Correct 72 ms 4948 KB Output is correct
45 Correct 283 ms 8592 KB Output is correct
46 Correct 150 ms 8912 KB Output is correct
47 Correct 1647 ms 9200 KB Output is correct
48 Correct 2764 ms 9280 KB Output is correct
49 Correct 1625 ms 9192 KB Output is correct
50 Correct 1357 ms 7116 KB Output is correct
51 Correct 1311 ms 7112 KB Output is correct
52 Correct 1275 ms 7320 KB Output is correct
53 Correct 2067 ms 8200 KB Output is correct
54 Correct 2078 ms 8200 KB Output is correct
55 Correct 2111 ms 8212 KB Output is correct
56 Correct 1468 ms 9380 KB Output is correct
57 Correct 1589 ms 9424 KB Output is correct
58 Correct 2918 ms 9152 KB Output is correct
59 Correct 2894 ms 9344 KB Output is correct
60 Correct 2865 ms 9176 KB Output is correct
61 Correct 2791 ms 9160 KB Output is correct
62 Correct 2394 ms 8792 KB Output is correct
63 Correct 2391 ms 8792 KB Output is correct
64 Correct 2716 ms 9256 KB Output is correct
65 Correct 1730 ms 8648 KB Output is correct
66 Correct 1475 ms 6940 KB Output is correct
67 Correct 1627 ms 7088 KB Output is correct
68 Correct 1512 ms 7124 KB Output is correct
69 Correct 1419 ms 6940 KB Output is correct
70 Correct 1564 ms 6940 KB Output is correct
71 Correct 1618 ms 7168 KB Output is correct
72 Correct 1604 ms 6940 KB Output is correct
73 Correct 1533 ms 6816 KB Output is correct
74 Correct 1576 ms 7356 KB Output is correct
75 Correct 1554 ms 7372 KB Output is correct
76 Correct 1458 ms 7364 KB Output is correct
77 Correct 1439 ms 6940 KB Output is correct
78 Correct 1448 ms 7020 KB Output is correct
79 Correct 1473 ms 6920 KB Output is correct
80 Correct 1407 ms 7116 KB Output is correct
81 Correct 1398 ms 7048 KB Output is correct
82 Correct 1326 ms 6928 KB Output is correct
83 Correct 1304 ms 7028 KB Output is correct
84 Correct 1314 ms 7124 KB Output is correct
85 Execution timed out 3052 ms 8832 KB Time limit exceeded
86 Halted 0 ms 0 KB -