제출 #1161301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1161301		aha_niet	Bank (IZhO14_bank)	C++20	0 / 100	1098 ms	328 KiB

bank

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sz size
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fre(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define ss second
#define f first
#define ii pair<ll,ll>
#define pii pair<int,int>
const int N=3e6+7;
const ll inf=2e12+7;
const ll mod=1e9+7;
ll ans,f[N],un;
int n,q,a,m,b;
int main()
{
    ios
    cin>>n>>m;
    vector<int> v(n),mn(m);
    for(int i=0;i<n;++i)
    {
        cin>>v[i];
    }
    for(int i=0;i<m;++i)
    {
        cin>>mn[i];
    }
    sort(all(mn));
    sort(rall(v));
    do 
    {
        int in=0,ok=-1;
        vector<bool> check(m,false);
        for(int i=0;i<n;++i)
        {
            ll x=v[i];
            //cout<<x<<" ";
            for(int j=0;j<m;++j)
            {
                if(check[j])continue;
                if(x==mn[j])
                {
                    ok=1;
                    check[j]=true;
                    x=0;
                    break;
                }
                if(x>mn[j])
                {
                    check[j]=true;
                    x-=mn[j];
                }
                else continue;
            }
            if(x!=0)
            {
                ok-1;
                break;
            }
        }
        if(ok==1)
        {
            cout<<"YES";
            return 0;
        }
    } 
    while(next_permutation(all(mn)));
    cout<<"NO";
}

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