Shortest Routes I

input/code.cpp: In function 'int main()':
input/code.cpp:37:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |     for(int i = 0; i < new_road.size(); i++){
      |                    ~~^~~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void dfs(int s, vector<bool>& visited, vector<vector<int>>& adj){
    if(visited[s]) return;
    visited[s] = true;
    for(auto u: adj[s]){
        dfs(u, visited, adj);
    }
}

int main(){
    int n, m, c1, c2;
    cin >> n >> m;
    vector<bool> visited(n + 1);
    vector<vector<int>> adj(n + 1);
    for(int i = 0; i < m; i++){
        cin >> c1 >> c2;
        adj[c1].push_back(c2);
        adj[c2].push_back(c1);
    }
    int k = 0;
    vector<pair<int, int>> new_road;
    for(int i = 1; i <= n; i++){
        if(!visited[i]){
            if(i != 1){
                new_road.push_back(pair<int, int> (i-1, i));
                ++k;
            }
            dfs(i, visited, adj);
        }
    }
    cout << k << endl;
    for(int i = 0; i < new_road.size(); i++){
        cout << new_road[i].first << ' ' << new_road[i].second << endl;
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: RUNTIME ERROR

Test 13

Verdict: ACCEPTED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: RUNTIME ERROR