oj.uz

Submission #1060313

# Submission time Handle Problem Language Result Execution time Memory
1060313 2024-08-15T12:54:17 Z nima_aryan Making Friends on Joitter is Fun (JOI20_joitter2) C++17
100 / 100
 378 ms 49748 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) {
  A = find(A), B = find(B);

  if (A == B) {
    return;
  }

  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();

  for (int x : T[B]) {
    int X = find(x);
    if (X == A) {
      continue;
    }
    T[A].insert(x);
    if (G[A].count(X)) {
      to_merge.emplace(A, X);
    }
    G[X].erase(B);
    G[X].insert(A);
  }
  for (int b : S[B]) {
    T[A].erase(b);
    S[A].insert(b);
  }
  G[A].erase(B);
  for (int X : G[B]) {
    if (X == A) {
      continue;
    }
    if (G[X].count(A)) {
      to_merge.emplace(A, X);
    }
    G[A].insert(X);
  }
  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 14936 KB Output is correct
2 Correct 4 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 5 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 5 ms 14940 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 6 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 4 ms 14940 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 14940 KB Output is correct
16 Correct 5 ms 14788 KB Output is correct
17 Correct 4 ms 14940 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 6 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 4 ms 14784 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 8 ms 14940 KB Output is correct
26 Correct 5 ms 14940 KB Output is correct
27 Correct 6 ms 14892 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 4 ms 14936 KB Output is correct
30 Correct 6 ms 14888 KB Output is correct
31 Correct 4 ms 14940 KB Output is correct
32 Correct 4 ms 14940 KB Output is correct
33 Correct 4 ms 14940 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14936 KB Output is correct
2 Correct 4 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 5 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 5 ms 14940 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 6 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 4 ms 14940 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 14940 KB Output is correct
16 Correct 5 ms 14788 KB Output is correct
17 Correct 4 ms 14940 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 6 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 4 ms 14784 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 8 ms 14940 KB Output is correct
26 Correct 5 ms 14940 KB Output is correct
27 Correct 6 ms 14892 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 4 ms 14936 KB Output is correct
30 Correct 6 ms 14888 KB Output is correct
31 Correct 4 ms 14940 KB Output is correct
32 Correct 4 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 47 ms 17748 KB Output is correct
36 Correct 61 ms 19536 KB Output is correct
37 Correct 62 ms 19536 KB Output is correct
38 Correct 60 ms 19284 KB Output is correct
39 Correct 5 ms 14940 KB Output is correct
40 Correct 5 ms 14940 KB Output is correct
41 Correct 6 ms 14936 KB Output is correct
42 Correct 5 ms 14936 KB Output is correct
43 Correct 6 ms 14940 KB Output is correct
44 Correct 6 ms 14936 KB Output is correct
45 Correct 5 ms 14940 KB Output is correct
46 Correct 8 ms 14836 KB Output is correct
47 Correct 6 ms 14940 KB Output is correct
48 Correct 6 ms 14940 KB Output is correct
49 Correct 9 ms 15428 KB Output is correct
50 Correct 66 ms 19620 KB Output is correct
51 Correct 8 ms 15192 KB Output is correct
52 Correct 69 ms 18516 KB Output is correct
53 Correct 13 ms 15448 KB Output is correct
54 Correct 57 ms 19024 KB Output is correct
55 Correct 10 ms 15196 KB Output is correct
56 Correct 10 ms 15196 KB Output is correct
57 Correct 6 ms 15448 KB Output is correct
58 Correct 9 ms 15252 KB Output is correct
59 Correct 8 ms 14940 KB Output is correct
60 Correct 51 ms 17236 KB Output is correct
61 Correct 10 ms 15196 KB Output is correct
62 Correct 75 ms 19240 KB Output is correct

Subtask #3
83.0 / 83.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14936 KB Output is correct
2 Correct 4 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 5 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 5 ms 14940 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 6 ms 14940 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 4 ms 14940 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 14940 KB Output is correct
16 Correct 5 ms 14788 KB Output is correct
17 Correct 4 ms 14940 KB Output is correct
18 Correct 4 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 6 ms 14940 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 4 ms 14784 KB Output is correct
23 Correct 4 ms 14936 KB Output is correct
24 Correct 5 ms 14936 KB Output is correct
25 Correct 8 ms 14940 KB Output is correct
26 Correct 5 ms 14940 KB Output is correct
27 Correct 6 ms 14892 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 4 ms 14936 KB Output is correct
30 Correct 6 ms 14888 KB Output is correct
31 Correct 4 ms 14940 KB Output is correct
32 Correct 4 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 47 ms 17748 KB Output is correct
36 Correct 61 ms 19536 KB Output is correct
37 Correct 62 ms 19536 KB Output is correct
38 Correct 60 ms 19284 KB Output is correct
39 Correct 5 ms 14940 KB Output is correct
40 Correct 5 ms 14940 KB Output is correct
41 Correct 6 ms 14936 KB Output is correct
42 Correct 5 ms 14936 KB Output is correct
43 Correct 6 ms 14940 KB Output is correct
44 Correct 6 ms 14936 KB Output is correct
45 Correct 5 ms 14940 KB Output is correct
46 Correct 8 ms 14836 KB Output is correct
47 Correct 6 ms 14940 KB Output is correct
48 Correct 6 ms 14940 KB Output is correct
49 Correct 9 ms 15428 KB Output is correct
50 Correct 66 ms 19620 KB Output is correct
51 Correct 8 ms 15192 KB Output is correct
52 Correct 69 ms 18516 KB Output is correct
53 Correct 13 ms 15448 KB Output is correct
54 Correct 57 ms 19024 KB Output is correct
55 Correct 10 ms 15196 KB Output is correct
56 Correct 10 ms 15196 KB Output is correct
57 Correct 6 ms 15448 KB Output is correct
58 Correct 9 ms 15252 KB Output is correct
59 Correct 8 ms 14940 KB Output is correct
60 Correct 51 ms 17236 KB Output is correct
61 Correct 10 ms 15196 KB Output is correct
62 Correct 75 ms 19240 KB Output is correct
63 Correct 276 ms 49744 KB Output is correct
64 Correct 279 ms 49748 KB Output is correct
65 Correct 255 ms 49612 KB Output is correct
66 Correct 106 ms 21544 KB Output is correct
67 Correct 204 ms 25612 KB Output is correct
68 Correct 99 ms 21588 KB Output is correct
69 Correct 211 ms 26316 KB Output is correct
70 Correct 98 ms 21588 KB Output is correct
71 Correct 89 ms 21584 KB Output is correct
72 Correct 184 ms 25676 KB Output is correct
73 Correct 168 ms 25688 KB Output is correct
74 Correct 378 ms 32564 KB Output is correct
75 Correct 248 ms 29784 KB Output is correct
76 Correct 261 ms 32340 KB Output is correct
77 Correct 336 ms 32588 KB Output is correct
78 Correct 119 ms 25628 KB Output is correct
79 Correct 181 ms 27180 KB Output is correct
80 Correct 100 ms 25556 KB Output is correct
81 Correct 167 ms 27216 KB Output is correct
82 Correct 326 ms 39760 KB Output is correct
83 Correct 332 ms 39760 KB Output is correct
84 Correct 262 ms 39508 KB Output is correct
85 Correct 269 ms 39504 KB Output is correct
86 Correct 145 ms 22352 KB Output is correct
87 Correct 166 ms 23544 KB Output is correct
88 Correct 171 ms 25680 KB Output is correct
89 Correct 262 ms 32272 KB Output is correct