题目大意:一个图,若干单向边,从1出发,求一条经过边权值>=m的路径的最少边数
题解:我YY了一个把1703加上二分的naive做法……但是这样是两个log的……TLE,在JZOJ上可以得40pts
我的收获:Orz
//TLE
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1e18
#define N 105
int n,T;
ll m;
struct Mat{int x;ll v[N][N];Mat(){x=1,memset(v,0,sizeof(v));}}w;
Mat operator*(Mat a,Mat b){
Mat c;c.x=a.x;
for(int i=1;i<=a.x;i++)
for(int j=1;j<=b.x;j++)
{
c.v[i][j]=-INF;
for(int k=1;k<=a.x;k++)
c.v[i][j]=max(c.v[i][j],a.v[i][k]+b.v[k][j]);
if(c.v[i][j]>m) c.v[i][j]=m;//大于m就没用了,防止溢出
}
return c;
}
Mat operator^(Mat a,ll p){
Mat c;bool flag=true;
for(;p;p>>=1,a=a*a)
if(p&1){if(flag) c=a,flag=false;else c=c*a;}
return c;
}
bool check(ll x)
{
Mat ret=w^x;ll mx=0;
for(int i=1;i<=n;i++) mx=max(mx,ret.v[1][i]);
return mx>=m;
}
void work()
{
ll ans;
for(ll l=0,r=INF;l<=r;){
ll mid=l+r>>1;
if(check(mid)) ans=mid,r=mid-1;
else l=mid+1;
}
printf("%lld\n",ans);
}
void init()
{
scanf("%d%lld",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
scanf("%lld",&w.v[i][j]);
if(!w.v[i][j]) w.v[i][j]=-INF;
}
w.x=n;
}
int main()
{
scanf("%d",&T);
while(T--) init(),work();
return 0;
}