题目链接:https://ac.nowcoder.com/acm/contest/283/H
这道题要求的是最小的乘积,虽然数据很大要求取模mod,如果直接去用乘法松弛还是会有精度损失的,然后题目上说了w的值一定是2的整数次幂,所以我们可以将w的值存一个log2,然后跑一遍dij,那么最后2的s到t的最短路程次方就是要求的结果,最后用快速幂处理一下就好了。
AC代码:
#include <bits/stdc++.h>
#define maxm 100005
#define maxn 50005
#define ll long long
#define inf 0x3f3f3f3f
const int mod = 1e9+7;
using namespace std;
struct Node{
int to,w,next;
bool operator < (const Node &a) const{
return a.w < w;
}
}Edge[maxm],S,Next;
int head[maxm],num;
int dist[maxn];
bool vis[maxn];
int n,m,s,t;
void init(){
memset(head,-1,sizeof(head));
num = 0;
}
void add(int u,int v,int w){
Edge[num].to = v;
Edge[num].w = w;
Edge[num].next = head[u];
head[u] = num ++;
}
ll ppow(ll a, ll b){
ll sum = 1;
a %= mod;
while(b > 0){
if(b % 2 == 1) sum = (sum * a) % mod;
b /= 2;
a = (a * a) % mod;
}
return sum;
}
void dijkstra(){
for(int i=0;i<=n;i++){
dist[i] = inf;
vis[i] = false;
}
priority_queue<Node> q;
S.to = s;
dist[s] = 0;
q.push(S);
while(!q.empty()){
int u = q.top().to;
q.pop();
if(vis[u]) continue;
vis[u] = true;
for(int i=head[u];i!=-1;i=Edge[i].next){
int v = Edge[i].to;
if(!vis[v] && dist[v] > dist[u] + Edge[i].w){
dist[v] = dist[u] + Edge[i].w;
Next.to = v;
Next.w = dist[v];
q.push(Next);
}
}
}
}
int main()
{
while(~scanf("%d%d%d%d",&n,&m,&s,&t)){
init();
for(int i=0;i<m;i++){
int u,v;
ll w;
scanf("%d%d%lld",&u,&v,&w);
add(u, v, log2(w));
}
dijkstra();
if(dist[t] == inf) puts("-1");
else printf("%lld\n",ppow(2, dist[t]));
}
return 0;
}