Problem p03855 (C++)

Buggy submission (status: Runtime Error):
// file_name:ABC49_D.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
  rep(j, sz(v)) i >> v[j];
  return i;
}
template <typename T> string join(const v(T) & v) {
  stringstream s;
  rep(i, sz(v)) s << ' ' << v[i];
  return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
  if (sz(v))
    o << join(v);
  return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
  return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
  return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
  ll res(0);
  for (auto &&x : a)
    res += x;
  return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame                                                                   \
  {                                                                            \
    puts("-1");                                                                \
    return 0;                                                                  \
  }
#define yn                                                                     \
  { puts("Yes"); }                                                             \
  else {                                                                       \
    puts("No");                                                                \
  }
const int MX = 200005;

// int scan
/*
int x;
scanf("%d",&x);
int y;
scanf("%d",&y);
int z;
scanf("%d",&z);

// matrix scan
/*
ll a[n] = {};
rep(i,n){
    scanf("%lld",&a[i]);
}
*/

// string scan
/*
string s;
cin >> s;
*/

// n要素で初期化
void init(int par[], int rank[], int n) {
  for (int i = 0; i < n; i++) {
    par[i] = i;
    rank[i] = 0;
  }
}

// 木の根を求める
int find(int par[], int x) {
  if (par[x] == x) {
    return x;
  } else {
    return par[x] = find(par, par[x]);
  }
}

// xとyの属する集合を併合
void unite(int par[], int rank[], int x, int y) {
  x = find(par, x);
  y = find(par, y);
  if (x == y)
    return;

  if (rank[x] < rank[y]) {
    par[x] = y;
  } else {
    par[y] = x;
    if (rank[x] == rank[y])
      rank[x]++;
  }
}

// xとyが同じ集合に属するか否か
bool same(int par[], int x, int y) { return find(par, x) == find(par, y); }

int main() {
  int n, k, l;
  cin >> n >> k >> l;
  int par1[n];
  int rank1[n];
  init(par1, rank1, n);

  rep(i, k) {
    int a, b;
    cin >> a >> b;
    unite(par1, rank1, a - 1, b - 1);
  }

  int par2[n];
  int rank2[n];
  init(par2, rank2, n);

  rep(i, l) {
    int a, b;
    cin >> a >> b;
    unite(par2, rank2, a - 1, b - 1);
  }

  vector<int> v[n * n];
  rep(i, n) { v[find(par1, i) * n + find(par2, i)].push_back(i); }
  rep(i, n) { cout << v[find(par1, i) * n + find(par2, i)].size() << ' '; }

  cout << endl;
  return 0;
}


Fixed submission:
// file_name:ABC49_D.cpp
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define snuke srand((unsigned)clock() + (unsigned)time(NULL));
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
template <typename T> inline istream &operator>>(istream &i, v(T) & v) {
  rep(j, sz(v)) i >> v[j];
  return i;
}
template <typename T> string join(const v(T) & v) {
  stringstream s;
  rep(i, sz(v)) s << ' ' << v[i];
  return s.str().substr(1);
}
template <typename T> inline ostream &operator<<(ostream &o, const v(T) & v) {
  if (sz(v))
    o << join(v);
  return o;
}
template <typename T1, typename T2>
inline istream &operator>>(istream &i, pair<T1, T2> &v) {
  return i >> v.fi >> v.se;
}
template <typename T1, typename T2>
inline ostream &operator<<(ostream &o, const pair<T1, T2> &v) {
  return o << v.fi << "," << v.se;
}
template <typename T> inline ll suma(const v(T) & a) {
  ll res(0);
  for (auto &&x : a)
    res += x;
  return res;
}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame                                                                   \
  {                                                                            \
    puts("-1");                                                                \
    return 0;                                                                  \
  }
#define yn                                                                     \
  { puts("Yes"); }                                                             \
  else {                                                                       \
    puts("No");                                                                \
  }
const int MX = 200005;

// int scan
/*
int x;
scanf("%d",&x);
int y;
scanf("%d",&y);
int z;
scanf("%d",&z);

// matrix scan
/*
ll a[n] = {};
rep(i,n){
    scanf("%lld",&a[i]);
}
*/

// string scan
/*
string s;
cin >> s;
*/

// n要素で初期化
void init(int par[], int rank[], int n) {
  for (int i = 0; i < n; i++) {
    par[i] = i;
    rank[i] = 0;
  }
}

// 木の根を求める
int find(int par[], int x) {
  if (par[x] == x) {
    return x;
  } else {
    return par[x] = find(par, par[x]);
  }
}

// xとyの属する集合を併合
void unite(int par[], int rank[], int x, int y) {
  x = find(par, x);
  y = find(par, y);
  if (x == y)
    return;

  if (rank[x] < rank[y]) {
    par[x] = y;
  } else {
    par[y] = x;
    if (rank[x] == rank[y])
      rank[x]++;
  }
}

// xとyが同じ集合に属するか否か
bool same(int par[], int x, int y) { return find(par, x) == find(par, y); }

int main() {
  int n, k, l;
  cin >> n >> k >> l;
  int par1[n];
  int rank1[n];
  init(par1, rank1, n);

  rep(i, k) {
    int a, b;
    cin >> a >> b;
    unite(par1, rank1, a - 1, b - 1);
  }

  int par2[n];
  int rank2[n];
  init(par2, rank2, n);

  rep(i, l) {
    int a, b;
    cin >> a >> b;
    unite(par2, rank2, a - 1, b - 1);
  }

  map<pair<int, int>, int> count;
  rep(i, n) {
    pair<int, int> p;
    p.first = find(par1, i);
    p.second = find(par2, i);
    count[p]++;
  }

  rep(i, n) {
    pair<int, int> p;
    p.first = find(par1, i);
    p.second = find(par2, i);
    cout << count[p] << ' ';
  }

  cout << endl;
  return 0;
}