Submission #362031

---

Source Code Expand

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

int main(){
    priority_queue<int> q;
    int n;
    vector<int> *nodes;
    bool *flags;

    cin >> n;

    nodes = new vector<int>[n];
    flags = new bool[n];

    for(int i = 0; i < n; i++){
        flags[i] = false;
    }

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

        cin >> a >> b;
        a --;
        b --;
        nodes[a].push_back(b);
        nodes[b].push_back(a);
    }

    q.push(0);
    flags[0] = true;

    int index = 0;

    while(! q.empty()){
        int k = - q.top();
        q.pop();

        if(index < n - 1){
            cout << k + 1 << ' ';
        }else{
            cout << k + 1 << endl;
        }

        index ++;

        for(int i = 0; i < nodes[k].size(); i++){
            int x = nodes[k][i];
            if(! flags[x]){
                q.push(- x);
                flags[x] = true;
            }
        }
    }


    return 0;
}

Submission Info

Judge Result