Codeforces Round #536 (Div. 2) D. Lunar New Year and a Wander 优先队列

题目链接：

传送门

代码如下：

#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int n,m;
vector<int>v[maxn];
int ans[maxn];
int vis[maxn],cnt=0;
int push[maxn];
void dfs(int loc,int num)
{
    if(num==n) return;
    int Size=v[loc].size();
    for (int i=0;i<Size;i++)
    {
        int t=v[loc][i];
        if(num>=cnt&&!vis[t])
        {
            ans[cnt++]=t;
            vis[t]=1;
            dfs(t,num+1);
        }
        else
        {
            if(t<ans[num-1])
            {
                ans[num-1]=t;
                vis[t]=1;
                dfs(t,num+1);
            }
            else
            {
                dfs(t,num);
            }
        }
    }
}
void bfs ()
{
    priority_queue<int,vector<int>, greater<int> > q;
    q.push(1);
    push[1]=1;
    while (cnt<n)
    {
        int t=q.top();
        q.pop();
        vis[t]=1;
        ans[cnt++]=t;
        int Size=v[t].size();
        for (int i=0;i<Size;i++)
        {
            int x=v[t][i];
            if(!push[x])
            {
                q.push(x);
                push[x]=1;
            }
        }
    }
}
int main()
{
    memset (vis,0,sizeof(vis));
    memset (push,0,sizeof(push));
    scanf("%d%d",&n,&m);
    for (int i=0;i<m;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    bfs();
    for (int i=0;i<n;i++)
        printf("%d ",ans[i]);
    return 0;
}