제출 #1284307

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1284307		dobri_oke	은행 (IZhO14_bank)	C++20	44 / 100	1085 ms	1536 KiB

bank

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define int long long

const int N = 5e5+100;

void solve(){
    int n, m;
    cin >> n >> m;
    int a[n+1], b[m+1], c[m+1];
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=m;i++){ 
        cin >> b[i];
        c[i]=i;   
    }
    if(n==1){
        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+1];
            }
            if(sum==a[1]){
                cout << "YES\n";
                return;
            }
        }
        cout << "NO";
        return;
    }
    do{
        int sum=0, j=1;
        for(int i=1;i<=m;i++){
            sum+=b[c[i]];
            if(sum==a[j]){
                sum=0;
                j++;
            }
            if(j==n+1){
                cout << "YES\n";
                return;
            }
        }
    }while(next_permutation(c+1, c+m+1));
    cout << "NO\n";
}
/*dp[i+w[k]-1][j+h[k]-1]
21 11
5
5 3
6 7
3 2
5 6
21 11
*/

signed main(){   
    ios_base::sync_with_stdio(0);   cin.tie(0);
    //freopen("promote.in","r",stdin);
    //freopen("promote.out","w",stdout);
    int tt=1;
   // cin >> tt;
    while(tt--){
        solve();
    }
}

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