제출 #947217

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
947217		steveonalex	은행 (IZhO14_bank)	C++11	100 / 100	155 ms	4704 KiB

bank

#include <bits/stdc++.h>


 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int dp[MASK(20)];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m; cin >> n >> m;
    vector<int> a(n), b(m);
    for(int i = 0; i<n; ++i) cin >> a[i];
    for(int j = 0; j<m; ++j) cin >> b[j];

    for(int i = 1; i<n; ++i) a[i] += a[i-1];

    bool ok = false;
    for(int mask = 1; mask < MASK(m); ++mask){
        int sum = 0;
        for(int i = 0;i < m; ++i) if (GETBIT(mask, i)) sum += b[i];

        int cur = 0;
        if (binary_search(ALL(a), sum)){
            int idx = lower_bound(ALL(a), sum) - a.begin();
            cur = MASK(idx);
        }
        for(int i = 0; i<m; ++i) if (GETBIT(mask, i))
            maximize(dp[mask], dp[mask - MASK(i)]);
        dp[mask] |= cur;
        if (dp[mask] == MASK(n) - 1) ok = true;
    }
    if (ok) cout << "YES\n";
    else cout << "NO\n";
 
    return 0;
}

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

bank.cpp: In function 'int main()':
bank.cpp:62:28: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   62 |     for(int mask = 1; mask < MASK(m); ++mask){
      |                            ^
bank.cpp:74:22: warning: comparison of integer expressions of different signedness: 'int' and 'long long unsigned int' [-Wsign-compare]
   74 |         if (dp[mask] == MASK(n) - 1) ok = true;
      |             ~~~~~~~~~^~~~~~~~~~~~~~

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