Connect cities

input/code.cpp: In function 'int main()':
input/code.cpp:84:13: warning: variable 'm' set but not used [-Wunused-but-set-variable]
   84 |   for (auto m : roads) {
      |             ^

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef set<int> si;
typedef set<set<int>> ssi;
typedef vector<pair<int, int>> vpi;
#define F first
#define S second
#define PB push_back
#define MP make_pair

#if DO_DBG
#define DBG(x) cerr << x << "\n";
#define DBG2(x) cerr << x;
#else
#define DBG(x)
#define DBG2(x)
#endif

#define loop(n) for (int i = 0; i < n; i++)

class UnionFind {

public:
  vector<int> parent;
  UnionFind(int size) {

    parent.resize(size);

    // Initialize the parent array with each
    // element as its own representative
    for (int i = 0; i < size; i++) {
      parent[i] = i;
    }
  }

  // Find the representative (root) of the
  // set that includes element i
  int find(int i) {

    // If i itself is root or representative
    if (parent[i] == i) {
      return i;
    }

    // Else recursively find the representative
    // of the parent
    return find(parent[i]);
  }

  // Unite (merge) the set that includes element
  // i and the set that includes element j
  void unite(int i, int j) {

    // Representative of set containing i
    int irep = find(i);

    // Representative of set containing j
    int jrep = find(j);

    // Make the representative of i's set
    // be the representative of j's set
    parent[irep] = jrep;
  }
};

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  DBG("INIT")
  int n, m;
  cin >> n >> m;
  vpi roads;
  loop(m) {
    int src, dst;
    cin >> src >> dst;
    roads.push_back(MP(src, dst));
  }
  DBG("n: " << n)
  DBG("m: " << m)
  for (auto m : roads) {
    DBG(m.F << " -> " << m.S)
  }
  UnionFind islands{n};

  for (auto m : roads) {
    auto i1res = islands.find(m.F);
    auto i2res = islands.find(m.S);
    bool sameSet = i1res == i2res;
    if (!sameSet)
      islands.unite(m.F, m.S);
  }
  vi newRoads;
  for (int i = 1; i < n; i++) {
    if (islands.find(i) != islands.find(0)) {
      islands.unite(i, 0);
      newRoads.push_back(i);
    }
  }
  cout << newRoads.size() << "\n";
  for (auto a : newRoads) {
    cout << "1 " << a + 1 << "\n";
  }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER