VDANGER - Nguy hiểm rõ ràng trước mắt

Tác giả: happyboy99x

Ngôn ngữ: C++

#include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;

typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
typedef vector<int> vi;
typedef vector<vi> vvi;

#define sz(a) int((a).size())
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(), _e = (c).end(); it != _e; ++it)
#define present(c,x) ((c).find(x) != (c).end())
#define cpresent(c,x) (find(all(c),x) != (c).end())
#define rep(i,n) for(int i = 0, _n = (n); i < _n; ++i)
#define repd(i,n) for(int i = (n)-1; i >= 0; --i )
#define fo(i,a,b) for(int i = (a), _b = (b); i <= _b; ++i)
#define fod(i,a,b) for(int i = (a), _b = (b); i >= _b; --i)

#define INF 1000000000
#define N 105
#define M 10005

int a[M], g[N][N], n, m;

int main() {
	//freopen( "input.txt", "r", stdin );
	//freopen( "output.txt", "w", stdout );
	scanf( "%d%d", &n, &m );
	rep(i,m) { scanf( "%d", a+i ); --a[i]; }
	rep(i,n) { rep(j,n) scanf( "%d", &g[i][j] ); g[i][i] = INF; }
	rep(k,n) rep(i,n) rep(j,n) g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
	long long res = 0; rep(i,m-1) res += g[a[i]][a[i+1]];
	cout << res << endl;
	return 0;
}

Download