Submission #2714523

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
typedef long long ll;

const int INF = 1e9 + 7;
const long long LLINF = 1e18;

int n;
int f[101][11];
int p[101][11];
int main() {
    cin>>n;
    REP(i, 0, n) REP(j, 0, 10){
        cin>>f[i][j];
    }
    REP(i, 0, n) REP(j, 0, 11){
        cin>>p[i][j];
    }

    int ans=-INF;
    REP(bit, 1, 1<<10){
        int sum=0;
        REP(i, 0, n){
            int cnt=0;
            REP(j, 0, 10){
                if((bit>>j & 1) && f[i][j]) cnt++;
            }
            sum+=p[i][cnt];
        }
        ans=max(ans, sum);
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result