weighted quick-union

#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define LEN 12
#define cont continue
#define bk break
template <class T>
void print(T a){
    for (auto var : a)
        cout << var <<  ' ';
    cout << endl;
}
int main(){
    vi ar(LEN);
    vi sz(LEN,1);
    for (int i = 0; i < LEN; ++i)
        ar[i]=i;

    int a,b;
    int i,j;
    while(cin>>a>>b)
    {
        for (i = ar[a]; i != ar[i]; i = ar[i]) ;
        for (j = ar[b]; j != ar[j]; j = ar[j]) ;
        if (i == j) cont;
        if (sz[i]<sz[j]) {ar[i]=j;sz[j]+=sz[i]}
        else {ar[j]=i;sz[i]+=sz[j];}
    }
    print(ar);
}