Add another problem from phase 2

This problem is pretty simple, just a simple dsu.

2010/phase2/fusoes.cpp

@@ -0,0 +1,113 @@
+/* Problem URL: https://br.spoj.com/problems/FUSOES1/ */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+vi dsu;
+
+int find_p(int a)
+{
+    if (dsu[a] == a) {
+        return a;
+    }
+    return dsu[a] = find_p(dsu[a]);
+}
+
+void make_pair(int a, int b)
+{
+    int ap = find_p(a);
+    int bp = find_p(b);
+    dsu[bp] = ap;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int n, m;
+    cin >> n >> m;
+
+    dsu.resize(n);
+    for (size_t i = 0; i < n; i++) {
+        dsu[i] = i;
+    }
+
+    while (m--) {
+        char op;
+        int a, b;
+        cin >> op >> a >> b;
+        a--, b--;
+        if (op == 'C') {
+            cout << (find_p(a) == find_p(b) ? "S\n" : "N\n");
+            continue;
+        }
+        make_pair(a, b);
+    }
+}