神奇输出求调
查看原帖
神奇输出求调
1241319
YWJ20140130楼主2024/6/15 17:56

这是我的代码。

#include<bits/stdc++.h>
#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
#define N 10000001
priority_queue<pair<double,int>> Q;
double d[N];
bool v[N],head[N];
int tot=0;
struct node{
	long long nxt,to;
	double ver;
}edge[N];   
void add_edge(int u,int v,double w){
	++tot;
	edge[tot].to=v;
	edge[tot].ver=1.0-w/100.0;
	edge[tot].nxt=head[u];
	head[u]=tot;
}
void dijkstra(int s){
	memset(d,1.0,sizeof(d));
	memset(v,0,sizeof(v));
	d[s]=1.0;Q.push(make_pair(1.0,s));
	while(!Q.empty()){
		int x=Q.top().second;Q.pop();
		if(v[x]) continue;
		v[x]=1;
		for(int i=head[x];i;i=edge[i].nxt){
			int y=edge[i].to;double z=edge[i].ver;
			if(d[y]<d[x]*z){
				d[y]=d[x]*z;
				if(!v[y]) Q.push(make_pair(d[y],y));
			}
		}
	}
}
int n,m,x,y;double z;
int A,B;
int main(){
	io
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>x>>y>>z;
		add_edge(x,y,z);
		add_edge(y,x,z);
	}
	cin>>A>>B;
	dijkstra(A);
	printf("%.8lf",100/d[B]);
	return 0;
}

请问为什么样例输出

12905550161830171000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
00000000000000000000
000000.00000000

?

2024/6/15 17:56
加载中...