CodeForces296 D.Greg and Graph(逆向floyd插点)

D. Greg and Graph

Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:

The game consists of n steps.
On the i-th step Greg removes vertex number xi from the graph. As Greg removes a vertex, he also removes all the edges that go in and out of this vertex.
Before executing each step, Greg wants to know the sum of lengths of the shortest paths between all pairs of the remaining vertices. The shortest path can go through any remaining vertex. In other words, if we assume that d(i, v, u) is the shortest path between vertices v and u in the graph that formed before deleting vertex xi, then Greg wants to know the value of the following sum: .
Help Greg, print the value of the required sum before each step.

Input

The first line contains integer n (1 ≤ n ≤ 500) — the number of vertices in the graph.

Next n lines contain n integers each — the graph adjacency matrix: the j-th number in the i-th line aij (1 ≤ aij ≤ 105, aii = 0) represents the weight of the edge that goes from vertex i to vertex j.

The next line contains n distinct integers: x1, x2, …, xn (1 ≤ xi ≤ n) — the vertices that Greg deletes.

Output

Print n integers — the i-th number equals the required sum before the i-th step.

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64d specifier.

Examples

input

1
0
1

output

0

input

2
0 5
4 0
1 2

output

9 0

input

4
0 3 1 1
6 0 400 1
2 4 0 1
1 1 1 0
4 1 2 3

output

17 23 404 0

思路:

点只有500个，最短路考虑用Floyd求，
正向floyd每次重新建图复杂度炸了

这题离线逆向floyd插点

相当于每次添加一个点
每次用插的点更新最短路，然后标记这个点
累加答案的时候只计算端点都标记过的

code:

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define int long long
const int maxm=505;
int g[maxm][maxm];
int mark[maxm];
int ans[maxm];
int q[maxm];
int n;
signed main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cin>>g[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        cin>>q[i];
    }
    for(int id=n;id>=1;id--){
        int k=q[id];
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
            }
        }
        mark[k]=1;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(mark[i]&&mark[j]){
                    ans[id]+=g[i][j];
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        cout<<ans[i]<<' ';
    }
    cout<<endl;
    return 0;
}