Lunar New Year and a Wander

题目链接

思路：BFS，利用优先队列。

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(false)
#define DEBUG cout<<endl<<"DEBUG"<<endl;
using namespace std;
int arr[100010], cnt, s[100010];
set<int> v[100010];
int main() {
    int n, m, k;
    cin >> n >> m;
    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        v[a].insert(b), v[b].insert(a);
    }
    priority_queue<int> q;
    for(k = s[1] = 1;; cnt++) {
        arr[cnt] = k;
        for(auto e : v[k]) {
            if(!s[e])
                q.push(-e), s[e] = 1;
        }
        if(q.empty())
            break;
        k = -q.top();
        q.pop();
    }
    for(int i = 0; i < n; i++)
        cout << arr[i] << " ";
    return 0;
}