제출 #922886

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
922886		Nurislam	은행 (IZhO14_bank)	C++14	100 / 100	297 ms	12484 KiB

bank

#include <bits/stdc++.h>
#include <iostream>
//~ #include <ext/pb_ds/assoc_container.hpp> 
//~ #include <ext/pb_ds/tree_policy.hpp> 
 
 
using namespace std;
//~ using namespace __gnu_pbds; 
  
 
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
//~ #define double long double 
//~ #define order_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
 
///*                                                    __                    __                        __                    */
///*        ======     _      /| /|  __   _            /   |  |   /|  |   @  |    |  |  | /   /| |\  | /   |  |  @ | /        */
///* \-       ||  |_| |_     / |/ | |  | |_  |-        |   |--|  /-|  |   |  \ \  |==|  |-   /=| | \ | |   |--|  | |-         */
///*          ||  | | |_    /     | |__|  _| |_        \__ |  | /  |  |__ |  __|  |  |  | \ /  | |  \| \__ |  |  | | \        */
///* 
 
typedef vector<int> vi;
typedef vector<double> vd;
//~ typedef pair<int,int> pii;
//~ typedef vector<pii> vii;
//~ typedef vector<vi> vv;
const int N = 2e5+2, inf = 1e8, mod = 1e9+7;

bitset<1 << 20> dp[2];
vector<int> msks[1001];
void solve() {
    cin.tie(0) -> sync_with_stdio(0);
    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    for (int& i : a) cin >> i;
    for (int& i : b) cin >> i; 
    for (int i = 0; i < (1 << m); i++) {
        int sum = 0;
        for (int j = 0; j < m; j++) {
            if (i >> j & 1) sum += b[j];
        }
        if (sum <= 1000) msks[sum].pb(i);
    }  
    for (int i : msks[a[0]]) {
        dp[0][i] = true;
    }
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < (1 << m); j++) {
            if (!dp[0][j]) continue;
            for (int k : msks[a[i]]) {
                if (!(j & k)) dp[1][j | k] = 1;
            }
        }     
        dp[0].reset();
        swap(dp[0], dp[1]);
    } 
    for (int i = 0; i < (1 << m); i++) {
        if (dp[0][i]) {
            cout << "YES" << '\n';
            return;
        }
    }
    cout << "NO" << '\n';
}

main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
	int test = 1;
	//~ cin >> test;
	while(test--){
		solve();
	}
}
 
 
 
 
 
 
 
 
 
 

컴파일 시 표준 에러 (stderr) 메시지

bank.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main(){
      | ^~~~

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