Connect cities

// ~/.vim/cpp_template.cpp
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>


using namespace std;


void dfs(int s, vector<bool> *visited, vector<int> (*adj)[]) {
    if ((*visited)[s]) return;
    (*visited)[s] = true;
    // process node s


    for (auto u: (*adj)[s]) {
        dfs(u, visited, adj);
    }
}
//vector<int> adj[N];                                                          
//vector<bool> visited(N, false); 

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    // Your code starts here

    int N, M;
    cin >> N >> M;



    vector<int> adj[N];
    vector<bool> visited(N, false);


    int u, v;
    for(int i = 0; i < M;i++){
        cin >> u >> v;
        u--;
        v--;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    int res = 0;
    dfs(0, &visited, &adj);
    for(int i = 0; i < N; i++){
        if(visited[i]) continue;
        dfs(i, &visited, &adj);
        res++;
    }
    cout << res << endl;

    
    
    return 0;
}

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: 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: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER