Submission #1830692


Source Code Expand

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

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
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;

#define sz(a)  int((a).size())
#define pb  push_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 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))


int solve(int N, vi& F, vvi& P) {
    int sc_max = 0x80000000;
    rep1(p, 1023){
        int sc = 0;
        rep(n, N){
            int cnt = __builtin_popcount(F[n] & p);
            sc += P[n][cnt];
        }
        sc_max = max(sc_max, sc);
    }
    return sc_max;
}

int main() {
    int N; cin >> N;
    vi F(N, 0);
    vector<int> tmp(10);
    rep(n, N){
        rep(i, 10) cin >> tmp[i];
        for (int i=0,m=1; i<10; ++i,m<<=1){
            if (tmp[i]) F[n] |= m;
        }
    }
    vvi P(N, vi(11));
    rep(n, N){
        rep(i, 11) cin >> P[n][i];
    }
    cout << solve(N,F,P) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Shopping Street
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1725 Byte
Status
Exec Time 2 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 300 / 300 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt 2 ms 256 KB
02.txt 2 ms 256 KB
03.txt 2 ms 256 KB
04.txt 2 ms 256 KB
05.txt 2 ms 256 KB
06.txt 2 ms 256 KB
07.txt 2 ms 256 KB
08.txt 2 ms 256 KB
09.txt 2 ms 256 KB
10.txt 2 ms 256 KB
11.txt 2 ms 256 KB
12.txt 1 ms 256 KB
13.txt 1 ms 256 KB
14.txt 2 ms 256 KB
15.txt 2 ms 256 KB
16.txt 2 ms 256 KB
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB