oj.uz

Submission #975796

# Submission time Handle Problem Language Result Execution time Memory
975796 2024-05-05T21:26:55 Z Unforgettablepl Bridges (APIO19_bridges) C++17
100 / 100
 2564 ms 15176 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int sqrtq = 500;

struct UFDS {
    vector<int> p, sz;
    // stores previous unites
    vector<pair<int &, int>> history;
    UFDS(int n) : p(n), sz(n, 1) { iota(p.begin(), p.end(), 0); }

    int get(int x) { return x == p[x] ? x : get(p[x]); }

    void unite(int a, int b) {
        a = get(a);
        b = get(b);
        if (a == b) { return; }
        if (sz[a] < sz[b]) { swap(a, b); }

        // save this unite operation
        history.emplace_back(sz[a], sz[a]);
        history.emplace_back(p[b], p[b]);

        p[b] = a;
        sz[a] += sz[b];
    }

    int snapshot() const { return history.size(); }

    void rollback(int until) {
        while (snapshot() > until) {
            history.back().first = history.back().second;
            history.pop_back();
        }
    }
};

pair<int,pair<int,int>> edgelist[100001];
int n,m;

void answer(vector<pair<int,pair<int,int>>> &updates,vector<tuple<int,int,int>> &queries){
    set<int> updated;
    for(auto&i:updates)updated.insert(i.second.first);
    vector<pair<int,pair<int,int>>> edges;
    for(int i=1;i<=m;i++)if(updated.count(i)==0)edges.emplace_back(edgelist[i]);
    sort(edges.rbegin(),edges.rend());
    sort(queries.rbegin(),queries.rend());
    sort(updates.begin(), updates.end(),[](pair<int,pair<int,int>> a, pair<int,pair<int,int>> b){
        return a.second.first==b.second.first ? a.first<b.first : a.second.first<b.second.first;
    });
    auto iter = edges.begin();
    UFDS dsu(50001);
    vector<pair<int,int>> ans;
    for(auto[wt,tim,pos]:queries){
        while(iter!=edges.end() and iter->first>=wt){dsu.unite(iter->second.first,iter->second.second);iter++;}
        int snap = dsu.snapshot();
        for(int i=0;i<updates.size();i++){
            if(i!=updates.size()-1 and updates[i].second.first==updates[i+1].second.first and updates[i+1].first<tim)continue;
            if(i!=0 and updates[i].second.first==updates[i-1].second.first and updates[i].first>tim)continue;
            auto [timu,up] = updates[i];
            if((timu<tim and up.second>=wt) or (tim<timu and edgelist[up.first].first>=wt))dsu.unite(edgelist[up.first].second.first,edgelist[up.first].second.second);
        }
        ans.emplace_back(tim,dsu.sz[dsu.get(pos)]);
        dsu.rollback(snap);
    }
    for(auto[tim,up]:updates)edgelist[up.first].first=up.second;
    sort(ans.begin(), ans.end());
    for(auto[tim,an]:ans)cout<<an<<'\n';
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> m;
    for(int i=1;i<=m;i++)cin>>edgelist[i].second.first>>edgelist[i].second.second>>edgelist[i].first;
    int q;
    cin >> q;
    int curr = 0;
    vector<pair<int,pair<int,int>>> updates;
    vector<tuple<int,int,int>> queries;
    for(int i=1;i<=q;i++){
        int type,a,b;cin>>type>>a>>b;
        if(type==1){
            updates.emplace_back(i,make_pair(a,b));
            curr++;
        } else {
            queries.emplace_back(b,i,a);
        }
        if(curr==sqrtq){
            answer(updates,queries);
            updates.clear();
            queries.clear();
            curr=0;
        }
    }
    answer(updates,queries);
}

Compilation message

bridges.cpp: In function 'void answer(std::vector<std::pair<long long int, std::pair<long long int, long long int> > >&, std::vector<std::tuple<long long int, long long int, long long int> >&)':
bridges.cpp:60:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int i=0;i<updates.size();i++){
      |                     ~^~~~~~~~~~~~~~~
bridges.cpp:61:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |             if(i!=updates.size()-1 and updates[i].second.first==updates[i+1].second.first and updates[i+1].first<tim)continue;
      |                ~^~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 26 ms 1372 KB Output is correct
4 Correct 4 ms 1880 KB Output is correct
5 Correct 17 ms 1352 KB Output is correct
6 Correct 15 ms 1324 KB Output is correct
7 Correct 16 ms 1376 KB Output is correct
8 Correct 17 ms 1328 KB Output is correct
9 Correct 16 ms 1312 KB Output is correct
10 Correct 17 ms 1324 KB Output is correct
11 Correct 18 ms 1324 KB Output is correct
12 Correct 18 ms 1328 KB Output is correct
13 Correct 25 ms 1360 KB Output is correct
14 Correct 20 ms 1348 KB Output is correct
15 Correct 19 ms 1304 KB Output is correct
16 Correct 14 ms 1336 KB Output is correct
17 Correct 15 ms 1356 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1020 ms 9300 KB Output is correct
2 Correct 1034 ms 8952 KB Output is correct
3 Correct 983 ms 8804 KB Output is correct
4 Correct 996 ms 8720 KB Output is correct
5 Correct 951 ms 8796 KB Output is correct
6 Correct 1203 ms 9060 KB Output is correct
7 Correct 1208 ms 9328 KB Output is correct
8 Correct 1257 ms 9052 KB Output is correct
9 Correct 38 ms 7356 KB Output is correct
10 Correct 846 ms 9104 KB Output is correct
11 Correct 878 ms 8964 KB Output is correct
12 Correct 1185 ms 9212 KB Output is correct
13 Correct 1210 ms 8864 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 717 ms 6680 KB Output is correct
2 Correct 438 ms 4716 KB Output is correct
3 Correct 729 ms 6792 KB Output is correct
4 Correct 740 ms 6560 KB Output is correct
5 Correct 39 ms 7208 KB Output is correct
6 Correct 751 ms 6844 KB Output is correct
7 Correct 674 ms 6752 KB Output is correct
8 Correct 614 ms 6776 KB Output is correct
9 Correct 636 ms 6896 KB Output is correct
10 Correct 502 ms 6664 KB Output is correct
11 Correct 751 ms 6584 KB Output is correct
12 Correct 733 ms 6584 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 14136 KB Output is correct
2 Correct 37 ms 7368 KB Output is correct
3 Correct 31 ms 6592 KB Output is correct
4 Correct 32 ms 6604 KB Output is correct
5 Correct 75 ms 14092 KB Output is correct
6 Correct 71 ms 14648 KB Output is correct
7 Correct 62 ms 14136 KB Output is correct
8 Correct 55 ms 12728 KB Output is correct
9 Correct 55 ms 12988 KB Output is correct
10 Correct 54 ms 12728 KB Output is correct
11 Correct 77 ms 12932 KB Output is correct
12 Correct 63 ms 12616 KB Output is correct
13 Correct 62 ms 13368 KB Output is correct
14 Correct 64 ms 13892 KB Output is correct
15 Correct 61 ms 14024 KB Output is correct
16 Correct 74 ms 14416 KB Output is correct
17 Correct 73 ms 15176 KB Output is correct
18 Correct 70 ms 13496 KB Output is correct
19 Correct 72 ms 13628 KB Output is correct
20 Correct 66 ms 13368 KB Output is correct
21 Correct 65 ms 13376 KB Output is correct
22 Correct 70 ms 14000 KB Output is correct
23 Correct 58 ms 13056 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1020 ms 9300 KB Output is correct
2 Correct 1034 ms 8952 KB Output is correct
3 Correct 983 ms 8804 KB Output is correct
4 Correct 996 ms 8720 KB Output is correct
5 Correct 951 ms 8796 KB Output is correct
6 Correct 1203 ms 9060 KB Output is correct
7 Correct 1208 ms 9328 KB Output is correct
8 Correct 1257 ms 9052 KB Output is correct
9 Correct 38 ms 7356 KB Output is correct
10 Correct 846 ms 9104 KB Output is correct
11 Correct 878 ms 8964 KB Output is correct
12 Correct 1185 ms 9212 KB Output is correct
13 Correct 1210 ms 8864 KB Output is correct
14 Correct 717 ms 6680 KB Output is correct
15 Correct 438 ms 4716 KB Output is correct
16 Correct 729 ms 6792 KB Output is correct
17 Correct 740 ms 6560 KB Output is correct
18 Correct 39 ms 7208 KB Output is correct
19 Correct 751 ms 6844 KB Output is correct
20 Correct 674 ms 6752 KB Output is correct
21 Correct 614 ms 6776 KB Output is correct
22 Correct 636 ms 6896 KB Output is correct
23 Correct 502 ms 6664 KB Output is correct
24 Correct 751 ms 6584 KB Output is correct
25 Correct 733 ms 6584 KB Output is correct
26 Correct 1034 ms 9008 KB Output is correct
27 Correct 1071 ms 8888 KB Output is correct
28 Correct 1037 ms 8916 KB Output is correct
29 Correct 851 ms 9124 KB Output is correct
30 Correct 1151 ms 8880 KB Output is correct
31 Correct 1134 ms 8956 KB Output is correct
32 Correct 1132 ms 8944 KB Output is correct
33 Correct 1051 ms 9392 KB Output is correct
34 Correct 1063 ms 8992 KB Output is correct
35 Correct 1047 ms 8744 KB Output is correct
36 Correct 872 ms 9012 KB Output is correct
37 Correct 865 ms 9028 KB Output is correct
38 Correct 855 ms 8940 KB Output is correct
39 Correct 482 ms 8880 KB Output is correct
40 Correct 472 ms 8700 KB Output is correct
41 Correct 465 ms 8940 KB Output is correct
42 Correct 1140 ms 9060 KB Output is correct
43 Correct 1165 ms 9064 KB Output is correct
44 Correct 1158 ms 8912 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1116 KB Output is correct
2 Correct 1 ms 1116 KB Output is correct
3 Correct 26 ms 1372 KB Output is correct
4 Correct 4 ms 1880 KB Output is correct
5 Correct 17 ms 1352 KB Output is correct
6 Correct 15 ms 1324 KB Output is correct
7 Correct 16 ms 1376 KB Output is correct
8 Correct 17 ms 1328 KB Output is correct
9 Correct 16 ms 1312 KB Output is correct
10 Correct 17 ms 1324 KB Output is correct
11 Correct 18 ms 1324 KB Output is correct
12 Correct 18 ms 1328 KB Output is correct
13 Correct 25 ms 1360 KB Output is correct
14 Correct 20 ms 1348 KB Output is correct
15 Correct 19 ms 1304 KB Output is correct
16 Correct 14 ms 1336 KB Output is correct
17 Correct 15 ms 1356 KB Output is correct
18 Correct 1020 ms 9300 KB Output is correct
19 Correct 1034 ms 8952 KB Output is correct
20 Correct 983 ms 8804 KB Output is correct
21 Correct 996 ms 8720 KB Output is correct
22 Correct 951 ms 8796 KB Output is correct
23 Correct 1203 ms 9060 KB Output is correct
24 Correct 1208 ms 9328 KB Output is correct
25 Correct 1257 ms 9052 KB Output is correct
26 Correct 38 ms 7356 KB Output is correct
27 Correct 846 ms 9104 KB Output is correct
28 Correct 878 ms 8964 KB Output is correct
29 Correct 1185 ms 9212 KB Output is correct
30 Correct 1210 ms 8864 KB Output is correct
31 Correct 717 ms 6680 KB Output is correct
32 Correct 438 ms 4716 KB Output is correct
33 Correct 729 ms 6792 KB Output is correct
34 Correct 740 ms 6560 KB Output is correct
35 Correct 39 ms 7208 KB Output is correct
36 Correct 751 ms 6844 KB Output is correct
37 Correct 674 ms 6752 KB Output is correct
38 Correct 614 ms 6776 KB Output is correct
39 Correct 636 ms 6896 KB Output is correct
40 Correct 502 ms 6664 KB Output is correct
41 Correct 751 ms 6584 KB Output is correct
42 Correct 733 ms 6584 KB Output is correct
43 Correct 74 ms 14136 KB Output is correct
44 Correct 37 ms 7368 KB Output is correct
45 Correct 31 ms 6592 KB Output is correct
46 Correct 32 ms 6604 KB Output is correct
47 Correct 75 ms 14092 KB Output is correct
48 Correct 71 ms 14648 KB Output is correct
49 Correct 62 ms 14136 KB Output is correct
50 Correct 55 ms 12728 KB Output is correct
51 Correct 55 ms 12988 KB Output is correct
52 Correct 54 ms 12728 KB Output is correct
53 Correct 77 ms 12932 KB Output is correct
54 Correct 63 ms 12616 KB Output is correct
55 Correct 62 ms 13368 KB Output is correct
56 Correct 64 ms 13892 KB Output is correct
57 Correct 61 ms 14024 KB Output is correct
58 Correct 74 ms 14416 KB Output is correct
59 Correct 73 ms 15176 KB Output is correct
60 Correct 70 ms 13496 KB Output is correct
61 Correct 72 ms 13628 KB Output is correct
62 Correct 66 ms 13368 KB Output is correct
63 Correct 65 ms 13376 KB Output is correct
64 Correct 70 ms 14000 KB Output is correct
65 Correct 58 ms 13056 KB Output is correct
66 Correct 1034 ms 9008 KB Output is correct
67 Correct 1071 ms 8888 KB Output is correct
68 Correct 1037 ms 8916 KB Output is correct
69 Correct 851 ms 9124 KB Output is correct
70 Correct 1151 ms 8880 KB Output is correct
71 Correct 1134 ms 8956 KB Output is correct
72 Correct 1132 ms 8944 KB Output is correct
73 Correct 1051 ms 9392 KB Output is correct
74 Correct 1063 ms 8992 KB Output is correct
75 Correct 1047 ms 8744 KB Output is correct
76 Correct 872 ms 9012 KB Output is correct
77 Correct 865 ms 9028 KB Output is correct
78 Correct 855 ms 8940 KB Output is correct
79 Correct 482 ms 8880 KB Output is correct
80 Correct 472 ms 8700 KB Output is correct
81 Correct 465 ms 8940 KB Output is correct
82 Correct 1140 ms 9060 KB Output is correct
83 Correct 1165 ms 9064 KB Output is correct
84 Correct 1158 ms 8912 KB Output is correct
85 Correct 1598 ms 10636 KB Output is correct
86 Correct 154 ms 8776 KB Output is correct
87 Correct 156 ms 8624 KB Output is correct
88 Correct 1655 ms 10624 KB Output is correct
89 Correct 1686 ms 10372 KB Output is correct
90 Correct 1679 ms 10308 KB Output is correct
91 Correct 1138 ms 8660 KB Output is correct
92 Correct 1090 ms 9020 KB Output is correct
93 Correct 1361 ms 9644 KB Output is correct
94 Correct 1468 ms 9308 KB Output is correct
95 Correct 1397 ms 10180 KB Output is correct
96 Correct 1476 ms 9932 KB Output is correct
97 Correct 715 ms 10360 KB Output is correct
98 Correct 2564 ms 10080 KB Output is correct
99 Correct 1712 ms 14052 KB Output is correct
100 Correct 1713 ms 13940 KB Output is correct
101 Correct 1691 ms 14956 KB Output is correct
102 Correct 1664 ms 14872 KB Output is correct
103 Correct 1643 ms 13220 KB Output is correct
104 Correct 1628 ms 13744 KB Output is correct
105 Correct 2044 ms 12972 KB Output is correct
106 Correct 1842 ms 13416 KB Output is correct
107 Correct 1112 ms 14104 KB Output is correct
108 Correct 1704 ms 13452 KB Output is correct
109 Correct 1502 ms 12120 KB Output is correct