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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define mid (x+y>>1)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define NM 205
#define nm 20005
using namespace std;
const double pi=acos(-1);
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,m,a[NM],tmp[NM],cnt,ca;
ll d[NM][NM][NM],ans[nm];
struct P{
int x,y,i,t;
bool operator<(const P&o)const{return t<o.t;}
}c[nm];
bool cmp(int x,int y){return a[x]<a[y];}
int main(){
int _=read();while(_--){
n=read();m=read();
inc(i,1,n)a[i]=read(),tmp[i]=i;
sort(tmp+1,tmp+1+n,cmp);
inc(i,1,n)inc(j,1,n)d[0][i][j]=read();
inc(k,1,n)inc(i,1,n)inc(j,1,n)d[k][i][j]=min(d[k-1][i][j],d[k-1][i][tmp[k]]+d[k-1][tmp[k]][j]);
sort(a+1,a+1+n);
inc(i,1,m)c[i].x=read(),c[i].y=read(),c[i].t=read(),c[i].i=i;
sort(c+1,c+1+m);
cnt=0;
inc(i,1,m){
while(cnt<n&&a[cnt+1]<=c[i].t)cnt++;
ans[c[i].i]=d[cnt][c[i].x][c[i].y];
}
printf("Case #%d:\n",++ca);
inc(i,1,m)printf("%lld\n",ans[i]);
}
return 0;
}
|
