请问运行过程中,堆(即下方的 priority_queue)中最多有多少个元素:
#include<bits/stdc++.h>
using namespace std;
int n,m,s,cnt,head[100001],dis[100001];
bool vis[100001];
struct edge
{
int nxt,to,w;
}e[200001];
struct node
{
int pos,dis;
bool operator<(const node &x)const
{
return dis>x.dis;
}
};
void add_edge(int u,int v,int w)
{
e[++cnt].nxt=head[u];
e[cnt].to=v;
e[cnt].w=w;
head[u]=cnt;
}
void dijkstra(int s)
{
priority_queue<node>q;
memset(dis,0x3f,sizeof(dis));
dis[s]=0;
q.push((node){s,0});
while(q.size())
{
int u=q.top().pos;
q.pop();
if(vis[u])continue;
vis[u]=true;
for(int i=head[u];i;i=e[i].nxt)
{
int v=e[i].to;
if(dis[v]>dis[u]+e[i].w)
{
dis[v]=dis[u]+e[i].w;
if(!vis[v])q.push((node){v,dis[v]});
}
}
}
}
template<typename T>void read(T &x)
{
x=0;
char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))
{
x=(x<<3)+(x<<1)+(ch^48);
ch=getchar();
}
}
int main()
{
read(n),read(m),read(s);
for(int i=1,u,v,w;i<=m;++i)
{
read(u),read(v),read(w);
add_edge(u,v,w);
}
dijkstra(s);
for(int i=1;i<=n;++i)printf("%d ",dis[i]);
return 0;
}