Submission #41236

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
41236	2018-02-15 00:23:53	IvanC	Bank (IZhO14_bank)	C++14	100 / 100	298 ms	90096 KiB

bank

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 20;
const int MAXV = 1001;
const int MAXL = (1 << 20);
vector<int> possiveis[MAXN*MAXV];
int dp[MAXN][MAXL],n,m,vetor[MAXN],obj[MAXN];
int solve(int pos,int bitmask){
  if(pos == n) return 1;
  if(dp[pos][bitmask] != -1) return dp[pos][bitmask];
  for(int mascara : possiveis[vetor[pos]]){
    if(!(mascara & bitmask)){
      if(solve(pos+1,bitmask | mascara )) return dp[pos][bitmask] = 1;
    }
  }
  return dp[pos][bitmask] = 0;
}
void brute(int pos,int bitmask,int val){
  if(pos == m){
    possiveis[val].push_back(bitmask);
    return;
  }
  brute(pos+1,bitmask,val);
  brute(pos+1,bitmask | (1 << pos), val + obj[pos] );
}
int main(){
  cin >> n >> m;
  for(int i = 0;i<n;i++) cin >> vetor[i];
  for(int i = 0;i<m;i++) cin >> obj[i];
  brute(0,0,0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 19 / 19
• Subtask 2: 25 / 25
• Subtask 3: 27 / 27
• Subtask 4: 29 / 29