oj.uz

Submission #945341

# Submission time Handle Problem Language Result Execution time Memory
945341 2024-03-13T16:24:51 Z nguyennh Bank (IZhO14_bank) C++17
100 / 100
 738 ms 12832 KB 
#include<bits/stdc++.h>
#define el '\n'
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std ;

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

int a[22] , b[22] , n , m;

namespace sub_final{
  void solve(){
    vector<vector<int>> pre_mask(n);
    for ( int i = 0 ; i < n ; i++ ){
      for ( int mask = 0 ; mask < (1 << m) ; mask++ ){
        int sum = 0;
        for ( int j = 0 ; j < m ; j++ ) sum += ((mask >> j & 1) ? b[j] : 0);
        if (sum == a[i]) pre_mask[i].push_back(mask);
      }
    }
    unordered_set<int> store;
    bool satis = true;
    for ( int i = 0 ; i < n ; i++ ){
      if (i == 0){
        for ( auto x : pre_mask[i] ) store.insert(x);
        if (store.empty()){
          satis = false;
          break;
        }
        continue;
      }
      if (store.empty()){
        satis = false;
        break;
      }
      unordered_set<int> cur;
      for ( auto j : store ){
        for ( auto mask : pre_mask[i] ){
          if (mask & j) continue;
          else cur.insert(j | mask);
        }
      }
      if (cur.empty()){
        satis = false;
        break;
      }
      swap(store , cur);
    }
    cout << (satis ? "YES" : "NO");
  }
}

int32_t main (){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
//  freopen("izho_bank.inp" , "r" , stdin);
//  freopen("izho_bank.out" , "w" , stdout);
  cin >> n >> m;
  for ( int i = 0 ; i < n ; i++ ) cin >> a[i];
  for ( int i = 0 ; i < m ; i++ ) cin >> b[i];
  sub_final::solve();
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 7 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 456 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 8 ms 604 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 456 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 13 ms 348 KB Output is correct
32 Correct 80 ms 952 KB Output is correct
33 Correct 42 ms 344 KB Output is correct
34 Correct 60 ms 428 KB Output is correct
35 Correct 77 ms 436 KB Output is correct
36 Correct 119 ms 344 KB Output is correct
37 Correct 13 ms 344 KB Output is correct
38 Correct 25 ms 344 KB Output is correct
39 Correct 102 ms 8664 KB Output is correct
40 Correct 62 ms 344 KB Output is correct
41 Correct 126 ms 344 KB Output is correct
42 Correct 35 ms 604 KB Output is correct
43 Correct 49 ms 344 KB Output is correct
44 Correct 101 ms 432 KB Output is correct
45 Correct 20 ms 660 KB Output is correct
46 Correct 36 ms 348 KB Output is correct
47 Correct 91 ms 348 KB Output is correct
48 Correct 7 ms 604 KB Output is correct
49 Correct 6 ms 348 KB Output is correct
50 Correct 401 ms 11856 KB Output is correct
51 Correct 66 ms 848 KB Output is correct
52 Correct 65 ms 596 KB Output is correct
53 Correct 738 ms 7600 KB Output is correct
54 Correct 443 ms 12524 KB Output is correct
55 Correct 407 ms 11864 KB Output is correct
56 Correct 420 ms 12548 KB Output is correct
57 Correct 449 ms 12832 KB Output is correct
58 Correct 423 ms 12804 KB Output is correct