oj.uz

Submission #712759

# Submission time Handle Problem Language Result Execution time Memory
712759 2023-03-19T18:37:46 Z acm Bridges (APIO19_bridges) C++14
100 / 100
 2756 ms 8140 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 = 700;
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 1 ms 2644 KB Output is correct
2 Correct 2 ms 2724 KB Output is correct
3 Correct 28 ms 2804 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 13 ms 2772 KB Output is correct
6 Correct 11 ms 2768 KB Output is correct
7 Correct 15 ms 2772 KB Output is correct
8 Correct 14 ms 2764 KB Output is correct
9 Correct 13 ms 2712 KB Output is correct
10 Correct 15 ms 2772 KB Output is correct
11 Correct 15 ms 2760 KB Output is correct
12 Correct 16 ms 2772 KB Output is correct
13 Correct 21 ms 2772 KB Output is correct
14 Correct 19 ms 2760 KB Output is correct
15 Correct 17 ms 2768 KB Output is correct
16 Correct 14 ms 2760 KB Output is correct
17 Correct 14 ms 2752 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1477 ms 6252 KB Output is correct
2 Correct 1434 ms 6188 KB Output is correct
3 Correct 1392 ms 6228 KB Output is correct
4 Correct 1395 ms 6172 KB Output is correct
5 Correct 1548 ms 6036 KB Output is correct
6 Correct 1845 ms 6220 KB Output is correct
7 Correct 1934 ms 6208 KB Output is correct
8 Correct 1877 ms 6228 KB Output is correct
9 Correct 38 ms 2892 KB Output is correct
10 Correct 1290 ms 6184 KB Output is correct
11 Correct 1367 ms 6116 KB Output is correct
12 Correct 1293 ms 5792 KB Output is correct
13 Correct 1360 ms 6472 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1129 ms 5096 KB Output is correct
2 Correct 638 ms 3544 KB Output is correct
3 Correct 1240 ms 5280 KB Output is correct
4 Correct 1116 ms 5108 KB Output is correct
5 Correct 32 ms 2920 KB Output is correct
6 Correct 1172 ms 5156 KB Output is correct
7 Correct 1061 ms 5060 KB Output is correct
8 Correct 1016 ms 5168 KB Output is correct
9 Correct 838 ms 4704 KB Output is correct
10 Correct 751 ms 4652 KB Output is correct
11 Correct 841 ms 5084 KB Output is correct
12 Correct 759 ms 5068 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2153 ms 7092 KB Output is correct
2 Correct 34 ms 2828 KB Output is correct
3 Correct 230 ms 6124 KB Output is correct
4 Correct 202 ms 6116 KB Output is correct
5 Correct 2012 ms 7364 KB Output is correct
6 Correct 2037 ms 7216 KB Output is correct
7 Correct 1968 ms 7232 KB Output is correct
8 Correct 990 ms 5268 KB Output is correct
9 Correct 1045 ms 5224 KB Output is correct
10 Correct 1022 ms 5360 KB Output is correct
11 Correct 1575 ms 6372 KB Output is correct
12 Correct 1581 ms 6448 KB Output is correct
13 Correct 1588 ms 6692 KB Output is correct
14 Correct 1731 ms 7220 KB Output is correct
15 Correct 1937 ms 7188 KB Output is correct
16 Correct 2105 ms 7148 KB Output is correct
17 Correct 2203 ms 7096 KB Output is correct
18 Correct 2068 ms 7192 KB Output is correct
19 Correct 2049 ms 7132 KB Output is correct
20 Correct 1755 ms 6788 KB Output is correct
21 Correct 1800 ms 6860 KB Output is correct
22 Correct 2048 ms 7148 KB Output is correct
23 Correct 1891 ms 6740 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1477 ms 6252 KB Output is correct
2 Correct 1434 ms 6188 KB Output is correct
3 Correct 1392 ms 6228 KB Output is correct
4 Correct 1395 ms 6172 KB Output is correct
5 Correct 1548 ms 6036 KB Output is correct
6 Correct 1845 ms 6220 KB Output is correct
7 Correct 1934 ms 6208 KB Output is correct
8 Correct 1877 ms 6228 KB Output is correct
9 Correct 38 ms 2892 KB Output is correct
10 Correct 1290 ms 6184 KB Output is correct
11 Correct 1367 ms 6116 KB Output is correct
12 Correct 1293 ms 5792 KB Output is correct
13 Correct 1360 ms 6472 KB Output is correct
14 Correct 1129 ms 5096 KB Output is correct
15 Correct 638 ms 3544 KB Output is correct
16 Correct 1240 ms 5280 KB Output is correct
17 Correct 1116 ms 5108 KB Output is correct
18 Correct 32 ms 2920 KB Output is correct
19 Correct 1172 ms 5156 KB Output is correct
20 Correct 1061 ms 5060 KB Output is correct
21 Correct 1016 ms 5168 KB Output is correct
22 Correct 838 ms 4704 KB Output is correct
23 Correct 751 ms 4652 KB Output is correct
24 Correct 841 ms 5084 KB Output is correct
25 Correct 759 ms 5068 KB Output is correct
26 Correct 1537 ms 6116 KB Output is correct
27 Correct 1750 ms 6184 KB Output is correct
28 Correct 1599 ms 6120 KB Output is correct
29 Correct 1325 ms 6084 KB Output is correct
30 Correct 1753 ms 6140 KB Output is correct
31 Correct 1803 ms 6156 KB Output is correct
32 Correct 1728 ms 6176 KB Output is correct
33 Correct 1611 ms 6184 KB Output is correct
34 Correct 1638 ms 6088 KB Output is correct
35 Correct 1637 ms 6168 KB Output is correct
36 Correct 1439 ms 6084 KB Output is correct
37 Correct 1431 ms 6084 KB Output is correct
38 Correct 1338 ms 6060 KB Output is correct
39 Correct 1175 ms 5456 KB Output is correct
40 Correct 1149 ms 5584 KB Output is correct
41 Correct 1100 ms 5580 KB Output is correct
42 Correct 1125 ms 6432 KB Output is correct
43 Correct 1117 ms 6492 KB Output is correct
44 Correct 1151 ms 6360 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2724 KB Output is correct
3 Correct 28 ms 2804 KB Output is correct
4 Correct 4 ms 2772 KB Output is correct
5 Correct 13 ms 2772 KB Output is correct
6 Correct 11 ms 2768 KB Output is correct
7 Correct 15 ms 2772 KB Output is correct
8 Correct 14 ms 2764 KB Output is correct
9 Correct 13 ms 2712 KB Output is correct
10 Correct 15 ms 2772 KB Output is correct
11 Correct 15 ms 2760 KB Output is correct
12 Correct 16 ms 2772 KB Output is correct
13 Correct 21 ms 2772 KB Output is correct
14 Correct 19 ms 2760 KB Output is correct
15 Correct 17 ms 2768 KB Output is correct
16 Correct 14 ms 2760 KB Output is correct
17 Correct 14 ms 2752 KB Output is correct
18 Correct 1477 ms 6252 KB Output is correct
19 Correct 1434 ms 6188 KB Output is correct
20 Correct 1392 ms 6228 KB Output is correct
21 Correct 1395 ms 6172 KB Output is correct
22 Correct 1548 ms 6036 KB Output is correct
23 Correct 1845 ms 6220 KB Output is correct
24 Correct 1934 ms 6208 KB Output is correct
25 Correct 1877 ms 6228 KB Output is correct
26 Correct 38 ms 2892 KB Output is correct
27 Correct 1290 ms 6184 KB Output is correct
28 Correct 1367 ms 6116 KB Output is correct
29 Correct 1293 ms 5792 KB Output is correct
30 Correct 1360 ms 6472 KB Output is correct
31 Correct 1129 ms 5096 KB Output is correct
32 Correct 638 ms 3544 KB Output is correct
33 Correct 1240 ms 5280 KB Output is correct
34 Correct 1116 ms 5108 KB Output is correct
35 Correct 32 ms 2920 KB Output is correct
36 Correct 1172 ms 5156 KB Output is correct
37 Correct 1061 ms 5060 KB Output is correct
38 Correct 1016 ms 5168 KB Output is correct
39 Correct 838 ms 4704 KB Output is correct
40 Correct 751 ms 4652 KB Output is correct
41 Correct 841 ms 5084 KB Output is correct
42 Correct 759 ms 5068 KB Output is correct
43 Correct 2153 ms 7092 KB Output is correct
44 Correct 34 ms 2828 KB Output is correct
45 Correct 230 ms 6124 KB Output is correct
46 Correct 202 ms 6116 KB Output is correct
47 Correct 2012 ms 7364 KB Output is correct
48 Correct 2037 ms 7216 KB Output is correct
49 Correct 1968 ms 7232 KB Output is correct
50 Correct 990 ms 5268 KB Output is correct
51 Correct 1045 ms 5224 KB Output is correct
52 Correct 1022 ms 5360 KB Output is correct
53 Correct 1575 ms 6372 KB Output is correct
54 Correct 1581 ms 6448 KB Output is correct
55 Correct 1588 ms 6692 KB Output is correct
56 Correct 1731 ms 7220 KB Output is correct
57 Correct 1937 ms 7188 KB Output is correct
58 Correct 2105 ms 7148 KB Output is correct
59 Correct 2203 ms 7096 KB Output is correct
60 Correct 2068 ms 7192 KB Output is correct
61 Correct 2049 ms 7132 KB Output is correct
62 Correct 1755 ms 6788 KB Output is correct
63 Correct 1800 ms 6860 KB Output is correct
64 Correct 2048 ms 7148 KB Output is correct
65 Correct 1891 ms 6740 KB Output is correct
66 Correct 1537 ms 6116 KB Output is correct
67 Correct 1750 ms 6184 KB Output is correct
68 Correct 1599 ms 6120 KB Output is correct
69 Correct 1325 ms 6084 KB Output is correct
70 Correct 1753 ms 6140 KB Output is correct
71 Correct 1803 ms 6156 KB Output is correct
72 Correct 1728 ms 6176 KB Output is correct
73 Correct 1611 ms 6184 KB Output is correct
74 Correct 1638 ms 6088 KB Output is correct
75 Correct 1637 ms 6168 KB Output is correct
76 Correct 1439 ms 6084 KB Output is correct
77 Correct 1431 ms 6084 KB Output is correct
78 Correct 1338 ms 6060 KB Output is correct
79 Correct 1175 ms 5456 KB Output is correct
80 Correct 1149 ms 5584 KB Output is correct
81 Correct 1100 ms 5580 KB Output is correct
82 Correct 1125 ms 6432 KB Output is correct
83 Correct 1117 ms 6492 KB Output is correct
84 Correct 1151 ms 6360 KB Output is correct
85 Correct 2647 ms 8140 KB Output is correct
86 Correct 234 ms 6232 KB Output is correct
87 Correct 231 ms 6188 KB Output is correct
88 Correct 2544 ms 8096 KB Output is correct
89 Correct 2686 ms 8088 KB Output is correct
90 Correct 2508 ms 7896 KB Output is correct
91 Correct 1622 ms 6084 KB Output is correct
92 Correct 1625 ms 6116 KB Output is correct
93 Correct 2055 ms 6232 KB Output is correct
94 Correct 2148 ms 7452 KB Output is correct
95 Correct 2178 ms 7372 KB Output is correct
96 Correct 2272 ms 7428 KB Output is correct
97 Correct 2115 ms 7408 KB Output is correct
98 Correct 2353 ms 8028 KB Output is correct
99 Correct 2731 ms 8060 KB Output is correct
100 Correct 2756 ms 8088 KB Output is correct
101 Correct 2701 ms 8080 KB Output is correct
102 Correct 2719 ms 8080 KB Output is correct
103 Correct 2632 ms 7628 KB Output is correct
104 Correct 2639 ms 7660 KB Output is correct
105 Correct 2156 ms 7848 KB Output is correct
106 Correct 1740 ms 7508 KB Output is correct
107 Correct 1953 ms 7252 KB Output is correct
108 Correct 2443 ms 7892 KB Output is correct
109 Correct 2323 ms 7464 KB Output is correct