Problem p02762 (C++)

Buggy submission (status: Time Limit Exceeded):
// #include <bits/stdc++.h>

#include <algorithm>
#include <iostream>

#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>

#include <cassert>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#include <random>

#include <memory>

using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
// typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int, pii> pipii;
typedef pair<ll, pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define rrep2(i, a, b) for (int i = (a); i > b; i--)
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

template <class T>
using MINPQ = std::priority_queue<T, vector<T>, greater<T>>; // MINPQ<pii> pq;
template <class T> using MAXPQ = std::priority_queue<T>;

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1 << 30;
const ll INFLL = 1LL << 62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
// const ll mod = 998244353;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w)                                                     \
  (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
#define stand(B, i)                                                            \
  (((B >> i) & 1) == 1) ? true : false // Bのi番目のbitが1ならtrue, 0ならfalse

// debug
#define DEBUG

#define DUMPOUT cerr

#ifdef DEBUG
#define dump(...)                                                              \
  DUMPOUT << #__VA_ARGS__ << " :[" << __FUNCTION__ << ":" << __LINE__ << "]"   \
          << endl;                                                             \
  DUMPOUT << "    ";                                                           \
  dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() { DUMPOUT << endl; };

template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0)
    DUMPOUT << " ";
  else
    DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}

// ostream
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
  os << "[";
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
  os << "]";
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "[";
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << "(" << itr->first << ", " << itr->second << ")";
    itr++;
    if (itr != map_var.end())
      os << ", ";
    itr--;
  }
  os << "]";
  return os;
}

template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "[";
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end())
      os << ", ";
    itr--;
  }
  os << "]";
  return os;
}

struct UnionFind {
  vector<int> par,
      rank; // rank[i]:=頂点iの属する根からの深さ(縮約で変更はしない)
  int cmps; // 連結成分の総数
  vector<set<int>> cmp;

  UnionFind() {}

  UnionFind(int n) : par(n), rank(n, 1) {
    cmps = n;
    cmp.resize(n);
    for (int i = 0; i < n; i++) {
      par[i] = i;
      cmp[i].insert(i);
    }
  }

  int find_root(int now) {
    if (par[now] == now)
      return now;
    return par[now] = find_root(par[now]);
  }

  void unite(int u, int v) {
    int x = find_root(u);
    int y = find_root(v);
    if (x == y)
      return;

    if (rank[x] < rank[y])
      swap(x, y);
    par[y] = x;
    if (rank[x] == rank[y])
      rank[x]++;
    cmps--;
    for (auto z : cmp[y]) {
      cmp[x].insert(z);
    }
    cmp[y].clear();
  }

  bool same(int u, int v) { return find_root(u) == find_root(v); }
};

int n, m, k;
vector<vector<int>> f, e;

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> k;
  f.resize(n);
  e.resize(n);
  UnionFind uf(n);
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    uf.unite(a, b);
    f[a].push_back(b);
    f[b].push_back(a);
  }
  rep(i, k) {
    int c, d;
    cin >> c >> d;
    c--;
    d--;
    e[c].push_back(d);
    e[d].push_back(c);
  }
  vector<int> ANS;
  rep(i, n) {
    // cerr << i << endl;
    int r = uf.find_root(i);
    set<int> S = uf.cmp[r];
    int ans = S.size();
    ans--;
    ans -= f[i].size();
    for (auto x : e[i]) {
      if (S.find(x) == S.end())
        continue;
      ans--;
    }
    ANS.push_back(ans);
  }
  rep(i, n) {
    if (i == n - 1)
      cout << ANS[i] << endl;
    else
      cout << ANS[i] << " ";
  }
}


Fixed submission:
// #include <bits/stdc++.h>

#include <algorithm>
#include <iostream>

#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>

#include <cassert>
#include <chrono>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#include <random>

#include <memory>

using namespace std;
#define int long long

typedef long long ll;
typedef unsigned long long ull;
// typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int, pii> pipii;
typedef pair<ll, pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;

#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n); i > 0; i--)
#define rrep2(i, a, b) for (int i = (a); i > b; i--)
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

template <class T>
using MINPQ = std::priority_queue<T, vector<T>, greater<T>>; // MINPQ<pii> pq;
template <class T> using MAXPQ = std::priority_queue<T>;

const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1 << 30;
const ll INFLL = 1LL << 62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
// const ll mod = 998244353;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;

#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w)                                                     \
  (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
#define stand(B, i)                                                            \
  (((B >> i) & 1) == 1) ? true : false // Bのi番目のbitが1ならtrue, 0ならfalse

// debug
#define DEBUG

#define DUMPOUT cerr

#ifdef DEBUG
#define dump(...)                                                              \
  DUMPOUT << #__VA_ARGS__ << " :[" << __FUNCTION__ << ":" << __LINE__ << "]"   \
          << endl;                                                             \
  DUMPOUT << "    ";                                                           \
  dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif

void dump_func() { DUMPOUT << endl; };

template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0)
    DUMPOUT << " ";
  else
    DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}

// ostream
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
  os << "[";
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
  os << "]";
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "[";
  for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
    os << "(" << itr->first << ", " << itr->second << ")";
    itr++;
    if (itr != map_var.end())
      os << ", ";
    itr--;
  }
  os << "]";
  return os;
}

template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "[";
  for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
    os << *itr;
    ++itr;
    if (itr != set_var.end())
      os << ", ";
    itr--;
  }
  os << "]";
  return os;
}

struct UnionFind {
  vector<int> par,
      rank; // rank[i]:=頂点iの属する根からの深さ(縮約で変更はしない)
  int cmps; // 連結成分の総数
  vector<set<int>> cmp;

  UnionFind() {}

  UnionFind(int n) : par(n), rank(n, 1) {
    cmps = n;
    cmp.resize(n);
    for (int i = 0; i < n; i++) {
      par[i] = i;
      cmp[i].insert(i);
    }
  }

  int find_root(int now) {
    if (par[now] == now)
      return now;
    return par[now] = find_root(par[now]);
  }

  void unite(int u, int v) {
    int x = find_root(u);
    int y = find_root(v);
    if (x == y)
      return;

    if (rank[x] < rank[y])
      swap(x, y);
    par[y] = x;
    if (rank[x] == rank[y])
      rank[x]++;
    cmps--;
    for (auto z : cmp[y]) {
      cmp[x].insert(z);
    }
    cmp[y].clear();
  }

  bool same(int u, int v) { return find_root(u) == find_root(v); }
};

int n, m, k;
vector<vector<int>> f, e;

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> m >> k;
  f.resize(n);
  e.resize(n);
  UnionFind uf(n);
  rep(i, m) {
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    uf.unite(a, b);
    f[a].push_back(b);
    f[b].push_back(a);
  }
  rep(i, k) {
    int c, d;
    cin >> c >> d;
    c--;
    d--;
    e[c].push_back(d);
    e[d].push_back(c);
  }
  vector<int> ANS;
  rep(i, n) {
    // cerr << i << endl;
    int r = uf.find_root(i);
    set<int> &S = uf.cmp[r];
    int ans = S.size();
    ans--;
    ans -= f[i].size();
    for (auto x : e[i]) {
      if (S.find(x) == S.end())
        continue;
      ans--;
    }
    ANS.push_back(ans);
  }
  rep(i, n) {
    if (i == n - 1)
      cout << ANS[i] << endl;
    else
      cout << ANS[i] << " ";
  }
}