제출 #636024

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
636024		a_aguilo	은행 (IZhO14_bank)	C++17	0 / 100	1093 ms	12628 KiB

bank

#include<bits/stdc++.h>

using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;

vvi dp;
vvi possibilities;

//dp[i][j] = es posible satisfacer a los clientes i con j monedas



int main(){
    int n, m;
    cin >> n >> m;
    int people[n];
    int coins[m];
    map<int, vi> coins_to_persons;
    map<int, vi> persons_to_combs;
    for (int i = 0; i < n; ++i) {
        cin >> people[i];
        if(coins_to_persons.find(people[i]) == coins_to_persons.end()) coins_to_persons[people[i]] = {i};
        else coins_to_persons[people[i]].push_back(i);
    }
    //cout << " <" << endl;
    for(int i = 0; i < m; ++i){
        cin >> coins[i];
        //cout << i << " " << coins[i] << endl;
    }
    //cout << " << " << endl;
    dp = vvi(n+1, vi(1<<m, 0));
    //cout << " a " << endl;
    for(int i = 0; i < (1 << m); ++i){
        //cout << "aa" << endl;
        //cout << i << endl;
        int ans = 0;
        for(int j = 0; j < m; ++j){
            if(i&(1 << j)) ans+= coins[j];
        }
        //cout << ans << endl;
        for(int pers: coins_to_persons[ans]){
            if(persons_to_combs.find(pers) == persons_to_combs.end()) persons_to_combs[pers] = {i};
            else persons_to_combs[pers].push_back(i);
            //cout << ans <<" " <<i << " " << pers << endl;
        }
    }
    for(int i = 0; i < (1 << m); ++i) dp[0][i] = 1;
    bool ans = false;
    //cout << "a" << endl;
    for(int who = 0; who < n; ++who){
        for(int mask = 0; mask < (1 << m); ++mask){
            for(int comb : persons_to_combs[who]){
                if(mask & comb == comb) dp[who+1][mask] = max(dp[who+1][mask], dp[who][mask^comb]);
            }
            //cout << who << " " << mask << " " << dp[who+1][mask] << endl;
            if(who == n-1 and dp[who+1][mask]) ans = true;
        }

    }
    if(ans) cout << "YES" << endl;
    else cout << "NO" << endl;
    return 0;
}

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

bank.cpp: In function 'int main()':
bank.cpp:54:32: warning: self-comparison always evaluates to true [-Wtautological-compare]
   54 |                 if(mask & comb == comb) dp[who+1][mask] = max(dp[who+1][mask], dp[who][mask^comb]);
      |                           ~~~~ ^~ ~~~~
bank.cpp:54:32: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   54 |                 if(mask & comb == comb) dp[who+1][mask] = max(dp[who+1][mask], dp[who][mask^comb]);
      |                           ~~~~~^~~~~~~

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