295B.cpp

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <stack>
#include <cassert>
#include <fstream>
#include <cstring>
#include <numeric>
#include <ctype.h>
#include <stdio.h>
#define MOD 100000000   
#define exit return 0
#define inf 10000000000
#define exit return 0
#define PS system("pause")
#define S 100007
#define mx(a,b) a>b?a:b
#define R0(i,n) for (i = 0; i < n; i++)
#define R1(i,n) for (i = 1; i <= n; i++)
#define MS(a,x) memset(x, a, sizeof(x));
#define left (v<<1)
#define right (left|1)
#define mid ((tl+tr)>>1)
#define SZ(x) ((int)x.size())
#define MX(a,b)a>b?a:b
const double eps = 1e-10;


using namespace std;
using ll = long long;
using ul = unsigned long long;
using PII = pair<int, int>;
const int NN = 511;
int aa[NN], cc[NN];
string in;
int n, m, k, s, x, y, z, c, d, a, b, e, q, answww = 0;
vector<int>pp;

ll ww[NN][NN];
ll noneed[NN];
ll gr[NN][NN];
ll answ[NN];


int main(){

	scanf("%d", &n);

	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= n; j++){
			scanf("%I64d", &a);
			ww[i][j] = a;
		}
	}

	for (int i = 1; i <= n; i++){
		scanf("%d", &aa[i]);
	}

	for (int k = n; k >= 1; k--){
		int yy = aa[k];
		cc[aa[k]] = 1;
		//update throw this vertices
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= n; j++){
				ww[i][j] = min(ww[i][j], ww[i][yy] + ww[yy][j]);
			}
		}
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= n; j++){
				if (cc[i] && cc[j]){
					answ[k] += ww[i][j];
				}
			}
		}
	}
	for (int i = 1; i <= n; i++){
		printf("%I64d ", answ[i]);
	}
	//PS;
	exit;




}