Submission #117029

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <cassert>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include <bitset>
#include <stack>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define chmax(a,b) (a<(b)?(a=b,1):0)
#define chmin(a,b) (a>(b)?(a=b,1):0)
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
const int INF = 1<<29;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef pair<int,int> pii;
typedef long long ll;


int g[15][15];
int dp[15][1<<15][15];

int main() {
  int n;
  while(cin >> n) {
    REP(i,n) g[i][i] = 0;
    REP(i,n-1) {
      for (int j=i+1; j<n; ++j) {
        cin >> g[i][j];
        g[j][i] = g[i][j];
      }
    }
    if (n==2) {
      cout << 0 << " " << 0 << endl;
      continue;
    }
    memset(dp,0x3f,sizeof(dp));
    REP(i,n) dp[i][1<<i][i] = 0;
    REP(k,n) {
      REP(S,1<<n) {
        REP(i,n) {
          if (S>>i&1) {
            REP(j,n) {
              if (S>>j&1) continue;
              chmin(dp[k][S|1<<j][j], dp[k][S][i]+g[i][j]);
            }
          }
        }
      }
    }
    int ans = INF;
    REP(i,n) REP(j,n) chmin(ans, g[i][j]+dp[i][(1<<n)-1][j]);
    cout << n << " " << ans << endl;
  }
}

Submission Info

Judge Result