oj.uz

답안 #945313

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
945313 2024-03-13T15:52:26 Z nguyennh 은행 (IZhO14_bank) C++14
71 / 100
 947 ms 262144 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[25] , b[25] , n , m;

namespace buffalo{
  bool can = false;
  
  void backtrack(int pos , int mask , bool check){
    if (!check) return;
    if (pos > n - 1){
      if (check) can = true;
      return;
    }
    for ( int sub_mask = 0 ; sub_mask < (1 << m) ; sub_mask++ ){
      int sum = 0;
      for ( int j = 0 ; j < m ; j++ ){
        if ((mask >> j & 1) || (sub_mask >> j & 1)) continue;
        sum += b[j];
      }
      if (sum == a[pos]){
        backtrack(pos + 1 , mask | ~sub_mask , true);
      }
      else backtrack(pos + 1 , sub_mask | mask , false);
    }
  }
  
  void solve(){
    backtrack(0 , 0 , 1);
    cout << (can ? "YES" : "NO");
  }
}

namespace sub_final{
  void solve(){
    vector<vector<int>> pre_mask(n + 5);
    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);
      }
    }
    vector<int> store;
    bool satis = true;
    for ( int i = 0 ; i < n ; i++ ){
      if (i == 0){
        for ( auto x : pre_mask[i] ) store.push_back(x);
        if (store.empty()){
          satis = false;
          break;
        }
        continue;
      }
      if (store.empty()){
        satis = false;
        break;
      }
      vector<int> cur;
      for ( int j = 0 ; j < store.size() ; j++ ){
        for ( auto mask : pre_mask[i] ){
          if (mask & store[j]) continue;
          else cur.push_back(store[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();
}

Compilation message

bank.cpp: In function 'void sub_final::solve()':
bank.cpp:65:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |       for ( int j = 0 ; j < store.size() ; j++ ){
      |                         ~~^~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 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 456 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 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 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

# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 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 344 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 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 456 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 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 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 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 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 344 KB Output is correct
31 Correct 14 ms 348 KB Output is correct
32 Correct 947 ms 4784 KB Output is correct
33 Correct 46 ms 344 KB Output is correct
34 Correct 71 ms 592 KB Output is correct
35 Correct 73 ms 440 KB Output is correct
36 Correct 131 ms 348 KB Output is correct
37 Correct 14 ms 348 KB Output is correct
38 Correct 27 ms 348 KB Output is correct
39 Runtime error 371 ms 262144 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -