oj.uz

Submission #673717

# Submission time Handle Problem Language Result Execution time Memory
673717 2022-12-21T19:18:39 Z Sam_a17 Bridges (APIO19_bridges) C++17
100 / 100
 2053 ms 9712 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  } else {
    // freopen("skis.in", "r", stdin);
    // freopen("skis.out", "w", stdout);
  }
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10, S = 800;
vector<pair<long long, pair<long long, long long>>> change_edges;
vector<pair<pair<long long, long long>, long long>> queries;
vector<pair<pair<long long, long long>, pair<long long, long long>>> edges, new_edges, sorted_edges;
int n, m, p[N], sz[N], comp, ans[N], t = 0, ind[N];
bool is_type_2[N];
vector<int> lst;

stack<pair<pair<int, int>, pair<int, int>>> stuck;

// dsu
void init() {
  t = 0;
  lst.clear();
  for(int i = 1; i <= n; i++) {
    p[i] = i, sz[i] = 1;
  }
  while(!stuck.empty()) stuck.pop();
}

int find(int a) {
  if(a != p[a]) {
    return find(p[a]);
  }
  return p[a];
}

int same(int a, int b) {
  if(find(a) == find(b)) {
    return 1;
  }
  return 0;
}
 
void merge(int a, int b, int t) {
  a = find(a), b = find(b);
  if(a == b) {
    return;
  }
 
  if(sz[a] > sz[b]) {
    swap(a, b);
  }
 
  p[a] = b, sz[b] += sz[a];
  comp--;
  stuck.push({{t, comp}, {a, b}});
}

void rollback(int t) {
  while (!stuck.empty() && stuck.top().first.first > t) {
    auto u = stuck.top().second;
    int a = u.second, b = u.first;
    sz[a] -= sz[b], p[b] = b;
    comp++;
    stuck.pop();
  }
}

void compute() {
  sort(rall(queries));

  vector<bool> vis(m);
  
  vector<int> changed;
  for(auto i: change_edges) {
    int curr = i.second.first;
    if(!vis[curr]) {
      changed.push_back(curr);
    }
    vis[curr] = true;
  }

  init();
  int it = 0;
  for(int i = 0; i < sz(queries); i++) {

    while(it < m && edges[it].first.first >= queries[i].first.first) {
      if(!vis[edges[it].first.second]) {
        merge(edges[it].second.first, edges[it].second.second, t++);
      }
      it++;
    }

    // persist
    lst.push_back(t++);

    //
    int pos = queries[i].second;
    for(int j = 0; j < sz(change_edges); j++) {
      if(change_edges[j].first < pos) {
        int curr = ind[change_edges[j].second.first];
        new_edges[curr].first.first = change_edges[j].second.second;
      }
    }

    for(auto j: changed) {
      int curr = ind[j];
      if(new_edges[curr].first.first >= queries[i].first.first) {
        merge(new_edges[curr].second.first, new_edges[curr].second.second, t++);
      }
      new_edges[curr].first.first = edges[curr].first.first;
    }
    
    ans[queries[i].second] = sz[find(queries[i].first.second)];
  
    //
    rollback(lst.back());
    lst.pop_back();
  }

  //
  for(auto i: change_edges) {
    int curr = ind[i.second.first]; 
    edges[curr].first.first = i.second.second;
  }

  sort(rall(edges));
  new_edges = edges;

  for(int i = 0; i < m; i++) {
    ind[edges[i].first.second] = i;
  }
}

void solve_() {
  cin >> n >> m;

  for(int i = 1; i <= m; i++) {
    long long u, v, d; cin >> u >> v >> d;
    edges.push_back({{d, i - 1}, {u, v}});
  }
  sort(rall(edges));
  new_edges = edges;

  for(int i = 0; i < m; i++) {
    ind[edges[i].first.second] = i;
  }

  int q; cin >> q;
  for(int i = 1; i <= q; i++) {
    int type; cin >> type;
    long long x, y; cin >> x >> y;
    if(type == 1) {
      change_edges.push_back({i, {x - 1, y}});
    } else {
      queries.push_back({{y, x}, i});
      is_type_2[i] = true;
    }

    if(sz(change_edges) + sz(queries) == S) {
      compute();
      change_edges.clear();
      queries.clear();
    }
  }

  if(sz(change_edges) + sz(queries) > 0) {
    compute();
    change_edges.clear();
    queries.clear();
  }

  for(int i = 1; i <= q; i++) {
    if(is_type_2[i]) {
      cout << ans[i] << '\n';
    }
  }
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      // cout << "Case #" << i << ": ";
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

bridges.cpp: In function 'void setIO(std::string)':
bridges.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
bridges.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 33 ms 648 KB Output is correct
4 Correct 6 ms 596 KB Output is correct
5 Correct 17 ms 532 KB Output is correct
6 Correct 14 ms 572 KB Output is correct
7 Correct 18 ms 468 KB Output is correct
8 Correct 17 ms 596 KB Output is correct
9 Correct 20 ms 496 KB Output is correct
10 Correct 19 ms 576 KB Output is correct
11 Correct 18 ms 600 KB Output is correct
12 Correct 19 ms 600 KB Output is correct
13 Correct 23 ms 588 KB Output is correct
14 Correct 22 ms 604 KB Output is correct
15 Correct 20 ms 572 KB Output is correct
16 Correct 19 ms 468 KB Output is correct
17 Correct 20 ms 500 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1371 ms 6104 KB Output is correct
2 Correct 1407 ms 6280 KB Output is correct
3 Correct 1402 ms 6268 KB Output is correct
4 Correct 1421 ms 6264 KB Output is correct
5 Correct 1467 ms 6276 KB Output is correct
6 Correct 2053 ms 6448 KB Output is correct
7 Correct 1972 ms 6440 KB Output is correct
8 Correct 2008 ms 6416 KB Output is correct
9 Correct 54 ms 1356 KB Output is correct
10 Correct 1495 ms 6092 KB Output is correct
11 Correct 1440 ms 6104 KB Output is correct
12 Correct 1115 ms 6628 KB Output is correct
13 Correct 1123 ms 6260 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1142 ms 4584 KB Output is correct
2 Correct 827 ms 2224 KB Output is correct
3 Correct 1317 ms 4844 KB Output is correct
4 Correct 1104 ms 4712 KB Output is correct
5 Correct 32 ms 1336 KB Output is correct
6 Correct 1260 ms 4740 KB Output is correct
7 Correct 1056 ms 4552 KB Output is correct
8 Correct 964 ms 4376 KB Output is correct
9 Correct 652 ms 4564 KB Output is correct
10 Correct 636 ms 4560 KB Output is correct
11 Correct 727 ms 4424 KB Output is correct
12 Correct 621 ms 4248 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 927 ms 9596 KB Output is correct
2 Correct 31 ms 1188 KB Output is correct
3 Correct 99 ms 7576 KB Output is correct
4 Correct 101 ms 7556 KB Output is correct
5 Correct 860 ms 9648 KB Output is correct
6 Correct 857 ms 9596 KB Output is correct
7 Correct 983 ms 9696 KB Output is correct
8 Correct 451 ms 6064 KB Output is correct
9 Correct 401 ms 6092 KB Output is correct
10 Correct 391 ms 6232 KB Output is correct
11 Correct 627 ms 7784 KB Output is correct
12 Correct 601 ms 7752 KB Output is correct
13 Correct 618 ms 8012 KB Output is correct
14 Correct 872 ms 9712 KB Output is correct
15 Correct 927 ms 9584 KB Output is correct
16 Correct 892 ms 9144 KB Output is correct
17 Correct 848 ms 9064 KB Output is correct
18 Correct 883 ms 9112 KB Output is correct
19 Correct 796 ms 9016 KB Output is correct
20 Correct 726 ms 8132 KB Output is correct
21 Correct 705 ms 8152 KB Output is correct
22 Correct 834 ms 8868 KB Output is correct
23 Correct 725 ms 7868 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1371 ms 6104 KB Output is correct
2 Correct 1407 ms 6280 KB Output is correct
3 Correct 1402 ms 6268 KB Output is correct
4 Correct 1421 ms 6264 KB Output is correct
5 Correct 1467 ms 6276 KB Output is correct
6 Correct 2053 ms 6448 KB Output is correct
7 Correct 1972 ms 6440 KB Output is correct
8 Correct 2008 ms 6416 KB Output is correct
9 Correct 54 ms 1356 KB Output is correct
10 Correct 1495 ms 6092 KB Output is correct
11 Correct 1440 ms 6104 KB Output is correct
12 Correct 1115 ms 6628 KB Output is correct
13 Correct 1123 ms 6260 KB Output is correct
14 Correct 1142 ms 4584 KB Output is correct
15 Correct 827 ms 2224 KB Output is correct
16 Correct 1317 ms 4844 KB Output is correct
17 Correct 1104 ms 4712 KB Output is correct
18 Correct 32 ms 1336 KB Output is correct
19 Correct 1260 ms 4740 KB Output is correct
20 Correct 1056 ms 4552 KB Output is correct
21 Correct 964 ms 4376 KB Output is correct
22 Correct 652 ms 4564 KB Output is correct
23 Correct 636 ms 4560 KB Output is correct
24 Correct 727 ms 4424 KB Output is correct
25 Correct 621 ms 4248 KB Output is correct
26 Correct 1418 ms 5476 KB Output is correct
27 Correct 1570 ms 5536 KB Output is correct
28 Correct 1331 ms 5676 KB Output is correct
29 Correct 1048 ms 5528 KB Output is correct
30 Correct 1869 ms 5612 KB Output is correct
31 Correct 1554 ms 5672 KB Output is correct
32 Correct 1584 ms 5480 KB Output is correct
33 Correct 1301 ms 5608 KB Output is correct
34 Correct 1328 ms 5416 KB Output is correct
35 Correct 1346 ms 5456 KB Output is correct
36 Correct 1172 ms 5460 KB Output is correct
37 Correct 1086 ms 5420 KB Output is correct
38 Correct 1104 ms 5468 KB Output is correct
39 Correct 762 ms 5588 KB Output is correct
40 Correct 734 ms 5728 KB Output is correct
41 Correct 720 ms 5508 KB Output is correct
42 Correct 753 ms 5360 KB Output is correct
43 Correct 718 ms 5532 KB Output is correct
44 Correct 700 ms 5336 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 33 ms 648 KB Output is correct
4 Correct 6 ms 596 KB Output is correct
5 Correct 17 ms 532 KB Output is correct
6 Correct 14 ms 572 KB Output is correct
7 Correct 18 ms 468 KB Output is correct
8 Correct 17 ms 596 KB Output is correct
9 Correct 20 ms 496 KB Output is correct
10 Correct 19 ms 576 KB Output is correct
11 Correct 18 ms 600 KB Output is correct
12 Correct 19 ms 600 KB Output is correct
13 Correct 23 ms 588 KB Output is correct
14 Correct 22 ms 604 KB Output is correct
15 Correct 20 ms 572 KB Output is correct
16 Correct 19 ms 468 KB Output is correct
17 Correct 20 ms 500 KB Output is correct
18 Correct 1371 ms 6104 KB Output is correct
19 Correct 1407 ms 6280 KB Output is correct
20 Correct 1402 ms 6268 KB Output is correct
21 Correct 1421 ms 6264 KB Output is correct
22 Correct 1467 ms 6276 KB Output is correct
23 Correct 2053 ms 6448 KB Output is correct
24 Correct 1972 ms 6440 KB Output is correct
25 Correct 2008 ms 6416 KB Output is correct
26 Correct 54 ms 1356 KB Output is correct
27 Correct 1495 ms 6092 KB Output is correct
28 Correct 1440 ms 6104 KB Output is correct
29 Correct 1115 ms 6628 KB Output is correct
30 Correct 1123 ms 6260 KB Output is correct
31 Correct 1142 ms 4584 KB Output is correct
32 Correct 827 ms 2224 KB Output is correct
33 Correct 1317 ms 4844 KB Output is correct
34 Correct 1104 ms 4712 KB Output is correct
35 Correct 32 ms 1336 KB Output is correct
36 Correct 1260 ms 4740 KB Output is correct
37 Correct 1056 ms 4552 KB Output is correct
38 Correct 964 ms 4376 KB Output is correct
39 Correct 652 ms 4564 KB Output is correct
40 Correct 636 ms 4560 KB Output is correct
41 Correct 727 ms 4424 KB Output is correct
42 Correct 621 ms 4248 KB Output is correct
43 Correct 927 ms 9596 KB Output is correct
44 Correct 31 ms 1188 KB Output is correct
45 Correct 99 ms 7576 KB Output is correct
46 Correct 101 ms 7556 KB Output is correct
47 Correct 860 ms 9648 KB Output is correct
48 Correct 857 ms 9596 KB Output is correct
49 Correct 983 ms 9696 KB Output is correct
50 Correct 451 ms 6064 KB Output is correct
51 Correct 401 ms 6092 KB Output is correct
52 Correct 391 ms 6232 KB Output is correct
53 Correct 627 ms 7784 KB Output is correct
54 Correct 601 ms 7752 KB Output is correct
55 Correct 618 ms 8012 KB Output is correct
56 Correct 872 ms 9712 KB Output is correct
57 Correct 927 ms 9584 KB Output is correct
58 Correct 892 ms 9144 KB Output is correct
59 Correct 848 ms 9064 KB Output is correct
60 Correct 883 ms 9112 KB Output is correct
61 Correct 796 ms 9016 KB Output is correct
62 Correct 726 ms 8132 KB Output is correct
63 Correct 705 ms 8152 KB Output is correct
64 Correct 834 ms 8868 KB Output is correct
65 Correct 725 ms 7868 KB Output is correct
66 Correct 1418 ms 5476 KB Output is correct
67 Correct 1570 ms 5536 KB Output is correct
68 Correct 1331 ms 5676 KB Output is correct
69 Correct 1048 ms 5528 KB Output is correct
70 Correct 1869 ms 5612 KB Output is correct
71 Correct 1554 ms 5672 KB Output is correct
72 Correct 1584 ms 5480 KB Output is correct
73 Correct 1301 ms 5608 KB Output is correct
74 Correct 1328 ms 5416 KB Output is correct
75 Correct 1346 ms 5456 KB Output is correct
76 Correct 1172 ms 5460 KB Output is correct
77 Correct 1086 ms 5420 KB Output is correct
78 Correct 1104 ms 5468 KB Output is correct
79 Correct 762 ms 5588 KB Output is correct
80 Correct 734 ms 5728 KB Output is correct
81 Correct 720 ms 5508 KB Output is correct
82 Correct 753 ms 5360 KB Output is correct
83 Correct 718 ms 5532 KB Output is correct
84 Correct 700 ms 5336 KB Output is correct
85 Correct 1760 ms 8836 KB Output is correct
86 Correct 182 ms 7080 KB Output is correct
87 Correct 157 ms 7136 KB Output is correct
88 Correct 1891 ms 9032 KB Output is correct
89 Correct 1760 ms 8944 KB Output is correct
90 Correct 1813 ms 9160 KB Output is correct
91 Correct 1317 ms 5516 KB Output is correct
92 Correct 1308 ms 5588 KB Output is correct
93 Correct 1827 ms 5776 KB Output is correct
94 Correct 1503 ms 7252 KB Output is correct
95 Correct 1480 ms 7228 KB Output is correct
96 Correct 1739 ms 7516 KB Output is correct
97 Correct 1337 ms 9240 KB Output is correct
98 Correct 1420 ms 8972 KB Output is correct
99 Correct 1750 ms 9088 KB Output is correct
100 Correct 1752 ms 9200 KB Output is correct
101 Correct 1788 ms 9120 KB Output is correct
102 Correct 1803 ms 8972 KB Output is correct
103 Correct 1872 ms 8032 KB Output is correct
104 Correct 1853 ms 8084 KB Output is correct
105 Correct 1267 ms 7804 KB Output is correct
106 Correct 999 ms 7096 KB Output is correct
107 Correct 1222 ms 8252 KB Output is correct
108 Correct 1796 ms 8760 KB Output is correct
109 Correct 1723 ms 7684 KB Output is correct