백준 24479 C++

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

#pragma warning (disable:4996);


using namespace std;
int cnt;
int k;
int N, M, i;
bool check[100001];
vector <int> v[100001];
int number[100001];

void DFS(int n){
    check[n] = true;
    cnt++;
    number[n] = cnt;
   
   
    for (int i = 0; i < v[n].size(); i++) {
        if (!check[v[n][i]]) {
            
            DFS(v[n][i]);
        }
    }
    
}
int main() {
    
    
    cin >> N >> M>>i;
    for (int j = 0; j < M; j++) {
        int a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for (int j = 1; j <= N; j++){
        sort(v[j].begin(), v[j].end());
    }

    DFS(i);

    for (int j = 1; j <= N; j++) {
        cout << number[j] << '\n';
    }
    
    

    return 0;