oj.uz

Submission #1060295

# Submission time Handle Problem Language Result Execution time Memory
1060295 2024-08-15T12:43:59 Z nima_aryan Making Friends on Joitter is Fun (JOI20_joitter2) C++17
1 / 100
 69 ms 22216 KB 
/**
 *    author:  NimaAryan
 *    created: 2024-08-15 13:30:23
**/
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "algo/debug.h"
#endif

using i64 = long long;

constexpr int N = 1E5;

i64 ans = 0;
vector<set<int>> S(N);  // all vertices in A
vector<set<int>> T(N);  // {x->a | a \in A}
vector<set<int>> G(N);  // {B | a \in A, a->B}
vector<int> par(N, -1);
queue<pair<int, int>> to_merge;

int find(int x) {
  return par[x] == -1 ? x : par[x] = find(par[x]);
}

int size(int A) {
  return S[A].size() + T[A].size() + G[A].size();
}

void unite(int A, int B) {
  if (size(A) < size(B)) {
    swap(A, B);
  }

  ans -= 1LL * S[A].size() * (S[A].size() - 1);
  ans -= 1LL * S[A].size() * T[A].size();
  ans -= 1LL * S[B].size() * (S[B].size() - 1);
  ans -= 1LL * S[B].size() * T[B].size();

  T[A].insert(T[B].begin(), T[B].end());
  for (int b : S[B]) {
    T[A].erase(b);
  }
  for (int x : T[B]) {
    int X = find(x);
    if (X == A) {
      T[A].erase(x);
    } else if (G[A].count(X)) {
      to_merge.emplace(A, X);
    }
    if (X != A) {
      G[X].erase(B);
      G[X].insert(A);
    }
  }
  S[A].insert(S[B].begin(), S[B].end());
  for (int X : G[B]) {
    if (G[X].count(A)) {
      to_merge.emplace(A, X);
    }
  }
  G[A].insert(G[B].begin(), G[B].end());
  G[A].erase(B);
  G[A].erase(A);
  par[B] = A;

  ans += 1LL * S[A].size() * (S[A].size() - 1);
  ans += 1LL * S[A].size() * T[A].size();

  S[B].clear();
  T[B].clear();
  G[B].clear();
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, m;
  cin >> n >> m;

  for (int x = 0; x < n; ++x) {
    S[x] = {x};
  }

  while (m--) {
    int a, b;
    cin >> a >> b;
    --a, --b;

    int A = find(a), B = find(b);
    if (A != B) {
      if (G[B].count(A)) {
        unite(A, B);
      } else if (!T[B].count(a)) {
        ans += S[B].size();
        T[B].insert(a);
        G[A].insert(B);
      }
      while (!to_merge.empty()) {
        auto [X, Y] = to_merge.front();
        to_merge.pop();
        unite(X, Y);
      }
    }

    cout << ans << "\n";
  }

  return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 4 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 4 ms 14760 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 4 ms 14936 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 4 ms 14844 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 4 ms 14948 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14756 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 4 ms 14940 KB Output is correct
23 Correct 4 ms 14940 KB Output is correct
24 Correct 4 ms 14940 KB Output is correct
25 Correct 5 ms 14984 KB Output is correct
26 Correct 4 ms 14940 KB Output is correct
27 Correct 5 ms 14940 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 4 ms 14940 KB Output is correct
30 Correct 4 ms 14952 KB Output is correct
31 Correct 5 ms 14764 KB Output is correct
32 Correct 5 ms 14940 KB Output is correct
33 Correct 4 ms 14940 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 4 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 4 ms 14760 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 4 ms 14936 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 4 ms 14844 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 4 ms 14948 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14756 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 4 ms 14940 KB Output is correct
23 Correct 4 ms 14940 KB Output is correct
24 Correct 4 ms 14940 KB Output is correct
25 Correct 5 ms 14984 KB Output is correct
26 Correct 4 ms 14940 KB Output is correct
27 Correct 5 ms 14940 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 4 ms 14940 KB Output is correct
30 Correct 4 ms 14952 KB Output is correct
31 Correct 5 ms 14764 KB Output is correct
32 Correct 5 ms 14940 KB Output is correct
33 Correct 4 ms 14940 KB Output is correct
34 Correct 5 ms 14936 KB Output is correct
35 Correct 55 ms 20052 KB Output is correct
36 Correct 67 ms 22096 KB Output is correct
37 Correct 69 ms 22100 KB Output is correct
38 Correct 63 ms 22100 KB Output is correct
39 Correct 5 ms 14940 KB Output is correct
40 Correct 6 ms 15196 KB Output is correct
41 Correct 6 ms 14940 KB Output is correct
42 Correct 5 ms 14940 KB Output is correct
43 Correct 7 ms 15156 KB Output is correct
44 Correct 6 ms 15192 KB Output is correct
45 Correct 5 ms 14940 KB Output is correct
46 Correct 5 ms 14940 KB Output is correct
47 Correct 6 ms 14940 KB Output is correct
48 Correct 6 ms 15196 KB Output is correct
49 Correct 10 ms 15452 KB Output is correct
50 Correct 67 ms 22216 KB Output is correct
51 Correct 8 ms 15196 KB Output is correct
52 Correct 57 ms 21076 KB Output is correct
53 Incorrect 10 ms 15476 KB Output isn't correct
54 Halted 0 ms 0 KB -

Subtask #3
0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 4 ms 14940 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 4 ms 14940 KB Output is correct
6 Correct 4 ms 14760 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 4 ms 14940 KB Output is correct
9 Correct 4 ms 14940 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14940 KB Output is correct
12 Correct 4 ms 14936 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 4 ms 14844 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 4 ms 14948 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14756 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 4 ms 14940 KB Output is correct
22 Correct 4 ms 14940 KB Output is correct
23 Correct 4 ms 14940 KB Output is correct
24 Correct 4 ms 14940 KB Output is correct
25 Correct 5 ms 14984 KB Output is correct
26 Correct 4 ms 14940 KB Output is correct
27 Correct 5 ms 14940 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 4 ms 14940 KB Output is correct
30 Correct 4 ms 14952 KB Output is correct
31 Correct 5 ms 14764 KB Output is correct
32 Correct 5 ms 14940 KB Output is correct
33 Correct 4 ms 14940 KB Output is correct
34 Correct 5 ms 14936 KB Output is correct
35 Correct 55 ms 20052 KB Output is correct
36 Correct 67 ms 22096 KB Output is correct
37 Correct 69 ms 22100 KB Output is correct
38 Correct 63 ms 22100 KB Output is correct
39 Correct 5 ms 14940 KB Output is correct
40 Correct 6 ms 15196 KB Output is correct
41 Correct 6 ms 14940 KB Output is correct
42 Correct 5 ms 14940 KB Output is correct
43 Correct 7 ms 15156 KB Output is correct
44 Correct 6 ms 15192 KB Output is correct
45 Correct 5 ms 14940 KB Output is correct
46 Correct 5 ms 14940 KB Output is correct
47 Correct 6 ms 14940 KB Output is correct
48 Correct 6 ms 15196 KB Output is correct
49 Correct 10 ms 15452 KB Output is correct
50 Correct 67 ms 22216 KB Output is correct
51 Correct 8 ms 15196 KB Output is correct
52 Correct 57 ms 21076 KB Output is correct
53 Incorrect 10 ms 15476 KB Output isn't correct
54 Halted 0 ms 0 KB -