oj.uz

Submission #716883

# Submission time Handle Problem Language Result Execution time Memory
716883 2023-03-31T09:33:38 Z YENGOYAN Bridges (APIO19_bridges) C++17
100 / 100
 2489 ms 36240 KB 
/*
                                    //\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\\
                                    \\                                    //
                                    //  271828___182845__904523__53602__  \\
                                    \\  87___47____13______52____66__24_  //
                                    //  97___75____72______47____09___36  \\
                                    \\  999595_____74______96____69___67  //
                                    //  62___77____24______07____66__30_  \\
                                    \\  35___35____47______59____45713__  //
                                    //                                    \\
                                    \\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\//
*/
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>
#include <functional>

using namespace std;
using LL = long long;
const int N = 1e5 + 5;
const LL mod = 1e9 + 7, inf = 1e18;

vector<int> dx = { 1, 0, -1, 0, 1, -1, 1, -1 };
vector<int> dy = { 0, -1, 0, 1, -1, 1, 1, -1 };

void solve() {
  int n, m; cin >> n >> m;
  vector<int> u(m + 1), v(m + 1), w(m + 1);
  for(int i = 1; i <= m; ++i){
    cin >> u[i] >> v[i] >> w[i];
  }
  int q; cin >> q;
  vector<int> t(q+1), x(q+1), y(q+1);
  for(int i = 1; i <= q; ++i){
    cin >> t[i] >> x[i] >> y[i];
  }
  vector<int> par(n + 1), sz(n + 1);
  stack<int> st;
  for(int i = 1; i <= n; ++i){
    sz[i] = 1;
    par[i] = i;
  }
  function<int(int)> get = [&](int u){
    while(par[u] != u){
      u = par[u];
    }
    return u;
  };
  function<void(int, int)> union_sets = [&](int u, int v){
    int a = get(u), b = get(v);
    if(a == b) {
      return;
    }
    if(sz[a] < sz[b]){
      swap(a, b);
    }
    st.push(b);
    sz[a] += sz[b];
    par[b] = a;
  };
  function<void(int)> rollback = [&](int x){
    while(st.size() > x){
      int node = st.top();
      st.pop();
      sz[par[node]] -= sz[node];
      par[node] = node;
//      st.pop();
    }
  };
  vector<vector<int>> to_join(805);
  int block_size = 800;
  vector<int> ans(q + 1);
  for(int i = 1; i <= q; i += block_size){
    for(int i = 1; i <= n; ++i){
      par[i] = i;
      sz[i] = 1;
    }
    int l = i, r = min(q, i + block_size - 1);
    vector<int> qry, upd, unch;
    vector<bool> vis(m + 1);
    for(int j = l; j <= r; ++j){
      if(t[j] == 1){
        upd.push_back(j);
        vis[x[j]] = 1;
      }
      else{
        qry.push_back(j);
      }
    }
    for(int j = 1; j <= m; ++j){
      if(!vis[j]){
        unch.push_back(j);
      }
    }
    for(int j = l; j <= r; ++j){
      if(t[j] == 1){
        w[x[j]] = y[j];
      }
      else{
        to_join[j - l].clear();
        for(int &k : upd){
          if(w[x[k]] >= y[j]){
            to_join[j - l].push_back(x[k]);
          }
        }
      }
    }
    sort(qry.begin(), qry.end(), [&](int a, int b) {return y[a] > y[b];});
    sort(unch.begin(), unch.end(), [&](int a, int b) {return w[a] > w[b]; });
    int idx = 0;
    for(int &j : qry){
      while(idx < unch.size() && w[unch[idx]] >= y[j]){
        union_sets(u[unch[idx]], v[unch[idx]]);
        ++idx;
      }
      int siz = st.size();
      for(int &k : to_join[j - l]){
        union_sets(u[k], v[k]);
      }
//      cout << j << "\n";
      ans[j] = sz[get(x[j])];
      rollback(siz);
    }
  }

  for(int i = 1; i <= q; ++i){
    if(t[i] == 2){
      cout << ans[i] << "\n";
    }
  }

}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  //int t; cin >> t; while (t--)
    solve();

}

Compilation message

bridges.cpp: In lambda function:
bridges.cpp:80:21: warning: comparison of integer expressions of different signedness: 'std::stack<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   80 |     while(st.size() > x){
      |           ~~~~~~~~~~^~~
bridges.cpp: In function 'void solve()':
bridges.cpp:130:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |       while(idx < unch.size() && w[unch[idx]] >= y[j]){
      |             ~~~~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 37 ms 2124 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 40 ms 2308 KB Output is correct
6 Correct 35 ms 2144 KB Output is correct
7 Correct 40 ms 2160 KB Output is correct
8 Correct 38 ms 2228 KB Output is correct
9 Correct 53 ms 2164 KB Output is correct
10 Correct 38 ms 2320 KB Output is correct
11 Correct 38 ms 2236 KB Output is correct
12 Correct 50 ms 2240 KB Output is correct
13 Correct 47 ms 2240 KB Output is correct
14 Correct 45 ms 2288 KB Output is correct
15 Correct 44 ms 2272 KB Output is correct
16 Correct 44 ms 2256 KB Output is correct
17 Correct 46 ms 2248 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1545 ms 30200 KB Output is correct
2 Correct 1546 ms 30216 KB Output is correct
3 Correct 1533 ms 30328 KB Output is correct
4 Correct 1560 ms 30340 KB Output is correct
5 Correct 1589 ms 30232 KB Output is correct
6 Correct 2287 ms 31316 KB Output is correct
7 Correct 2254 ms 32948 KB Output is correct
8 Correct 2286 ms 32984 KB Output is correct
9 Correct 43 ms 3396 KB Output is correct
10 Correct 1352 ms 32004 KB Output is correct
11 Correct 1219 ms 32036 KB Output is correct
12 Correct 1371 ms 32088 KB Output is correct
13 Correct 1482 ms 34504 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1208 ms 20992 KB Output is correct
2 Correct 903 ms 7900 KB Output is correct
3 Correct 1419 ms 22060 KB Output is correct
4 Correct 1192 ms 23500 KB Output is correct
5 Correct 34 ms 3404 KB Output is correct
6 Correct 1339 ms 23572 KB Output is correct
7 Correct 1097 ms 23300 KB Output is correct
8 Correct 967 ms 23304 KB Output is correct
9 Correct 821 ms 22432 KB Output is correct
10 Correct 777 ms 22440 KB Output is correct
11 Correct 859 ms 24616 KB Output is correct
12 Correct 757 ms 24512 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1976 ms 29804 KB Output is correct
2 Correct 41 ms 3404 KB Output is correct
3 Correct 200 ms 4448 KB Output is correct
4 Correct 98 ms 4536 KB Output is correct
5 Correct 1045 ms 32092 KB Output is correct
6 Correct 1892 ms 33748 KB Output is correct
7 Correct 1006 ms 32060 KB Output is correct
8 Correct 984 ms 31624 KB Output is correct
9 Correct 964 ms 31960 KB Output is correct
10 Correct 967 ms 31592 KB Output is correct
11 Correct 1492 ms 32820 KB Output is correct
12 Correct 1416 ms 33064 KB Output is correct
13 Correct 1473 ms 33120 KB Output is correct
14 Correct 933 ms 32180 KB Output is correct
15 Correct 977 ms 32184 KB Output is correct
16 Correct 1959 ms 33800 KB Output is correct
17 Correct 1908 ms 33784 KB Output is correct
18 Correct 1902 ms 34052 KB Output is correct
19 Correct 1897 ms 34108 KB Output is correct
20 Correct 1628 ms 33396 KB Output is correct
21 Correct 1578 ms 33264 KB Output is correct
22 Correct 1848 ms 33316 KB Output is correct
23 Correct 1092 ms 29492 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1545 ms 30200 KB Output is correct
2 Correct 1546 ms 30216 KB Output is correct
3 Correct 1533 ms 30328 KB Output is correct
4 Correct 1560 ms 30340 KB Output is correct
5 Correct 1589 ms 30232 KB Output is correct
6 Correct 2287 ms 31316 KB Output is correct
7 Correct 2254 ms 32948 KB Output is correct
8 Correct 2286 ms 32984 KB Output is correct
9 Correct 43 ms 3396 KB Output is correct
10 Correct 1352 ms 32004 KB Output is correct
11 Correct 1219 ms 32036 KB Output is correct
12 Correct 1371 ms 32088 KB Output is correct
13 Correct 1482 ms 34504 KB Output is correct
14 Correct 1208 ms 20992 KB Output is correct
15 Correct 903 ms 7900 KB Output is correct
16 Correct 1419 ms 22060 KB Output is correct
17 Correct 1192 ms 23500 KB Output is correct
18 Correct 34 ms 3404 KB Output is correct
19 Correct 1339 ms 23572 KB Output is correct
20 Correct 1097 ms 23300 KB Output is correct
21 Correct 967 ms 23304 KB Output is correct
22 Correct 821 ms 22432 KB Output is correct
23 Correct 777 ms 22440 KB Output is correct
24 Correct 859 ms 24616 KB Output is correct
25 Correct 757 ms 24512 KB Output is correct
26 Correct 1503 ms 33092 KB Output is correct
27 Correct 1908 ms 32968 KB Output is correct
28 Correct 1578 ms 33324 KB Output is correct
29 Correct 1171 ms 32968 KB Output is correct
30 Correct 1796 ms 32928 KB Output is correct
31 Correct 1824 ms 33040 KB Output is correct
32 Correct 1856 ms 33072 KB Output is correct
33 Correct 1617 ms 33012 KB Output is correct
34 Correct 1643 ms 33020 KB Output is correct
35 Correct 1564 ms 33248 KB Output is correct
36 Correct 1210 ms 32900 KB Output is correct
37 Correct 1212 ms 32936 KB Output is correct
38 Correct 1210 ms 32912 KB Output is correct
39 Correct 1039 ms 32016 KB Output is correct
40 Correct 1014 ms 31964 KB Output is correct
41 Correct 1058 ms 32004 KB Output is correct
42 Correct 999 ms 33084 KB Output is correct
43 Correct 993 ms 32996 KB Output is correct
44 Correct 1000 ms 32696 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 37 ms 2124 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 40 ms 2308 KB Output is correct
6 Correct 35 ms 2144 KB Output is correct
7 Correct 40 ms 2160 KB Output is correct
8 Correct 38 ms 2228 KB Output is correct
9 Correct 53 ms 2164 KB Output is correct
10 Correct 38 ms 2320 KB Output is correct
11 Correct 38 ms 2236 KB Output is correct
12 Correct 50 ms 2240 KB Output is correct
13 Correct 47 ms 2240 KB Output is correct
14 Correct 45 ms 2288 KB Output is correct
15 Correct 44 ms 2272 KB Output is correct
16 Correct 44 ms 2256 KB Output is correct
17 Correct 46 ms 2248 KB Output is correct
18 Correct 1545 ms 30200 KB Output is correct
19 Correct 1546 ms 30216 KB Output is correct
20 Correct 1533 ms 30328 KB Output is correct
21 Correct 1560 ms 30340 KB Output is correct
22 Correct 1589 ms 30232 KB Output is correct
23 Correct 2287 ms 31316 KB Output is correct
24 Correct 2254 ms 32948 KB Output is correct
25 Correct 2286 ms 32984 KB Output is correct
26 Correct 43 ms 3396 KB Output is correct
27 Correct 1352 ms 32004 KB Output is correct
28 Correct 1219 ms 32036 KB Output is correct
29 Correct 1371 ms 32088 KB Output is correct
30 Correct 1482 ms 34504 KB Output is correct
31 Correct 1208 ms 20992 KB Output is correct
32 Correct 903 ms 7900 KB Output is correct
33 Correct 1419 ms 22060 KB Output is correct
34 Correct 1192 ms 23500 KB Output is correct
35 Correct 34 ms 3404 KB Output is correct
36 Correct 1339 ms 23572 KB Output is correct
37 Correct 1097 ms 23300 KB Output is correct
38 Correct 967 ms 23304 KB Output is correct
39 Correct 821 ms 22432 KB Output is correct
40 Correct 777 ms 22440 KB Output is correct
41 Correct 859 ms 24616 KB Output is correct
42 Correct 757 ms 24512 KB Output is correct
43 Correct 1976 ms 29804 KB Output is correct
44 Correct 41 ms 3404 KB Output is correct
45 Correct 200 ms 4448 KB Output is correct
46 Correct 98 ms 4536 KB Output is correct
47 Correct 1045 ms 32092 KB Output is correct
48 Correct 1892 ms 33748 KB Output is correct
49 Correct 1006 ms 32060 KB Output is correct
50 Correct 984 ms 31624 KB Output is correct
51 Correct 964 ms 31960 KB Output is correct
52 Correct 967 ms 31592 KB Output is correct
53 Correct 1492 ms 32820 KB Output is correct
54 Correct 1416 ms 33064 KB Output is correct
55 Correct 1473 ms 33120 KB Output is correct
56 Correct 933 ms 32180 KB Output is correct
57 Correct 977 ms 32184 KB Output is correct
58 Correct 1959 ms 33800 KB Output is correct
59 Correct 1908 ms 33784 KB Output is correct
60 Correct 1902 ms 34052 KB Output is correct
61 Correct 1897 ms 34108 KB Output is correct
62 Correct 1628 ms 33396 KB Output is correct
63 Correct 1578 ms 33264 KB Output is correct
64 Correct 1848 ms 33316 KB Output is correct
65 Correct 1092 ms 29492 KB Output is correct
66 Correct 1503 ms 33092 KB Output is correct
67 Correct 1908 ms 32968 KB Output is correct
68 Correct 1578 ms 33324 KB Output is correct
69 Correct 1171 ms 32968 KB Output is correct
70 Correct 1796 ms 32928 KB Output is correct
71 Correct 1824 ms 33040 KB Output is correct
72 Correct 1856 ms 33072 KB Output is correct
73 Correct 1617 ms 33012 KB Output is correct
74 Correct 1643 ms 33020 KB Output is correct
75 Correct 1564 ms 33248 KB Output is correct
76 Correct 1210 ms 32900 KB Output is correct
77 Correct 1212 ms 32936 KB Output is correct
78 Correct 1210 ms 32912 KB Output is correct
79 Correct 1039 ms 32016 KB Output is correct
80 Correct 1014 ms 31964 KB Output is correct
81 Correct 1058 ms 32004 KB Output is correct
82 Correct 999 ms 33084 KB Output is correct
83 Correct 993 ms 32996 KB Output is correct
84 Correct 1000 ms 32696 KB Output is correct
85 Correct 2310 ms 35052 KB Output is correct
86 Correct 233 ms 6092 KB Output is correct
87 Correct 147 ms 6212 KB Output is correct
88 Correct 1461 ms 33644 KB Output is correct
89 Correct 2293 ms 35088 KB Output is correct
90 Correct 1473 ms 33560 KB Output is correct
91 Correct 1640 ms 32932 KB Output is correct
92 Correct 1589 ms 33060 KB Output is correct
93 Correct 2300 ms 32972 KB Output is correct
94 Correct 1927 ms 34556 KB Output is correct
95 Correct 1929 ms 34684 KB Output is correct
96 Correct 2210 ms 34556 KB Output is correct
97 Correct 1124 ms 32640 KB Output is correct
98 Correct 1224 ms 35020 KB Output is correct
99 Correct 2379 ms 35284 KB Output is correct
100 Correct 2350 ms 35324 KB Output is correct
101 Correct 2399 ms 35688 KB Output is correct
102 Correct 2400 ms 35688 KB Output is correct
103 Correct 2489 ms 34864 KB Output is correct
104 Correct 2428 ms 34904 KB Output is correct
105 Correct 1893 ms 36240 KB Output is correct
106 Correct 1558 ms 35852 KB Output is correct
107 Correct 1813 ms 33912 KB Output is correct
108 Correct 2410 ms 34764 KB Output is correct
109 Correct 1773 ms 30952 KB Output is correct