oj.uz

Submission #967208

# Submission time Handle Problem Language Result Execution time Memory
967208 2024-04-21T13:51:23 Z socpite Bridges (APIO19_bridges) C++14
100 / 100
 2357 ms 20716 KB 
#include<bits/stdc++.h>
using namespace std;

const int maxn = 1e5+5;
const int blsz = 350;

int n, m, q;

int U[maxn], V[maxn], W[maxn];

int Wnew[maxn];

int T[maxn], id[maxn], val[maxn], ans[maxn];
bool chk[maxn];

int up[maxn], vis[maxn];

vector<int> g[maxn];

int dfs(int x, int pos){
    int res = -up[x];
    vis[x] = pos;
    for(auto v: g[x]){
        if(vis[v] == pos)continue;
        res += dfs(v, pos);
    }
    return res;
}

int Find(int x){
    return up[x] < 0 ? x : up[x] = Find(up[x]);
}

void Union(int a, int b){
    a = Find(a);
    b = Find(b);
    if(a == b)return;
    up[a] += up[b];
    up[b] = a;
}

struct cmp{
    bool operator()(const int &a, const int &b)const {
        return make_pair(W[a], a) > make_pair(W[b], b);
    }
};

void solve_query(int l, int pos, vector<int> &changed){
    for(auto v: changed)Wnew[v] = W[v];
    for(int i = l; i < pos; i++){
        if(T[i] == 1)Wnew[id[i]] = val[i];
    }
    for(auto v: changed)if(Wnew[v] >= val[pos]){
        g[Find(U[v])].push_back(Find(V[v]));
        g[Find(V[v])].push_back(Find(U[v]));
    }
    ans[pos] = dfs(Find(id[pos]), pos);
    for(auto v: changed){
        g[Find(U[v])].clear();
        g[Find(V[v])].clear();
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= n; i++)vis[i] = -1;
    set<int, cmp> st;
    for(int i = 1; i <= m; i++){
        cin >> U[i] >> V[i] >> W[i];
        st.insert(i);
    }
    cin >> q;
    for(int i = 0; i < q; i++){
        cin >> T[i] >> id[i] >> val[i];
    }
    for(int l = 0; l < q; l += blsz){
        int r = min(l + blsz, q);

        // solving queries

        vector<int> changed;
        vector<pair<int, int>> queries;
        for(int i = l; i < r; i++){
            if(T[i] == 1){
                changed.push_back(id[i]);
                chk[id[i]] = 1;
            }
            else queries.push_back({val[i], i});
        }
        sort(queries.begin(), queries.end());
        reverse(queries.begin(), queries.end());

        int ptr = 0;
        for(int i = 1; i <= n; i++)up[i] = -1;
        for(auto v: st){
            while(ptr < queries.size() && queries[ptr].first > W[v])solve_query(l, queries[ptr++].second, changed);
            if(!chk[v])Union(U[v], V[v]);
        }
        while(ptr < queries.size())solve_query(l, queries[ptr++].second, changed);

        // update and reset. also prints answers

        for(int i = l; i < r; i++){
            if(T[i] == 1){
                chk[id[i]] = 0;

                st.erase(id[i]);
                W[id[i]] = val[i];
                st.insert(id[i]);
            }
            else cout << ans[i] << "\n";
        }
    }
}

Compilation message

bridges.cpp: In function 'int main()':
bridges.cpp:98:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |             while(ptr < queries.size() && queries[ptr].first > W[v])solve_query(l, queries[ptr++].second, changed);
      |                   ~~~~^~~~~~~~~~~~~~~~
bridges.cpp:101:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         while(ptr < queries.size())solve_query(l, queries[ptr++].second, changed);
      |               ~~~~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 18 ms 6748 KB Output is correct
4 Correct 5 ms 6748 KB Output is correct
5 Correct 17 ms 6808 KB Output is correct
6 Correct 15 ms 6748 KB Output is correct
7 Correct 14 ms 6748 KB Output is correct
8 Correct 15 ms 6748 KB Output is correct
9 Correct 16 ms 6748 KB Output is correct
10 Correct 17 ms 6808 KB Output is correct
11 Correct 14 ms 6744 KB Output is correct
12 Correct 20 ms 6748 KB Output is correct
13 Correct 22 ms 6748 KB Output is correct
14 Correct 16 ms 6748 KB Output is correct
15 Correct 17 ms 6748 KB Output is correct
16 Correct 15 ms 6748 KB Output is correct
17 Correct 15 ms 6748 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 763 ms 10368 KB Output is correct
2 Correct 777 ms 10792 KB Output is correct
3 Correct 785 ms 10580 KB Output is correct
4 Correct 778 ms 10456 KB Output is correct
5 Correct 788 ms 10616 KB Output is correct
6 Correct 852 ms 10408 KB Output is correct
7 Correct 799 ms 10692 KB Output is correct
8 Correct 808 ms 10616 KB Output is correct
9 Correct 38 ms 6796 KB Output is correct
10 Correct 564 ms 10400 KB Output is correct
11 Correct 572 ms 10504 KB Output is correct
12 Correct 655 ms 9824 KB Output is correct
13 Correct 690 ms 10380 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 9336 KB Output is correct
2 Correct 277 ms 7392 KB Output is correct
3 Correct 604 ms 9600 KB Output is correct
4 Correct 541 ms 9352 KB Output is correct
5 Correct 38 ms 6748 KB Output is correct
6 Correct 542 ms 9296 KB Output is correct
7 Correct 536 ms 9280 KB Output is correct
8 Correct 519 ms 9560 KB Output is correct
9 Correct 404 ms 8904 KB Output is correct
10 Correct 429 ms 9052 KB Output is correct
11 Correct 457 ms 9308 KB Output is correct
12 Correct 458 ms 9300 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1998 ms 11780 KB Output is correct
2 Correct 41 ms 6744 KB Output is correct
3 Correct 140 ms 11520 KB Output is correct
4 Correct 57 ms 11380 KB Output is correct
5 Correct 1504 ms 11988 KB Output is correct
6 Correct 2256 ms 12084 KB Output is correct
7 Correct 1486 ms 12028 KB Output is correct
8 Correct 592 ms 9300 KB Output is correct
9 Correct 650 ms 9208 KB Output is correct
10 Correct 634 ms 9432 KB Output is correct
11 Correct 1186 ms 10552 KB Output is correct
12 Correct 1233 ms 10580 KB Output is correct
13 Correct 1188 ms 10800 KB Output is correct
14 Correct 1408 ms 12248 KB Output is correct
15 Correct 1421 ms 12156 KB Output is correct
16 Correct 1910 ms 11932 KB Output is correct
17 Correct 1882 ms 11736 KB Output is correct
18 Correct 1728 ms 11852 KB Output is correct
19 Correct 1812 ms 11880 KB Output is correct
20 Correct 1382 ms 11344 KB Output is correct
21 Correct 1404 ms 11116 KB Output is correct
22 Correct 1788 ms 11860 KB Output is correct
23 Correct 1305 ms 11104 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 763 ms 10368 KB Output is correct
2 Correct 777 ms 10792 KB Output is correct
3 Correct 785 ms 10580 KB Output is correct
4 Correct 778 ms 10456 KB Output is correct
5 Correct 788 ms 10616 KB Output is correct
6 Correct 852 ms 10408 KB Output is correct
7 Correct 799 ms 10692 KB Output is correct
8 Correct 808 ms 10616 KB Output is correct
9 Correct 38 ms 6796 KB Output is correct
10 Correct 564 ms 10400 KB Output is correct
11 Correct 572 ms 10504 KB Output is correct
12 Correct 655 ms 9824 KB Output is correct
13 Correct 690 ms 10380 KB Output is correct
14 Correct 533 ms 9336 KB Output is correct
15 Correct 277 ms 7392 KB Output is correct
16 Correct 604 ms 9600 KB Output is correct
17 Correct 541 ms 9352 KB Output is correct
18 Correct 38 ms 6748 KB Output is correct
19 Correct 542 ms 9296 KB Output is correct
20 Correct 536 ms 9280 KB Output is correct
21 Correct 519 ms 9560 KB Output is correct
22 Correct 404 ms 8904 KB Output is correct
23 Correct 429 ms 9052 KB Output is correct
24 Correct 457 ms 9308 KB Output is correct
25 Correct 458 ms 9300 KB Output is correct
26 Correct 743 ms 10468 KB Output is correct
27 Correct 1132 ms 11836 KB Output is correct
28 Correct 1127 ms 14484 KB Output is correct
29 Correct 1072 ms 11568 KB Output is correct
30 Correct 960 ms 11096 KB Output is correct
31 Correct 989 ms 10756 KB Output is correct
32 Correct 983 ms 10696 KB Output is correct
33 Correct 914 ms 10976 KB Output is correct
34 Correct 940 ms 10672 KB Output is correct
35 Correct 943 ms 10564 KB Output is correct
36 Correct 845 ms 10916 KB Output is correct
37 Correct 873 ms 10408 KB Output is correct
38 Correct 887 ms 10788 KB Output is correct
39 Correct 743 ms 10160 KB Output is correct
40 Correct 775 ms 10068 KB Output is correct
41 Correct 770 ms 10260 KB Output is correct
42 Correct 823 ms 10684 KB Output is correct
43 Correct 808 ms 10760 KB Output is correct
44 Correct 808 ms 10708 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6744 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 18 ms 6748 KB Output is correct
4 Correct 5 ms 6748 KB Output is correct
5 Correct 17 ms 6808 KB Output is correct
6 Correct 15 ms 6748 KB Output is correct
7 Correct 14 ms 6748 KB Output is correct
8 Correct 15 ms 6748 KB Output is correct
9 Correct 16 ms 6748 KB Output is correct
10 Correct 17 ms 6808 KB Output is correct
11 Correct 14 ms 6744 KB Output is correct
12 Correct 20 ms 6748 KB Output is correct
13 Correct 22 ms 6748 KB Output is correct
14 Correct 16 ms 6748 KB Output is correct
15 Correct 17 ms 6748 KB Output is correct
16 Correct 15 ms 6748 KB Output is correct
17 Correct 15 ms 6748 KB Output is correct
18 Correct 763 ms 10368 KB Output is correct
19 Correct 777 ms 10792 KB Output is correct
20 Correct 785 ms 10580 KB Output is correct
21 Correct 778 ms 10456 KB Output is correct
22 Correct 788 ms 10616 KB Output is correct
23 Correct 852 ms 10408 KB Output is correct
24 Correct 799 ms 10692 KB Output is correct
25 Correct 808 ms 10616 KB Output is correct
26 Correct 38 ms 6796 KB Output is correct
27 Correct 564 ms 10400 KB Output is correct
28 Correct 572 ms 10504 KB Output is correct
29 Correct 655 ms 9824 KB Output is correct
30 Correct 690 ms 10380 KB Output is correct
31 Correct 533 ms 9336 KB Output is correct
32 Correct 277 ms 7392 KB Output is correct
33 Correct 604 ms 9600 KB Output is correct
34 Correct 541 ms 9352 KB Output is correct
35 Correct 38 ms 6748 KB Output is correct
36 Correct 542 ms 9296 KB Output is correct
37 Correct 536 ms 9280 KB Output is correct
38 Correct 519 ms 9560 KB Output is correct
39 Correct 404 ms 8904 KB Output is correct
40 Correct 429 ms 9052 KB Output is correct
41 Correct 457 ms 9308 KB Output is correct
42 Correct 458 ms 9300 KB Output is correct
43 Correct 1998 ms 11780 KB Output is correct
44 Correct 41 ms 6744 KB Output is correct
45 Correct 140 ms 11520 KB Output is correct
46 Correct 57 ms 11380 KB Output is correct
47 Correct 1504 ms 11988 KB Output is correct
48 Correct 2256 ms 12084 KB Output is correct
49 Correct 1486 ms 12028 KB Output is correct
50 Correct 592 ms 9300 KB Output is correct
51 Correct 650 ms 9208 KB Output is correct
52 Correct 634 ms 9432 KB Output is correct
53 Correct 1186 ms 10552 KB Output is correct
54 Correct 1233 ms 10580 KB Output is correct
55 Correct 1188 ms 10800 KB Output is correct
56 Correct 1408 ms 12248 KB Output is correct
57 Correct 1421 ms 12156 KB Output is correct
58 Correct 1910 ms 11932 KB Output is correct
59 Correct 1882 ms 11736 KB Output is correct
60 Correct 1728 ms 11852 KB Output is correct
61 Correct 1812 ms 11880 KB Output is correct
62 Correct 1382 ms 11344 KB Output is correct
63 Correct 1404 ms 11116 KB Output is correct
64 Correct 1788 ms 11860 KB Output is correct
65 Correct 1305 ms 11104 KB Output is correct
66 Correct 743 ms 10468 KB Output is correct
67 Correct 1132 ms 11836 KB Output is correct
68 Correct 1127 ms 14484 KB Output is correct
69 Correct 1072 ms 11568 KB Output is correct
70 Correct 960 ms 11096 KB Output is correct
71 Correct 989 ms 10756 KB Output is correct
72 Correct 983 ms 10696 KB Output is correct
73 Correct 914 ms 10976 KB Output is correct
74 Correct 940 ms 10672 KB Output is correct
75 Correct 943 ms 10564 KB Output is correct
76 Correct 845 ms 10916 KB Output is correct
77 Correct 873 ms 10408 KB Output is correct
78 Correct 887 ms 10788 KB Output is correct
79 Correct 743 ms 10160 KB Output is correct
80 Correct 775 ms 10068 KB Output is correct
81 Correct 770 ms 10260 KB Output is correct
82 Correct 823 ms 10684 KB Output is correct
83 Correct 808 ms 10760 KB Output is correct
84 Correct 808 ms 10708 KB Output is correct
85 Correct 2357 ms 20716 KB Output is correct
86 Correct 146 ms 11484 KB Output is correct
87 Correct 76 ms 11344 KB Output is correct
88 Correct 1717 ms 13392 KB Output is correct
89 Correct 2320 ms 20496 KB Output is correct
90 Correct 1683 ms 12116 KB Output is correct
91 Correct 836 ms 10580 KB Output is correct
92 Correct 848 ms 10660 KB Output is correct
93 Correct 859 ms 9812 KB Output is correct
94 Correct 1481 ms 11888 KB Output is correct
95 Correct 1426 ms 11996 KB Output is correct
96 Correct 1399 ms 11456 KB Output is correct
97 Correct 1540 ms 12136 KB Output is correct
98 Correct 1623 ms 12264 KB Output is correct
99 Correct 2280 ms 19568 KB Output is correct
100 Correct 2301 ms 19820 KB Output is correct
101 Correct 2185 ms 17352 KB Output is correct
102 Correct 2200 ms 17836 KB Output is correct
103 Correct 1584 ms 11292 KB Output is correct
104 Correct 1610 ms 11064 KB Output is correct
105 Correct 1491 ms 11020 KB Output is correct
106 Correct 1241 ms 10944 KB Output is correct
107 Correct 1456 ms 11356 KB Output is correct
108 Correct 2079 ms 16608 KB Output is correct
109 Correct 1541 ms 10816 KB Output is correct