FWATER - Tưới nước đồng cỏ

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 305

int c[N][N], n, d[N];
bool Free[N];

void enter() {
	scanf( "%d", &n );
	fo(i,1,n) {
		scanf ( "%d", &c[0][i] );
		c[i][0] = c[0][i];
	}
	fo(i,1,n) {
		fo(j,1,n) scanf( "%d", &c[i][j] );
		c[i][i] = INF;
	}
}

int prim() {
	fill(Free, Free+n+1, 1);
	fill(d,d+n+1,INF); d[0] = 0;
	int res = 0;
	rep(k, n+1) {
		int u, dmin = INF;
		rep(i,n+1) if( Free[i] && d[i] < dmin ) {
			dmin = d[i]; u = i;
		}
		res += d[u]; Free[u] = 0;
		rep(v,n+1) if( Free[v] && d[v] > c[u][v] ) d[v] = c[u][v];
	}
	return res;
}

int main() {
	//freopen( "input.txt", "r", stdin );
	//freopen( "output.txt", "w", stdout );
	enter();
	printf( "%d\n", prim() );
	return 0;
}

Download