oj.uz

Submission #651935

# Submission time Handle Problem Language Result Execution time Memory
651935 2022-10-20T14:58:39 Z pauloamed Bank (IZhO14_bank) C++14
100 / 100
 440 ms 27732 KB 
#include<bits/stdc++.h>
using namespace std;

const int MAXS = 20010;
const int MAXN = 20;
const int MAXB = (1 << 20);
 
vector<int> salsum2masks[MAXS];
vector<int> notesum2masks[MAXS];

int T = 0;
bool fa[MAXN][MAXB];

vector<int> sos(vector<int> input, vector<int> query){
  for(auto x : input) fa[T][x] = 1;
 
  // SOS pd
  for(int i = 0;i < MAXN; ++i){
    for(int mask = 0; mask < MAXB; ++mask){
      if(mask & (1<<i)) fa[T][mask] += fa[T][mask^(1<<i)];
    }
  }
  
  vector<int> ret;
  for(auto x : query){
    if(fa[T][x]) ret.push_back(x);
  }

  T++;
  return ret;
}
 
int main(){
  cin.tie(NULL)->sync_with_stdio(false);

  int n, m; cin >> n >> m;

  vector<int> sal(n);
  for(auto &x : sal) cin >> x;

  vector<int> notes(m);
  for(auto &x : notes) cin >> x;

  for(int i = 0; i < (1 << m); ++i){
    int sum = 0;
    for(int j = 0; j < m; ++j) if((i >> j) & 1){
      sum += notes[j];
    }
    notesum2masks[sum].push_back(i);
  }

  vector<int> curr_ans = notesum2masks[sal[0]];

  int sum = sal[0];
  for(int i = 1; i < n; ++i){
    sum += sal[i];
    curr_ans = sos(curr_ans, notesum2masks[sum]);
    if(curr_ans.empty()) break;
  }

  if(curr_ans.empty()) cout << "NO\n";
  else cout << "YES\n";

  

}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1264 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 3 ms 1364 KB Output is correct
5 Correct 65 ms 7852 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 64 ms 6604 KB Output is correct
9 Correct 62 ms 7012 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 4224 KB Output is correct
2 Correct 39 ms 3284 KB Output is correct
3 Correct 20 ms 2292 KB Output is correct
4 Correct 59 ms 4300 KB Output is correct
5 Correct 75 ms 5368 KB Output is correct
6 Correct 80 ms 5324 KB Output is correct
7 Correct 39 ms 3328 KB Output is correct
8 Correct 58 ms 4340 KB Output is correct
9 Correct 19 ms 2260 KB Output is correct
10 Correct 80 ms 5304 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 7628 KB Output is correct
2 Correct 40 ms 3404 KB Output is correct
3 Correct 185 ms 10684 KB Output is correct
4 Correct 23 ms 2388 KB Output is correct
5 Correct 40 ms 3316 KB Output is correct
6 Correct 22 ms 2468 KB Output is correct
7 Correct 61 ms 4364 KB Output is correct
8 Correct 39 ms 3456 KB Output is correct
9 Correct 142 ms 8724 KB Output is correct
10 Correct 136 ms 8612 KB Output is correct
11 Correct 21 ms 2388 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1264 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 3 ms 1364 KB Output is correct
5 Correct 65 ms 7852 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 64 ms 6604 KB Output is correct
9 Correct 62 ms 7012 KB Output is correct
10 Correct 56 ms 4224 KB Output is correct
11 Correct 39 ms 3284 KB Output is correct
12 Correct 20 ms 2292 KB Output is correct
13 Correct 59 ms 4300 KB Output is correct
14 Correct 75 ms 5368 KB Output is correct
15 Correct 80 ms 5324 KB Output is correct
16 Correct 39 ms 3328 KB Output is correct
17 Correct 58 ms 4340 KB Output is correct
18 Correct 19 ms 2260 KB Output is correct
19 Correct 80 ms 5304 KB Output is correct
20 Correct 114 ms 7628 KB Output is correct
21 Correct 40 ms 3404 KB Output is correct
22 Correct 185 ms 10684 KB Output is correct
23 Correct 23 ms 2388 KB Output is correct
24 Correct 40 ms 3316 KB Output is correct
25 Correct 22 ms 2468 KB Output is correct
26 Correct 61 ms 4364 KB Output is correct
27 Correct 39 ms 3456 KB Output is correct
28 Correct 142 ms 8724 KB Output is correct
29 Correct 136 ms 8612 KB Output is correct
30 Correct 21 ms 2388 KB Output is correct
31 Correct 84 ms 8640 KB Output is correct
32 Correct 100 ms 9084 KB Output is correct
33 Correct 181 ms 13624 KB Output is correct
34 Correct 239 ms 17048 KB Output is correct
35 Correct 261 ms 18992 KB Output is correct
36 Correct 437 ms 27732 KB Output is correct
37 Correct 89 ms 9660 KB Output is correct
38 Correct 92 ms 9324 KB Output is correct
39 Correct 200 ms 14976 KB Output is correct
40 Correct 129 ms 11344 KB Output is correct
41 Correct 107 ms 9692 KB Output is correct
42 Correct 144 ms 10828 KB Output is correct
43 Correct 181 ms 14832 KB Output is correct
44 Correct 93 ms 9628 KB Output is correct
45 Correct 108 ms 9376 KB Output is correct
46 Correct 164 ms 13652 KB Output is correct
47 Correct 339 ms 22388 KB Output is correct
48 Correct 63 ms 6896 KB Output is correct
49 Correct 64 ms 6988 KB Output is correct
50 Correct 429 ms 25644 KB Output is correct
51 Correct 236 ms 16272 KB Output is correct
52 Correct 237 ms 15556 KB Output is correct
53 Correct 240 ms 16120 KB Output is correct
54 Correct 418 ms 25640 KB Output is correct
55 Correct 428 ms 25680 KB Output is correct
56 Correct 440 ms 26064 KB Output is correct
57 Correct 427 ms 26076 KB Output is correct
58 Correct 408 ms 25012 KB Output is correct