Submission #117886

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

int E[15][15];
int dp[1<<15][15];
void amin(int &x, int y) {
	if(x > y) x = y;
}
int main() {
	int N;
	cin >> N;
	rep(i, N-1) {
		reu(j, i+1, N) {
			int x;
			cin >> x;
			E[j][i] = E[i][j] = x;
		}
	}
	if(N == 2) {
		puts("0 0");
		return 0;
	}
	mset(dp, INF);
	dp[1][0] = 0;
	rep(mask, 1 << N) rep(i, N) {
		int x = dp[mask][i];
		if(x == INF) continue;
		assert(mask >> i & 1);
		rep(j, N) if(~mask >> j & 1)
			amin(dp[mask | 1 << j][j], x + E[i][j]);
	}
	int r = INF;
	rep(i, N) r = min(r, dp[(1 << N)-1][i] + E[i][0]);
	cout << N << " " << r << endl;
    return 0;
}

Submission Info

Judge Result