Submission #3962870


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


inline int make_pq(int p, int q, int n) {
    int x = 0;
    for (int i=0,b=1,m=1; i<n; ++i,m<<=1) {
        while (!(p & b)) b <<= 1;
        if (q & m) {
            x |= b;
        }
        b <<= 1;
    }
    return x;
}

ll solve(int N, vvi& a) {
    int P = 1 << N;

    vll cm(P, 0);
    vll dp(P, 0);

    for (int i=0,b=1; i<N; ++i,b<<=1) {
        for (int j=0; j<b; ++j) {
            ll acc = 0;
            for (int k=0,m=1; m<b; ++k,m<<=1) {
                if (j & m) acc += a[i][k];
            }
            cm[b+j] = cm[j] + acc;
        }
    }

    for (int p=1; p<P; ++p) {
        int n = __builtin_popcount(p);
        if (n < 2) continue;
        int B = n;
        int Q = 1 << B;
        dp[p] = cm[p];
        rep(q,Q) {
            int alpha = make_pq(p, q, B), beta = p - alpha;
            amax(dp[p], dp[alpha] + dp[beta]);
        }
    }

    return dp[P-1];
}

int main() {
    int N; scanf("%d", &N); read_cr();
    vvi a(N);
    rep(i,N) {
        loadvec(a[i], N);
    }
    cout << solve(N,a) << endl;
    return 0;
}

Submission Info

Submission Time
Task U - Grouping
User naoya_t
Language C++14 (GCC 5.4.1)
Score 100
Code Size 4144 Byte
Status
Exec Time 659 ms
Memory 1408 KB

Compile Error

./Main.cpp: In function ‘void read_cr()’:
./Main.cpp:95:28: warning: ignoring return value of ‘char* fgets(char*, int, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     fgets(_buf, 256, stdin);
                            ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:143:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int N; scanf("%d", &N); read_cr();
                           ^

Test Cases

Set Name Score / Max Score Test Cases
All 100 / 100 0_00, 0_01, 0_02, 0_03, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11, 1_12, 1_13, 1_14, 1_15, 1_16, 1_17, 1_18, 1_19
Case Name Status Exec Time Memory
0_00 1 ms 256 KB
0_01 1 ms 256 KB
0_02 1 ms 256 KB
0_03 659 ms 1280 KB
1_00 1 ms 256 KB
1_01 659 ms 1280 KB
1_02 659 ms 1280 KB
1_03 659 ms 1280 KB
1_04 659 ms 1280 KB
1_05 659 ms 1280 KB
1_06 658 ms 1280 KB
1_07 659 ms 1280 KB
1_08 658 ms 1280 KB
1_09 659 ms 1280 KB
1_10 659 ms 1280 KB
1_11 658 ms 1280 KB
1_12 659 ms 1408 KB
1_13 658 ms 1280 KB
1_14 659 ms 1280 KB
1_15 658 ms 1280 KB
1_16 658 ms 1280 KB
1_17 658 ms 1280 KB
1_18 659 ms 1280 KB
1_19 659 ms 1280 KB