1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
| #include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
#define maxn 105
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
inline void read(int &x){
int f=1;x=0;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
x*=f;
}
namespace Debug{
Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int w[maxn][maxn],n,m,f[65][maxn][maxn],t[maxn][maxn],s[maxn][maxn];
inline void solve(void) {
int i,j,k,l,Ans=0,p=0;
read(n);read(m);
memset(f,-1,sizeof(f));
memset(t,-1,sizeof(t));
for (i=1;i<=n;i++) for (j=1;j<=n;j++) read(w[i][j]),w[i][j]=(w[i][j]==0?-1:w[i][j]),f[0][i][j]=w[i][j];
for (i=1;i<=n;i++) t[i][i]=0,f[0][i][i]=max(w[i][i],0ll);
for (l=1;l<=61;l++) {
for (i=1;i<=n;i++) f[l][i][i]=0;
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (f[l-1][k][j]!=-1&&f[l-1][i][k]!=-1&&f[l-1][i][k]+f[l-1][k][j]>f[l][i][j]) {
f[l][i][j]=f[l-1][i][k]+f[l-1][k][j];
if (f[l][1][j]>=m) {p=l;}
}
if (p) break;
}
for (l=p;l>=0;l--) {int flag=0;
memset(s,-1,sizeof(s));
for (i=1;i<=n;i++) s[i][i]=0;
for (k=1;k<=n;k++)
for (i=1;i<=n;i++)
for (j=1;j<=n;j++)
if (t[i][k]!=-1&&f[l][k][j]!=-1&&t[i][k]+f[l][k][j]>s[i][j]) s[i][j]=t[i][k]+f[l][k][j];
for (j=1;j<=n;j++) if (s[1][j]>=m) {flag=1;break;}
if (flag) continue;
memcpy(t,s,sizeof(t));
Ans+=(1ll<<l);
}
printf("%lld\n",Ans+1);
}
signed main(void){
int T;read(T);
while (T--) solve();
return 0;
}
|