Connect cities

#include <iostream>
#include <vector>

int main() {
  int cityCount = 0;
  int roadCount = 0;

  std::cin >> cityCount;
  std::cin >> roadCount;
  // std::cout << count << " " << carCount << std::endl;
  //   std::cout << count << std::endl;
  //   std::cout << cityCount << " " << roadCount << std::endl;
  std::vector<int> roadsAlready(roadCount * 2);
  for (int ii = 0; ii < roadCount * 2; ii += 2) {
    int city1;
    std::cin >> city1;
    roadsAlready[ii] = city1 - 1;
    int city2;
    std::cin >> city2;
    roadsAlready[ii + 1] = city2 - 1;
  }

  std::vector<int> roadsDict(cityCount);
  for (int ii = 0; ii < cityCount; ii++) {
    roadsDict[ii] = -1;
  }
  //   std::cout << cityCount << " " << roadCount << std::endl;
  //   roadsDict.assign(-1, cityCount);

  int counter = 0;
  for (int ii = 0; ii < roadCount * 2; ii += 2) {
    int start = roadsAlready[ii];
    int end = roadsAlready[ii + 1];
    int isStart = roadsDict[start] != -1;
    int isEnd = roadsDict[end] != -1;

    if (isStart && isEnd) {
    } else if (isStart) {
      roadsDict[end] = roadsDict[start];
    } else if (isEnd) {
      roadsDict[start] = roadsDict[end];
    } else {
      roadsDict[end] = counter;
      roadsDict[start] = counter;
      counter++;
    }
  }
  //   std::cout << "roadsDict" << std::endl;
  //   for (int ii = 0; ii < cityCount; ii++) {
  //     std::cout << roadsDict[ii] << " ";
  //   }
  //   std::cout << std::endl;

  for (int city = 0; city < cityCount; city++) {
    if (roadsDict[city] == -1) {
      roadsDict[city] = counter;
      counter += 1;
    }
  }
  //   std::cout << counter << std::endl;
  int counter1 = 0;
  for (int ii = 1; ii < counter; ii++) {
    for (int jj = 1; jj < cityCount; jj++) {
      if (roadsDict[jj] == ii) {
        counter1 += 1;
        break;
      }
    }
  }
  std::cout << counter1 << std::endl;
  for (int ii = 1; ii < counter; ii++) {
    for (int jj = 1; jj < cityCount; jj++) {
      if (roadsDict[jj] == ii) {
        std::cout << 1 << " " << jj + 1 << " " << std::endl;
        break;
      }
    }
  }

  // for city in range(1, cities):
  //   if roadsDict[city] == -1:
  //     roadsDict[city] = counter
  //     counter += 1

  return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

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: TIME LIMIT EXCEEDED

Test 12

Verdict: WRONG ANSWER