【玄关】75pts，ai=0的点WA求助

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#define ll long long
using namespace std;
const int N=1e4+5,M=2e4+5,K=105;
struct edge{int ed,nxt,tm;}b[M];
struct node{int x,s;};
int n,m,k,tot,u,v,w,s,ans=-1,nbs[N],vis[N][K];
void add(int x,int y,int z){b[++tot]={y,nbs[x],z};nbs[x]=tot;}
bool bfs(int t){
	memset(vis,0,sizeof vis);
	vis[n][0]=1;
	queue<node>q;
	q.push({n,t});
	while(!q.empty()){
		u=q.front().x;s=q.front().s;q.pop();
//		cout<<u<<" "<<s<<endl;
		if(u==1&&s%k==0)return 1;
		s--;
		if(s<0)break;
		for(int x=nbs[u];x;x=b[x].nxt){
			v=b[x].ed;w=b[x].tm;
			if(vis[v][s%k]||s<w)continue;
			vis[v][s%k]=1;
			q.push({v,s});
		}
	}
	return 0;
}
int main(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&u,&v,&w);
		add(v,u,w);
	}
	for(int l=0,r=1e7,mid;l<=r;){
		mid=l+r>>1;
		if(bfs(mid*k))ans=mid*k,r=mid-1;
		else l=mid+1;
	}
	printf("%d",ans);
	return 0;
}
/*
TEST 1:
9 14 95
7 9 0
6 9 0
4 2 0
3 4 0
5 7 0
7 9 0
8 7 0
5 3 0
8 7 0
1 6 0
5 3 0
2 8 0
3 1 0
6 5 0

190
*/