Submission #1089452

#	Time	Username	Problem	Language	Result	Execution time	Memory
1089452		vjudge1	Bank (IZhO14_bank)	C++17	0 / 100	1 ms	360 KiB

bank

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    
    vector<int> valores(m);
    vector<int> notas(m);
    
    for (int i = 0; i < m; i++) {
        cin >> valores[i];
    }
    
    for (int i = 0; i < m; i++) {
        cin >> notas[i];
    }

    vector<int> residual(1 << m, -1);
    vector<int> cobertos(1 << m, -1);
    
    residual[0] = 0;
    cobertos[0] = 0;
    
    int possivel = 0;
    
    for (int s = 0; s < (1 << m); s++) {
        for (int p = 0; p < m; p++) {
            if ((s & (1 << p)) == 0) continue;
            
            int ant = s & ~(1 << p);
            
            if (cobertos[ant] == -1) continue;
            
            int novo = residual[ant] + notas[p];
            
            if (cobertos[ant] < n) {
                int alvo = valores[cobertos[ant]];
                if (novo < alvo) {
                    cobertos[s] = cobertos[ant];
                    residual[s] = novo;
                } else if (novo == alvo) {
                    cobertos[s] = cobertos[ant] + 1;
                    residual[s] = 0;
                }
            }
        }

        if (cobertos[s] == n) {
            possivel = 1;
        }
    }
    
    if (possivel == 1) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
    
    return 0;
}

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