algorithmStudy/11725.cpp at master · judy5050/algorithmStudy · 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
59
60
61
62
63
64
//
//  11725.cpp
//  algo
//
//  Created by 박효정 on 2021/06/17.
//

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

int main(){

    cin.tie(0);
    cout.tie(0);
    std::ios::sync_with_stdio(false);


    int n;
    cin>>n;
    vector<int>t[n+1];

    for(int i=0;i<n-1;i++){
        int a,b;
        cin>>a>>b;

        //양방향 관계
        t[a].push_back(b);
        t[b].push_back(a);


    }

    vector<int>res(n+1);
    vector<int>vis(n+1);
    queue<int>q;
    q.push(1);
    while(!q.empty()){
        int now=q.front();
        vis[now]=1;
        q.pop();
        for(int i=0;i<t[now].size();i++){
            if(vis[t[now][i]]==0){
                q.push(t[now][i]);
                res[t[now][i]]=now;
                vis[t[now][i]]=1;
            }


        }

    }

    for(int i=2;i<=n;i++){
        cout<<res[i]<<"\n";
    }


    return 0;
}