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
|
#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 305
#define nm 20005
using namespace std;
const double pi=acos(-1);
const int inf=1e9+7;
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,d[20][NM][NM];
ll ans;
void div(int k,int x,int y){
if(x==y){
inc(i,1,n)if(i!=x)inc(j,1,n)if(j!=x){if(d[k][i][j]<inf)ans+=d[k][i][j];else ans--;}
return;
}
inc(i,1,n)inc(j,1,n)d[k+1][i][j]=d[k][i][j];
inc(v,mid+1,y)inc(i,1,n)inc(j,1,n)d[k+1][i][j]=min(d[k+1][i][j],d[k+1][i][v]+d[k+1][v][j]);
div(k+1,x,mid);
inc(i,1,n)inc(j,1,n)d[k+1][i][j]=d[k][i][j];
inc(v,x,mid)inc(i,1,n)inc(j,1,n)d[k+1][i][j]=min(d[k+1][i][j],d[k+1][i][v]+d[k+1][v][j]);
div(k+1,mid+1,y);
}
int main(){
n=read();
inc(i,1,n)inc(j,1,n){
int t=read();if(t==-1)t=inf;
d[0][i][j]=t;
}
div(0,1,n);
return 0*printf("%lld\n",ans);
}
|
