Submission #3957376

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

#define N 16

int n;
int a[N][N];
ll s[1 << N];

ll memo[1 << N];
bool used[1 << N];
ll dfs(int state) {
  int t = (-1 & state);
  if(used[state]) {
    return memo[state];
  }
  used[state] = true;
  ll r = -INFLL;
  while(t > 0) {
    r = max(r, dfs(state ^ t) + s[t]);
    t = (t - 1) & state;
  }
  return memo[state] = r;
}

int main() {
  cin >> n;
  rep(i, n) rep(j, n) cin >> a[i][j];
  rep(state, 1<<n) {
    used[state] = false;
    s[state] = 0;
    rep(i, n) {
      if((state & (1 << i)) == 0) continue;
      rep(j, n) {
        if(i >= j || (state & (1 << j)) == 0) continue;
        s[state] += a[i][j];
      }
    }
  }
  used[0] = true;
  memo[0] = 0;
  cout << dfs((1 << n) - 1) << endl;
  return 0;
}

Submission Info

Judge Result