Submission #3775586

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <utility>
#include <functional>
#include <fstream>
#define debug(x) cout << #x << " = " << x << endl
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define repr(i,n) for(int i = (n); i > -1; i--)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;


int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n;
  cin>>n;
  int f[n][10];
  int p[n][11];
  rep(i,n) {
    rep(j, 10) cin>>f[i][j];
  }
  rep(i,n) {
    rep(j, 11) cin>>p[i][j];
  }
  
  int mx = -MOD;
  for(int i = 1; i < (1<<10); i++) {
    int tmp = 0;
    rep(j,n) {
      int cnt = 0;
      rep(k, 10) {
        if((i>>k) % 2 == 1 && f[j][k] == 1) cnt++; 
      }
      tmp += p[j][cnt];
    }
    mx = max(mx, tmp);
  }
  cout << mx << endl;

  return 0;

}

Submission Info

Judge Result