제출 #855036

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
855036		hungt58	은행 (IZhO14_bank)	C++14	71 / 100	34 ms	456 KiB

bank

#include <bits/stdc++.h>
using namespace std;

#define ff first
#define ss second
#define ll int
#define TIME  (1.0 * clock() / CLOCKS_PER_SEC)

 ll n,m,a[21],b[21],res,kt[10010],w=0;
 void dao(ll i)
 {
     for (ll j=1;j<=n;j++)
        if (a[j]>=b[i])
      {
         a[j]-=b[i];
         if (a[j]==0) res--;
         w++;
         if (w==10000000) {cout<<"NO";exit(0);}
         if (m-i>=res)
         {
          if (i==m)
          {if (res==0){cout<<"YES";exit(0);}}
          else dao(i+1);
         }
         if (a[j]==0) res++;
        a[j]+=b[i];
     }
 }
int main()
{
 
    ios_base :: sync_with_stdio(0);
    cin.tie(0),cout.tie(0);
    cin>>n>>m;


    for (ll i=1;i<=n;i++)
    cin>>a[i],kt[a[i]]++;
    for (ll i=1;i<=m;i++)
    {
    cin>>b[i];
    if (kt[b[i]]>0) kt[b[i]]--,i--,m--;
    }
    vector<ll> c;
    for (ll i=1;i<=n;i++)
    {
    if (kt[a[i]]>0) c.push_back(a[i]);
    kt[a[i]]--;
    }
    n=0;
    for (ll j:c)
    a[++n]=j;

    n++;
    a[n]=100010;
    res=n-1;
    dao(1);
    cout<<"NO";






}

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