ProblemSolving/1260_v2.cpp at main · readable-ko/ProblemSolving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#include <cstring>
using namespace std;
bool dvisited[1001];
bool bvisited[1001];
int n;
vector< vector<int> > adj(1001);
void dfs(int x){
    printf("%d ",x);
    dvisited[x]=true;
    for(int next:adj[x]){
        if(!dvisited[next]){
            dfs(next);
        }
    }
}
void bfs(int x){
    printf("%d ",x);
    bvisited[x]=true;
    queue<int> q;
    q.push(x);
    while(!q.empty()){
        int size = q.size();
        //for(int i=0;i<size;i++){
            int curr = q.front();
            q.pop();
            for(int next:adj[curr]){
                if(!bvisited[next]){
                    bvisited[next]=true;
                    printf("%d ",next);
                    q.push(next);
                }
            }
        //}
    }
}
int main(){
    int m,v,x,y;
    scanf("%d %d %d",&n,&m,&v);
    while(m--){
        scanf("%d %d",&x,&y);
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    for(int i=0;i<=n;i++){
       sort(adj[i].begin(),adj[i].end());
    }
    memset(bvisited,false,sizeof(bvisited));
    memset(dvisited,false,sizeof(dvisited));
    dfs(v);
    printf("\n");
    bfs(v);
    printf("\n");
    return 0;
}