test/atcoder/agc011_c.test.cpp

• View this file on GitHub
• Last update: 2025-08-08 18:52:16+09:00
• Problem: https://atcoder.jp/contests/agc011/tasks/agc011_c

Depends on

• Union-Find (ポテンシャル) (src/DataStructure/UnionFind_Potentialized.hpp)

Code

// competitive-verifier: IGNORE
// competitive-verifier: PROBLEM https://atcoder.jp/contests/agc011/tasks/agc011_c
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
// ポテンシャルUF (2部グラフ判定+連結成分)
#include <iostream>
#include "src/DataStructure/UnionFind_Potentialized.hpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 int N, M;
 cin >> N >> M;
 UnionFind_Potentialized<bool> uf(N);
 vector<int> b(N, 1);
 for (int i= 0; i < M; ++i) {
  int u, v;
  cin >> u >> v, --u, --v;
  int x= uf.leader(u), y= uf.leader(v);
  b[x]= b[y]= b[x] & b[y];
  if (!uf.unite(u, v, 1)) b[x]= b[y]= 0;
 }
 long long one= 0, bin= 0, oth= 0;
 vector<int> used(N, 0);
 for (int i= 0; i < N; ++i) {
  int v= uf.leader(i);
  if (used[v]) continue;
  used[v]= 1;
  if (uf.size(v) == 1) ++one;
  else if (b[v]) ++bin;
  else ++oth;
 }
 cout << one * N * 2 - one * one + bin * bin * 2 + bin * oth * 2 + oth * oth << '\n';
 return 0;
}

#line 1 "test/atcoder/agc011_c.test.cpp"
// competitive-verifier: IGNORE
// competitive-verifier: PROBLEM https://atcoder.jp/contests/agc011/tasks/agc011_c
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
// ポテンシャルUF (2部グラフ判定+連結成分)
#include <iostream>
#line 2 "src/DataStructure/UnionFind_Potentialized.hpp"
#include <vector>
#include <algorithm>
#include <cassert>
template <class weight_t> class UnionFind_Potentialized {
 std::vector<int> par;
 std::vector<weight_t> val;
public:
 UnionFind_Potentialized(int n): par(n, -1), val(n) {}
 int leader(int u) {
  if (par[u] < 0) return u;
  int r= leader(par[u]);
  if constexpr (std::is_same_v<weight_t, bool>) val[u]= val[u] ^ val[par[u]];
  else val[u]= val[par[u]] + val[u];
  return par[u]= r;
 }
 //  -p(v) + p(u) = w
 bool unite(int u, int v, weight_t w) {
  int a= leader(u), b= leader(v);
  if constexpr (std::is_same_v<weight_t, bool>) w^= val[u] ^ val[v];
  else w= val[v] + w - val[u];
  if (a == b) return w == weight_t();
  if (par[b] > par[a]) std::swap(a, b), w= -w;
  return par[b]+= par[a], par[a]= b, val[a]= w, true;
 }
 bool connected(int u, int v) { return leader(u) == leader(v); }
 int size(int u) { return -par[leader(u)]; }
 weight_t potential(int u) { return leader(u), val[u]; }
 //  -p(v) + p(u)
 weight_t diff(int u, int v) {
  if constexpr (std::is_same_v<weight_t, bool>) return potential(u) ^ potential(v);
  else return -potential(v) + potential(u);
 }
};
#line 8 "test/atcoder/agc011_c.test.cpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 int N, M;
 cin >> N >> M;
 UnionFind_Potentialized<bool> uf(N);
 vector<int> b(N, 1);
 for (int i= 0; i < M; ++i) {
  int u, v;
  cin >> u >> v, --u, --v;
  int x= uf.leader(u), y= uf.leader(v);
  b[x]= b[y]= b[x] & b[y];
  if (!uf.unite(u, v, 1)) b[x]= b[y]= 0;
 }
 long long one= 0, bin= 0, oth= 0;
 vector<int> used(N, 0);
 for (int i= 0; i < N; ++i) {
  int v= uf.leader(i);
  if (used[v]) continue;
  used[v]= 1;
  if (uf.size(v) == 1) ++one;
  else if (b[v]) ++bin;
  else ++oth;
 }
 cout << one * N * 2 - one * one + bin * bin * 2 + bin * oth * 2 + oth * oth << '\n';
 return 0;
}

Back to top page