Connect cities

In file included from /usr/include/c++/13/bits/stl_algobase.h:64,
                 from /usr/include/c++/13/string:51,
                 from input/code.cpp:1:
In constructor 'constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int&; _U2 = int&; _T1 = const int; _T2 = int]',
    inlined from 'int main()' at input/code.cpp:58:27:
/usr/include/c++/13/bits/stl_pair.h:317:42: warning: 'temp_key' may be used uninitialized [-Wmaybe-uninitialized]
  317 |         : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y))
      |                                          ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:26:13: note: 'temp_key' declared here
   26 |         int temp_key;
      |             ^~~~~~~~
In constructor 'constexpr std::pair<_T1, _T2>::pair(_U1&&, _U2&&) [with _U1 = int&; _U2 = int&; _T1 = const int; _T2 = int]',
    inlined from 'int main()' at input/code.cpp:58:27:
/usr/include/c++/13/bits/stl_pair.h:317:42: warning...

#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>


using namespace std;

int main()
{
    int n_cities;
    int n_roads;
    cin >> n_cities >> n_roads;
    

    unordered_map<int, unordered_set<int>> city_map;
    unordered_map<int, int> seen_cities;     

    int road1, road2;

    for(int i = 0; i < n_roads; i++)
    {
        int temp_key;
        cin >> road1 >> road2;

        if(!seen_cities.count(road1) && !seen_cities.count(road2))
        {
            unordered_set<int> temp = {road1, road2};
            city_map[road1] = temp;
            temp_key = road1;
        }
        else if(seen_cities.count(road1) && city_map.count(seen_cities[road1]))
        {
            temp_key = seen_cities[road1];
            city_map[temp_key].insert(road1);
            city_map[temp_key].insert(road2);
            if(seen_cities.count(road2) && seen_cities[road2] != seen_cities[road1])
            {
                city_map[temp_key].merge(city_map[seen_cities[road2]]);
                city_map.erase(seen_cities[road2]);
            }
        }
        else if(seen_cities.count(road2) && city_map.count(seen_cities[road2]))
        {
            temp_key = seen_cities[road2];
            city_map[temp_key].insert(road2);
            city_map[temp_key].insert(road1);
            if(seen_cities.count(road1) && seen_cities[road2] != seen_cities[road1])
            {
                city_map[temp_key].merge(city_map[seen_cities[road1]]);
                city_map.erase(seen_cities[road1]);
            }
        }

        seen_cities.insert({road1, temp_key});
        seen_cities.insert({road2, temp_key});
    }
    for(int i = 1; i <= n_cities; i++)
    {
        if(!seen_cities.count(i))
        {
            city_map[i] = {i};
        }
    }
    printf("%ld\n", city_map.size() - 1);
    unordered_map<int, unordered_set<int>>::iterator it1;
    unordered_map<int, unordered_set<int>>::iterator it2 = city_map.begin();
    it2++;
    for(it1 = city_map.begin(); it2 != city_map.end(); ++it1, ++it2)
    {
        printf("%d %d\n", *(it1->second.begin()), *(it2->second.begin()));
    }

}   

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED