oj.uz

Submission #945339

# Submission time Handle Problem Language Result Execution time Memory
945339 2024-03-13T16:22:38 Z nguyennh Bank (IZhO14_bank) C++17
71 / 100
 1000 ms 13368 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);
      }
    }
    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;
      }
      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 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 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 7 ms 772 KB Output is correct
9 Correct 7 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 1 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 1 ms 348 KB Output is correct
9 Correct 0 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 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 1 ms 344 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 424 KB Output is correct

Subtask #4
0 / 29.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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 7 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 7 ms 772 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 0 ms 344 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 1 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 344 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 424 KB Output is correct
31 Correct 13 ms 464 KB Output is correct
32 Correct 78 ms 1108 KB Output is correct
33 Correct 53 ms 344 KB Output is correct
34 Correct 62 ms 348 KB Output is correct
35 Correct 70 ms 348 KB Output is correct
36 Correct 125 ms 436 KB Output is correct
37 Correct 13 ms 348 KB Output is correct
38 Correct 26 ms 344 KB Output is correct
39 Correct 173 ms 9812 KB Output is correct
40 Correct 62 ms 348 KB Output is correct
41 Correct 127 ms 344 KB Output is correct
42 Correct 37 ms 596 KB Output is correct
43 Correct 51 ms 348 KB Output is correct
44 Correct 95 ms 344 KB Output is correct
45 Correct 21 ms 456 KB Output is correct
46 Correct 39 ms 344 KB Output is correct
47 Correct 94 ms 436 KB Output is correct
48 Correct 8 ms 600 KB Output is correct
49 Correct 8 ms 348 KB Output is correct
50 Correct 830 ms 13368 KB Output is correct
51 Correct 65 ms 456 KB Output is correct
52 Correct 70 ms 460 KB Output is correct
53 Execution timed out 1075 ms 8336 KB Time limit exceeded
54 Halted 0 ms 0 KB -