oj.uz

답안 #1060300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060300 2024-08-15T12:47:09 Z nima_aryan 조이터에서 친구를 만드는건 재밌어 (JOI20_joitter2) C++17
100 / 100
 370 ms 53120 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 : G[B]) {
    if (G[X].count(A)) {
      to_merge.emplace(A, X);
    }
  }
  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());
  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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 5 ms 14936 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 4 ms 14936 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 5 ms 14960 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 4 ms 14944 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 4 ms 14940 KB Output is correct
13 Correct 5 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 6 ms 14940 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 5 ms 14740 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 4 ms 14872 KB Output is correct
20 Correct 4 ms 14936 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 4 ms 14936 KB Output is correct
23 Correct 4 ms 14940 KB Output is correct
24 Correct 4 ms 14940 KB Output is correct
25 Correct 4 ms 14940 KB Output is correct
26 Correct 4 ms 14876 KB Output is correct
27 Correct 4 ms 14940 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 3 ms 14940 KB Output is correct
30 Correct 4 ms 14940 KB Output is correct
31 Correct 4 ms 14936 KB Output is correct
32 Correct 4 ms 14940 KB Output is correct
33 Correct 5 ms 14856 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 5 ms 14936 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 4 ms 14936 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 5 ms 14960 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 4 ms 14944 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 4 ms 14940 KB Output is correct
13 Correct 5 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 6 ms 14940 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 5 ms 14740 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 4 ms 14872 KB Output is correct
20 Correct 4 ms 14936 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 4 ms 14936 KB Output is correct
23 Correct 4 ms 14940 KB Output is correct
24 Correct 4 ms 14940 KB Output is correct
25 Correct 4 ms 14940 KB Output is correct
26 Correct 4 ms 14876 KB Output is correct
27 Correct 4 ms 14940 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 3 ms 14940 KB Output is correct
30 Correct 4 ms 14940 KB Output is correct
31 Correct 4 ms 14936 KB Output is correct
32 Correct 4 ms 14940 KB Output is correct
33 Correct 5 ms 14856 KB Output is correct
34 Correct 6 ms 14940 KB Output is correct
35 Correct 48 ms 17924 KB Output is correct
36 Correct 62 ms 19508 KB Output is correct
37 Correct 64 ms 19928 KB Output is correct
38 Correct 70 ms 19284 KB Output is correct
39 Correct 9 ms 14940 KB Output is correct
40 Correct 8 ms 14952 KB Output is correct
41 Correct 6 ms 14936 KB Output is correct
42 Correct 5 ms 14940 KB Output is correct
43 Correct 6 ms 14940 KB Output is correct
44 Correct 6 ms 15016 KB Output is correct
45 Correct 5 ms 14936 KB Output is correct
46 Correct 5 ms 14936 KB Output is correct
47 Correct 6 ms 15148 KB Output is correct
48 Correct 6 ms 14940 KB Output is correct
49 Correct 9 ms 15552 KB Output is correct
50 Correct 65 ms 19536 KB Output is correct
51 Correct 7 ms 15196 KB Output is correct
52 Correct 55 ms 18516 KB Output is correct
53 Correct 13 ms 15448 KB Output is correct
54 Correct 60 ms 21716 KB Output is correct
55 Correct 7 ms 15704 KB Output is correct
56 Correct 7 ms 15448 KB Output is correct
57 Correct 7 ms 15452 KB Output is correct
58 Correct 7 ms 15452 KB Output is correct
59 Correct 6 ms 15112 KB Output is correct
60 Correct 56 ms 19920 KB Output is correct
61 Correct 7 ms 15196 KB Output is correct
62 Correct 64 ms 21876 KB Output is correct

Subtask #3
83.0 / 83.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Correct 4 ms 14940 KB Output is correct
3 Correct 5 ms 14936 KB Output is correct
4 Correct 4 ms 14940 KB Output is correct
5 Correct 4 ms 14936 KB Output is correct
6 Correct 4 ms 14940 KB Output is correct
7 Correct 4 ms 14940 KB Output is correct
8 Correct 5 ms 14960 KB Output is correct
9 Correct 5 ms 14940 KB Output is correct
10 Correct 4 ms 14944 KB Output is correct
11 Correct 4 ms 14936 KB Output is correct
12 Correct 4 ms 14940 KB Output is correct
13 Correct 5 ms 14940 KB Output is correct
14 Correct 4 ms 14940 KB Output is correct
15 Correct 6 ms 14940 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 5 ms 14740 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 4 ms 14872 KB Output is correct
20 Correct 4 ms 14936 KB Output is correct
21 Correct 5 ms 14940 KB Output is correct
22 Correct 4 ms 14936 KB Output is correct
23 Correct 4 ms 14940 KB Output is correct
24 Correct 4 ms 14940 KB Output is correct
25 Correct 4 ms 14940 KB Output is correct
26 Correct 4 ms 14876 KB Output is correct
27 Correct 4 ms 14940 KB Output is correct
28 Correct 4 ms 14940 KB Output is correct
29 Correct 3 ms 14940 KB Output is correct
30 Correct 4 ms 14940 KB Output is correct
31 Correct 4 ms 14936 KB Output is correct
32 Correct 4 ms 14940 KB Output is correct
33 Correct 5 ms 14856 KB Output is correct
34 Correct 6 ms 14940 KB Output is correct
35 Correct 48 ms 17924 KB Output is correct
36 Correct 62 ms 19508 KB Output is correct
37 Correct 64 ms 19928 KB Output is correct
38 Correct 70 ms 19284 KB Output is correct
39 Correct 9 ms 14940 KB Output is correct
40 Correct 8 ms 14952 KB Output is correct
41 Correct 6 ms 14936 KB Output is correct
42 Correct 5 ms 14940 KB Output is correct
43 Correct 6 ms 14940 KB Output is correct
44 Correct 6 ms 15016 KB Output is correct
45 Correct 5 ms 14936 KB Output is correct
46 Correct 5 ms 14936 KB Output is correct
47 Correct 6 ms 15148 KB Output is correct
48 Correct 6 ms 14940 KB Output is correct
49 Correct 9 ms 15552 KB Output is correct
50 Correct 65 ms 19536 KB Output is correct
51 Correct 7 ms 15196 KB Output is correct
52 Correct 55 ms 18516 KB Output is correct
53 Correct 13 ms 15448 KB Output is correct
54 Correct 60 ms 21716 KB Output is correct
55 Correct 7 ms 15704 KB Output is correct
56 Correct 7 ms 15448 KB Output is correct
57 Correct 7 ms 15452 KB Output is correct
58 Correct 7 ms 15452 KB Output is correct
59 Correct 6 ms 15112 KB Output is correct
60 Correct 56 ms 19920 KB Output is correct
61 Correct 7 ms 15196 KB Output is correct
62 Correct 64 ms 21876 KB Output is correct
63 Correct 205 ms 53072 KB Output is correct
64 Correct 205 ms 53120 KB Output is correct
65 Correct 190 ms 53072 KB Output is correct
66 Correct 112 ms 23852 KB Output is correct
67 Correct 188 ms 27744 KB Output is correct
68 Correct 90 ms 23992 KB Output is correct
69 Correct 230 ms 28588 KB Output is correct
70 Correct 90 ms 23996 KB Output is correct
71 Correct 92 ms 23892 KB Output is correct
72 Correct 172 ms 27924 KB Output is correct
73 Correct 182 ms 27984 KB Output is correct
74 Correct 370 ms 36092 KB Output is correct
75 Correct 270 ms 33348 KB Output is correct
76 Correct 307 ms 35924 KB Output is correct
77 Correct 307 ms 35924 KB Output is correct
78 Correct 109 ms 27476 KB Output is correct
79 Correct 183 ms 30804 KB Output is correct
80 Correct 113 ms 27472 KB Output is correct
81 Correct 180 ms 30800 KB Output is correct
82 Correct 358 ms 42064 KB Output is correct
83 Correct 359 ms 42076 KB Output is correct
84 Correct 316 ms 42064 KB Output is correct
85 Correct 298 ms 41808 KB Output is correct
86 Correct 165 ms 24656 KB Output is correct
87 Correct 174 ms 26960 KB Output is correct
88 Correct 190 ms 28000 KB Output is correct
89 Correct 303 ms 35832 KB Output is correct