oj.uz

Submission #712758

# Submission time Handle Problem Language Result Execution time Memory
712758 2023-03-19T18:34:03 Z acm Bridges (APIO19_bridges) C++17
100 / 100
 2187 ms 12068 KB 
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed                   \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define precision     \
  cout.precision(30); \
  cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
  freopen((name + ".in").c_str(), "r", stdin);
  freopen((name + ".out").c_str(), "w", stdout);
}
const int bl = 1000;
int n, m, q, p[100005], sz[100005], a[100005], b[100005], c[100005],
    type[100005], X[100005], Y[100005], w[100005], res[100005];
vector<int> stk, upd[100005];
int get(int v) {
  while (v != p[v]) v = p[v];
  return v;
}
void unt(int u, int v) {
  if ((u = get(u)) == (v = get(v))) return;
  if (sz[u] < sz[v]) swap(u, v);
  sz[u] += sz[v], p[v] = u;
  stk.pb(v);
}
void roll(int old_sz) {
  while (sz(stk) > old_sz) {
    int v = stk.back();
    stk.pop_back();
    sz[p[v]] -= sz[v], p[v] = v;
  }
}
int main() {
  speed;
  precision;
  // code
  cin >> n >> m;
  for (int i = 1; i <= m; i++) cin >> a[i] >> b[i] >> c[i];
  cin >> q;
  for (int I = 1, h = 1; I <= q; I++, h++) {
    cin >> type[h] >> X[h] >> Y[h];
    if (!(h % bl) || I == q) {
      stk.clear();
      for (int i = 1; i <= n; i++) sz[i] = 1, p[i] = i;
      for (int i = 1; i <= m; i++) upd[i].clear(), w[i] = 0;
      for (int i = 1; i <= h; i++)
        if (type[i] == 1) upd[X[i]].pb(i), w[X[i]] = 1;
      vector<pair<int, int>> edge;
      vector<int> later;
      for (int i = 1; i <= m; i++) {
        if (!w[i])
          edge.pb(mp(c[i], i));
        else
          later.pb(i);
      }
      sort(all(edge));
      vector<pair<pair<int, int>, int>> ask;
      for (int i = 1; i <= h; i++)
        if (type[i] == 2) ask.pb(mp(mp(Y[i], i), X[i]));
      sort(all(ask));
      for (int i = sz(ask) - 1, j = sz(edge) - 1; i >= 0; i--) {
        while (j >= 0 && ask[i].F.F <= edge[j].F) {
          unt(a[edge[j].S], b[edge[j].S]);
          j--;
        }
        int old_sz = sz(stk);
        for (auto k : later) {
          int kek = c[k];
          for (auto to : upd[k]) {
            if (to > ask[i].F.S) break;
            kek = Y[to];
          }
          if (ask[i].F.F <= kek) unt(a[k], b[k]);
        }
        res[ask[i].F.S] = sz[get(ask[i].S)];
        roll(old_sz);
      }
      for (int i = 1; i <= h; i++)
        if (type[i] == 1) c[X[i]] = Y[i];
      for (int i = 1; i <= h; i++)
        if (type[i] == 2) cout << res[i] << "\n";
      h = 0;
    }
  }
  // endl
#ifndef ONLINE_JUDGE
  cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
  return 0;
}

Compilation message

bridges.cpp: In function 'void ioi(std::string)':
bridges.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |   freopen((name + ".in").c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |   freopen((name + ".out").c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 35 ms 2984 KB Output is correct
4 Correct 7 ms 2864 KB Output is correct
5 Correct 18 ms 2912 KB Output is correct
6 Correct 14 ms 2920 KB Output is correct
7 Correct 17 ms 2824 KB Output is correct
8 Correct 18 ms 2900 KB Output is correct
9 Correct 16 ms 2772 KB Output is correct
10 Correct 16 ms 2900 KB Output is correct
11 Correct 16 ms 2912 KB Output is correct
12 Correct 17 ms 2832 KB Output is correct
13 Correct 22 ms 3044 KB Output is correct
14 Correct 21 ms 2936 KB Output is correct
15 Correct 17 ms 2932 KB Output is correct
16 Correct 15 ms 2844 KB Output is correct
17 Correct 15 ms 2856 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1382 ms 8896 KB Output is correct
2 Correct 1376 ms 8992 KB Output is correct
3 Correct 1393 ms 8976 KB Output is correct
4 Correct 1379 ms 8844 KB Output is correct
5 Correct 1371 ms 9004 KB Output is correct
6 Correct 1941 ms 8804 KB Output is correct
7 Correct 1990 ms 8892 KB Output is correct
8 Correct 1940 ms 8880 KB Output is correct
9 Correct 36 ms 4172 KB Output is correct
10 Correct 1325 ms 7988 KB Output is correct
11 Correct 1240 ms 7772 KB Output is correct
12 Correct 1135 ms 8236 KB Output is correct
13 Correct 1114 ms 9016 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1106 ms 7364 KB Output is correct
2 Correct 704 ms 5068 KB Output is correct
3 Correct 1216 ms 7284 KB Output is correct
4 Correct 1071 ms 7684 KB Output is correct
5 Correct 36 ms 4272 KB Output is correct
6 Correct 1178 ms 7400 KB Output is correct
7 Correct 1047 ms 7400 KB Output is correct
8 Correct 910 ms 7456 KB Output is correct
9 Correct 665 ms 7084 KB Output is correct
10 Correct 623 ms 6952 KB Output is correct
11 Correct 756 ms 7388 KB Output is correct
12 Correct 655 ms 7392 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1394 ms 10940 KB Output is correct
2 Correct 32 ms 4260 KB Output is correct
3 Correct 150 ms 7968 KB Output is correct
4 Correct 143 ms 8136 KB Output is correct
5 Correct 1366 ms 9524 KB Output is correct
6 Correct 1394 ms 10856 KB Output is correct
7 Correct 1338 ms 9576 KB Output is correct
8 Correct 703 ms 7864 KB Output is correct
9 Correct 715 ms 8008 KB Output is correct
10 Correct 723 ms 7984 KB Output is correct
11 Correct 1121 ms 9528 KB Output is correct
12 Correct 1067 ms 9892 KB Output is correct
13 Correct 1101 ms 9656 KB Output is correct
14 Correct 1197 ms 9488 KB Output is correct
15 Correct 1276 ms 9472 KB Output is correct
16 Correct 1394 ms 11156 KB Output is correct
17 Correct 1422 ms 10948 KB Output is correct
18 Correct 1420 ms 10948 KB Output is correct
19 Correct 1415 ms 10904 KB Output is correct
20 Correct 1209 ms 10036 KB Output is correct
21 Correct 1218 ms 10036 KB Output is correct
22 Correct 1413 ms 10696 KB Output is correct
23 Correct 1216 ms 8748 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1382 ms 8896 KB Output is correct
2 Correct 1376 ms 8992 KB Output is correct
3 Correct 1393 ms 8976 KB Output is correct
4 Correct 1379 ms 8844 KB Output is correct
5 Correct 1371 ms 9004 KB Output is correct
6 Correct 1941 ms 8804 KB Output is correct
7 Correct 1990 ms 8892 KB Output is correct
8 Correct 1940 ms 8880 KB Output is correct
9 Correct 36 ms 4172 KB Output is correct
10 Correct 1325 ms 7988 KB Output is correct
11 Correct 1240 ms 7772 KB Output is correct
12 Correct 1135 ms 8236 KB Output is correct
13 Correct 1114 ms 9016 KB Output is correct
14 Correct 1106 ms 7364 KB Output is correct
15 Correct 704 ms 5068 KB Output is correct
16 Correct 1216 ms 7284 KB Output is correct
17 Correct 1071 ms 7684 KB Output is correct
18 Correct 36 ms 4272 KB Output is correct
19 Correct 1178 ms 7400 KB Output is correct
20 Correct 1047 ms 7400 KB Output is correct
21 Correct 910 ms 7456 KB Output is correct
22 Correct 665 ms 7084 KB Output is correct
23 Correct 623 ms 6952 KB Output is correct
24 Correct 756 ms 7388 KB Output is correct
25 Correct 655 ms 7392 KB Output is correct
26 Correct 1376 ms 8952 KB Output is correct
27 Correct 1774 ms 9004 KB Output is correct
28 Correct 1518 ms 8856 KB Output is correct
29 Correct 1102 ms 9088 KB Output is correct
30 Correct 1718 ms 8808 KB Output is correct
31 Correct 1722 ms 8720 KB Output is correct
32 Correct 1728 ms 8804 KB Output is correct
33 Correct 1496 ms 9196 KB Output is correct
34 Correct 1498 ms 8864 KB Output is correct
35 Correct 1476 ms 9112 KB Output is correct
36 Correct 1152 ms 8888 KB Output is correct
37 Correct 1197 ms 8808 KB Output is correct
38 Correct 1173 ms 8984 KB Output is correct
39 Correct 829 ms 8236 KB Output is correct
40 Correct 837 ms 8672 KB Output is correct
41 Correct 816 ms 8192 KB Output is correct
42 Correct 871 ms 8952 KB Output is correct
43 Correct 871 ms 9020 KB Output is correct
44 Correct 868 ms 9096 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 35 ms 2984 KB Output is correct
4 Correct 7 ms 2864 KB Output is correct
5 Correct 18 ms 2912 KB Output is correct
6 Correct 14 ms 2920 KB Output is correct
7 Correct 17 ms 2824 KB Output is correct
8 Correct 18 ms 2900 KB Output is correct
9 Correct 16 ms 2772 KB Output is correct
10 Correct 16 ms 2900 KB Output is correct
11 Correct 16 ms 2912 KB Output is correct
12 Correct 17 ms 2832 KB Output is correct
13 Correct 22 ms 3044 KB Output is correct
14 Correct 21 ms 2936 KB Output is correct
15 Correct 17 ms 2932 KB Output is correct
16 Correct 15 ms 2844 KB Output is correct
17 Correct 15 ms 2856 KB Output is correct
18 Correct 1382 ms 8896 KB Output is correct
19 Correct 1376 ms 8992 KB Output is correct
20 Correct 1393 ms 8976 KB Output is correct
21 Correct 1379 ms 8844 KB Output is correct
22 Correct 1371 ms 9004 KB Output is correct
23 Correct 1941 ms 8804 KB Output is correct
24 Correct 1990 ms 8892 KB Output is correct
25 Correct 1940 ms 8880 KB Output is correct
26 Correct 36 ms 4172 KB Output is correct
27 Correct 1325 ms 7988 KB Output is correct
28 Correct 1240 ms 7772 KB Output is correct
29 Correct 1135 ms 8236 KB Output is correct
30 Correct 1114 ms 9016 KB Output is correct
31 Correct 1106 ms 7364 KB Output is correct
32 Correct 704 ms 5068 KB Output is correct
33 Correct 1216 ms 7284 KB Output is correct
34 Correct 1071 ms 7684 KB Output is correct
35 Correct 36 ms 4272 KB Output is correct
36 Correct 1178 ms 7400 KB Output is correct
37 Correct 1047 ms 7400 KB Output is correct
38 Correct 910 ms 7456 KB Output is correct
39 Correct 665 ms 7084 KB Output is correct
40 Correct 623 ms 6952 KB Output is correct
41 Correct 756 ms 7388 KB Output is correct
42 Correct 655 ms 7392 KB Output is correct
43 Correct 1394 ms 10940 KB Output is correct
44 Correct 32 ms 4260 KB Output is correct
45 Correct 150 ms 7968 KB Output is correct
46 Correct 143 ms 8136 KB Output is correct
47 Correct 1366 ms 9524 KB Output is correct
48 Correct 1394 ms 10856 KB Output is correct
49 Correct 1338 ms 9576 KB Output is correct
50 Correct 703 ms 7864 KB Output is correct
51 Correct 715 ms 8008 KB Output is correct
52 Correct 723 ms 7984 KB Output is correct
53 Correct 1121 ms 9528 KB Output is correct
54 Correct 1067 ms 9892 KB Output is correct
55 Correct 1101 ms 9656 KB Output is correct
56 Correct 1197 ms 9488 KB Output is correct
57 Correct 1276 ms 9472 KB Output is correct
58 Correct 1394 ms 11156 KB Output is correct
59 Correct 1422 ms 10948 KB Output is correct
60 Correct 1420 ms 10948 KB Output is correct
61 Correct 1415 ms 10904 KB Output is correct
62 Correct 1209 ms 10036 KB Output is correct
63 Correct 1218 ms 10036 KB Output is correct
64 Correct 1413 ms 10696 KB Output is correct
65 Correct 1216 ms 8748 KB Output is correct
66 Correct 1376 ms 8952 KB Output is correct
67 Correct 1774 ms 9004 KB Output is correct
68 Correct 1518 ms 8856 KB Output is correct
69 Correct 1102 ms 9088 KB Output is correct
70 Correct 1718 ms 8808 KB Output is correct
71 Correct 1722 ms 8720 KB Output is correct
72 Correct 1728 ms 8804 KB Output is correct
73 Correct 1496 ms 9196 KB Output is correct
74 Correct 1498 ms 8864 KB Output is correct
75 Correct 1476 ms 9112 KB Output is correct
76 Correct 1152 ms 8888 KB Output is correct
77 Correct 1197 ms 8808 KB Output is correct
78 Correct 1173 ms 8984 KB Output is correct
79 Correct 829 ms 8236 KB Output is correct
80 Correct 837 ms 8672 KB Output is correct
81 Correct 816 ms 8192 KB Output is correct
82 Correct 871 ms 8952 KB Output is correct
83 Correct 871 ms 9020 KB Output is correct
84 Correct 868 ms 9096 KB Output is correct
85 Correct 2095 ms 12008 KB Output is correct
86 Correct 202 ms 8048 KB Output is correct
87 Correct 182 ms 8152 KB Output is correct
88 Correct 1979 ms 10548 KB Output is correct
89 Correct 2120 ms 12004 KB Output is correct
90 Correct 1929 ms 10196 KB Output is correct
91 Correct 1474 ms 8760 KB Output is correct
92 Correct 1488 ms 8880 KB Output is correct
93 Correct 2073 ms 8772 KB Output is correct
94 Correct 1781 ms 10680 KB Output is correct
95 Correct 1770 ms 10744 KB Output is correct
96 Correct 2000 ms 10752 KB Output is correct
97 Correct 1476 ms 9680 KB Output is correct
98 Correct 1646 ms 10444 KB Output is correct
99 Correct 2078 ms 12068 KB Output is correct
100 Correct 2098 ms 11888 KB Output is correct
101 Correct 2168 ms 12056 KB Output is correct
102 Correct 2187 ms 11908 KB Output is correct
103 Correct 2165 ms 10924 KB Output is correct
104 Correct 2141 ms 10932 KB Output is correct
105 Correct 1581 ms 11156 KB Output is correct
106 Correct 1272 ms 10960 KB Output is correct
107 Correct 1454 ms 10532 KB Output is correct
108 Correct 2089 ms 11528 KB Output is correct
109 Correct 1966 ms 9684 KB Output is correct