Submission #1107260

#	Time	Username	Problem	Language	Result	Execution time	Memory
1107260		vjudge1	Bank (IZhO14_bank)	C++14	71 / 100	1095 ms	244584 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nn "\n";
#define pb push_back
#define all(v) (v).begin() , (v).end()
const int N = 2e5+ 4;
int n , T , q , m ;
signed main(){
    ios_base::sync_with_stdio(0) , cin.tie(0);
    cin>> n >> m ;
    int a[n+1] , b[m] , ok =0 ;
    for(int i= 1 ; i <= n ;i++)cin>> a[i];
    for(int i =0 ; i < m; i++)cin>> b[i];
    vector<vector<int>>mp[20000];
        for(int j =  0 ; j < (1 << m )- 1; j++){
            int x =0 ;
            vector<int>v;
            for(int u =0 ; u < m ; u++){
                if((j >> u )&1){
                    x+=b[u];
                    v.pb(b[u]);
                }
            }
            mp[x].pb(v);
        }
    queue<pair<int , unordered_map<int, int >>>q;
    unordered_map<int ,int >h;
    for(int i =0  ; i < m ; i++){
        h[b[i]]++;
    }
    q.push({1 , h });
    while(q.size()){
        pair<int , unordered_map<int , int >> p= q.front();
        q.pop();
        int v = p.first ;
        unordered_map<int ,int >us = p.second;
        for(auto it:mp[a[v]]){
                int ko =0 ;
            for(auto at:it){
                if(us[at])ko++;
                us[at]--;
            }
            if(ko== it.size()){
                if(v == n ){
                    cout << "YES";
                    return 0 ;
                }
                q.push({v + 1 ,us});
            }
            for(auto at:it){
                    us[at]++;
                }
        }
    }
    cout << "NO";

}

Compilation message (stderr)

bank.cpp: In function 'int main()':
bank.cpp:44:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |             if(ko== it.size()){
      |                ~~^~~~~~~~~~~~
bank.cpp:12:25: warning: unused variable 'ok' [-Wunused-variable]
   12 |     int a[n+1] , b[m] , ok =0 ;
      |                         ^~

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