oj.uz

Submission #967207

# Submission time Handle Problem Language Result Execution time Memory
967207 2024-04-21T13:50:03 Z socpite Bridges (APIO19_bridges) C++14
100 / 100
 2619 ms 24052 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() {
    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:96: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]
   96 |             while(ptr < queries.size() && queries[ptr].first > W[v])solve_query(l, queries[ptr++].second, changed);
      |                   ~~~~^~~~~~~~~~~~~~~~
bridges.cpp:99: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]
   99 |         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 2 ms 6748 KB Output is correct
3 Correct 22 ms 6880 KB Output is correct
4 Correct 9 ms 6744 KB Output is correct
5 Correct 21 ms 6744 KB Output is correct
6 Correct 19 ms 6748 KB Output is correct
7 Correct 20 ms 6744 KB Output is correct
8 Correct 19 ms 6944 KB Output is correct
9 Correct 19 ms 6748 KB Output is correct
10 Correct 18 ms 6748 KB Output is correct
11 Correct 18 ms 6744 KB Output is correct
12 Correct 19 ms 6772 KB Output is correct
13 Correct 21 ms 6748 KB Output is correct
14 Correct 20 ms 6780 KB Output is correct
15 Correct 21 ms 6936 KB Output is correct
16 Correct 18 ms 6868 KB Output is correct
17 Correct 18 ms 7000 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 836 ms 10616 KB Output is correct
2 Correct 832 ms 11972 KB Output is correct
3 Correct 869 ms 12288 KB Output is correct
4 Correct 835 ms 12136 KB Output is correct
5 Correct 834 ms 12112 KB Output is correct
6 Correct 890 ms 12112 KB Output is correct
7 Correct 865 ms 12844 KB Output is correct
8 Correct 863 ms 13136 KB Output is correct
9 Correct 75 ms 8132 KB Output is correct
10 Correct 603 ms 12464 KB Output is correct
11 Correct 660 ms 12456 KB Output is correct
12 Correct 690 ms 12116 KB Output is correct
13 Correct 768 ms 13136 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 594 ms 9288 KB Output is correct
2 Correct 332 ms 9328 KB Output is correct
3 Correct 621 ms 11336 KB Output is correct
4 Correct 588 ms 11580 KB Output is correct
5 Correct 72 ms 8148 KB Output is correct
6 Correct 610 ms 11548 KB Output is correct
7 Correct 589 ms 11676 KB Output is correct
8 Correct 579 ms 11852 KB Output is correct
9 Correct 478 ms 11180 KB Output is correct
10 Correct 475 ms 11600 KB Output is correct
11 Correct 513 ms 11812 KB Output is correct
12 Correct 502 ms 11588 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2005 ms 11896 KB Output is correct
2 Correct 78 ms 8128 KB Output is correct
3 Correct 164 ms 13296 KB Output is correct
4 Correct 105 ms 13384 KB Output is correct
5 Correct 1549 ms 14568 KB Output is correct
6 Correct 2012 ms 15860 KB Output is correct
7 Correct 1537 ms 14352 KB Output is correct
8 Correct 693 ms 12016 KB Output is correct
9 Correct 679 ms 12012 KB Output is correct
10 Correct 681 ms 11928 KB Output is correct
11 Correct 1277 ms 13952 KB Output is correct
12 Correct 1202 ms 14004 KB Output is correct
13 Correct 1273 ms 13776 KB Output is correct
14 Correct 1397 ms 14292 KB Output is correct
15 Correct 1454 ms 14312 KB Output is correct
16 Correct 1943 ms 15760 KB Output is correct
17 Correct 1964 ms 15468 KB Output is correct
18 Correct 1750 ms 15684 KB Output is correct
19 Correct 1850 ms 15908 KB Output is correct
20 Correct 1458 ms 14572 KB Output is correct
21 Correct 1447 ms 14316 KB Output is correct
22 Correct 1883 ms 15488 KB Output is correct
23 Correct 1383 ms 13648 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 836 ms 10616 KB Output is correct
2 Correct 832 ms 11972 KB Output is correct
3 Correct 869 ms 12288 KB Output is correct
4 Correct 835 ms 12136 KB Output is correct
5 Correct 834 ms 12112 KB Output is correct
6 Correct 890 ms 12112 KB Output is correct
7 Correct 865 ms 12844 KB Output is correct
8 Correct 863 ms 13136 KB Output is correct
9 Correct 75 ms 8132 KB Output is correct
10 Correct 603 ms 12464 KB Output is correct
11 Correct 660 ms 12456 KB Output is correct
12 Correct 690 ms 12116 KB Output is correct
13 Correct 768 ms 13136 KB Output is correct
14 Correct 594 ms 9288 KB Output is correct
15 Correct 332 ms 9328 KB Output is correct
16 Correct 621 ms 11336 KB Output is correct
17 Correct 588 ms 11580 KB Output is correct
18 Correct 72 ms 8148 KB Output is correct
19 Correct 610 ms 11548 KB Output is correct
20 Correct 589 ms 11676 KB Output is correct
21 Correct 579 ms 11852 KB Output is correct
22 Correct 478 ms 11180 KB Output is correct
23 Correct 475 ms 11600 KB Output is correct
24 Correct 513 ms 11812 KB Output is correct
25 Correct 502 ms 11588 KB Output is correct
26 Correct 802 ms 13420 KB Output is correct
27 Correct 1209 ms 14704 KB Output is correct
28 Correct 1214 ms 17324 KB Output is correct
29 Correct 1091 ms 14572 KB Output is correct
30 Correct 1012 ms 13412 KB Output is correct
31 Correct 1031 ms 13148 KB Output is correct
32 Correct 1048 ms 13140 KB Output is correct
33 Correct 975 ms 13392 KB Output is correct
34 Correct 995 ms 13340 KB Output is correct
35 Correct 1014 ms 13324 KB Output is correct
36 Correct 916 ms 13680 KB Output is correct
37 Correct 939 ms 13140 KB Output is correct
38 Correct 961 ms 13396 KB Output is correct
39 Correct 811 ms 12936 KB Output is correct
40 Correct 823 ms 13396 KB Output is correct
41 Correct 834 ms 13140 KB Output is correct
42 Correct 833 ms 13724 KB Output is correct
43 Correct 851 ms 13496 KB Output is correct
44 Correct 879 ms 13140 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 2 ms 6748 KB Output is correct
3 Correct 22 ms 6880 KB Output is correct
4 Correct 9 ms 6744 KB Output is correct
5 Correct 21 ms 6744 KB Output is correct
6 Correct 19 ms 6748 KB Output is correct
7 Correct 20 ms 6744 KB Output is correct
8 Correct 19 ms 6944 KB Output is correct
9 Correct 19 ms 6748 KB Output is correct
10 Correct 18 ms 6748 KB Output is correct
11 Correct 18 ms 6744 KB Output is correct
12 Correct 19 ms 6772 KB Output is correct
13 Correct 21 ms 6748 KB Output is correct
14 Correct 20 ms 6780 KB Output is correct
15 Correct 21 ms 6936 KB Output is correct
16 Correct 18 ms 6868 KB Output is correct
17 Correct 18 ms 7000 KB Output is correct
18 Correct 836 ms 10616 KB Output is correct
19 Correct 832 ms 11972 KB Output is correct
20 Correct 869 ms 12288 KB Output is correct
21 Correct 835 ms 12136 KB Output is correct
22 Correct 834 ms 12112 KB Output is correct
23 Correct 890 ms 12112 KB Output is correct
24 Correct 865 ms 12844 KB Output is correct
25 Correct 863 ms 13136 KB Output is correct
26 Correct 75 ms 8132 KB Output is correct
27 Correct 603 ms 12464 KB Output is correct
28 Correct 660 ms 12456 KB Output is correct
29 Correct 690 ms 12116 KB Output is correct
30 Correct 768 ms 13136 KB Output is correct
31 Correct 594 ms 9288 KB Output is correct
32 Correct 332 ms 9328 KB Output is correct
33 Correct 621 ms 11336 KB Output is correct
34 Correct 588 ms 11580 KB Output is correct
35 Correct 72 ms 8148 KB Output is correct
36 Correct 610 ms 11548 KB Output is correct
37 Correct 589 ms 11676 KB Output is correct
38 Correct 579 ms 11852 KB Output is correct
39 Correct 478 ms 11180 KB Output is correct
40 Correct 475 ms 11600 KB Output is correct
41 Correct 513 ms 11812 KB Output is correct
42 Correct 502 ms 11588 KB Output is correct
43 Correct 2005 ms 11896 KB Output is correct
44 Correct 78 ms 8128 KB Output is correct
45 Correct 164 ms 13296 KB Output is correct
46 Correct 105 ms 13384 KB Output is correct
47 Correct 1549 ms 14568 KB Output is correct
48 Correct 2012 ms 15860 KB Output is correct
49 Correct 1537 ms 14352 KB Output is correct
50 Correct 693 ms 12016 KB Output is correct
51 Correct 679 ms 12012 KB Output is correct
52 Correct 681 ms 11928 KB Output is correct
53 Correct 1277 ms 13952 KB Output is correct
54 Correct 1202 ms 14004 KB Output is correct
55 Correct 1273 ms 13776 KB Output is correct
56 Correct 1397 ms 14292 KB Output is correct
57 Correct 1454 ms 14312 KB Output is correct
58 Correct 1943 ms 15760 KB Output is correct
59 Correct 1964 ms 15468 KB Output is correct
60 Correct 1750 ms 15684 KB Output is correct
61 Correct 1850 ms 15908 KB Output is correct
62 Correct 1458 ms 14572 KB Output is correct
63 Correct 1447 ms 14316 KB Output is correct
64 Correct 1883 ms 15488 KB Output is correct
65 Correct 1383 ms 13648 KB Output is correct
66 Correct 802 ms 13420 KB Output is correct
67 Correct 1209 ms 14704 KB Output is correct
68 Correct 1214 ms 17324 KB Output is correct
69 Correct 1091 ms 14572 KB Output is correct
70 Correct 1012 ms 13412 KB Output is correct
71 Correct 1031 ms 13148 KB Output is correct
72 Correct 1048 ms 13140 KB Output is correct
73 Correct 975 ms 13392 KB Output is correct
74 Correct 995 ms 13340 KB Output is correct
75 Correct 1014 ms 13324 KB Output is correct
76 Correct 916 ms 13680 KB Output is correct
77 Correct 939 ms 13140 KB Output is correct
78 Correct 961 ms 13396 KB Output is correct
79 Correct 811 ms 12936 KB Output is correct
80 Correct 823 ms 13396 KB Output is correct
81 Correct 834 ms 13140 KB Output is correct
82 Correct 833 ms 13724 KB Output is correct
83 Correct 851 ms 13496 KB Output is correct
84 Correct 879 ms 13140 KB Output is correct
85 Correct 2449 ms 24052 KB Output is correct
86 Correct 208 ms 13336 KB Output is correct
87 Correct 127 ms 13456 KB Output is correct
88 Correct 1903 ms 14680 KB Output is correct
89 Correct 2501 ms 24004 KB Output is correct
90 Correct 1809 ms 14828 KB Output is correct
91 Correct 915 ms 13156 KB Output is correct
92 Correct 922 ms 13336 KB Output is correct
93 Correct 910 ms 12492 KB Output is correct
94 Correct 1629 ms 14956 KB Output is correct
95 Correct 1513 ms 15360 KB Output is correct
96 Correct 1486 ms 13908 KB Output is correct
97 Correct 1645 ms 14372 KB Output is correct
98 Correct 1708 ms 14708 KB Output is correct
99 Correct 2409 ms 23308 KB Output is correct
100 Correct 2552 ms 23016 KB Output is correct
101 Correct 2619 ms 20972 KB Output is correct
102 Correct 2289 ms 21508 KB Output is correct
103 Correct 1793 ms 14264 KB Output is correct
104 Correct 1773 ms 14432 KB Output is correct
105 Correct 1592 ms 14544 KB Output is correct
106 Correct 1383 ms 13884 KB Output is correct
107 Correct 1537 ms 14416 KB Output is correct
108 Correct 2199 ms 20372 KB Output is correct
109 Correct 1614 ms 13000 KB Output is correct