Submission #344549

#	Time	Username	Problem	Language	Result	Execution time	Memory
344549		pragmatist	Bank (IZhO14_bank)	C++14	0 / 100	1 ms	512 KiB

bank

// turmak-_-
#include<bits/stdc++.h>

#pragma optimize ("g",on)
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")

#define all(v) v.begin(),v.end()
#define sz(a) a.size()
#define nl "\n"
#define IOI return 0;
#define pb push_back
#define ppb pop_back()
#define ll long long
#define ull unsigned long long
#define ld long double
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define X first
#define Y second


using namespace std;
const int N = (int)1e5 + 7 ;
const ll MOD = (ll)998244353;
const ll INF = (ll)1e18 + 7;
const int inf = (int)1e9 + 7;

pii dx[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int a[30],b[30];
bool was[30];
void solve() {
    int n,m;
    cin>>n>>m;
    for(int i=1; i<=n; ++i) {
        cin>>a[i];
    }
    for(int i=1; i<=m; ++i) {
        cin>>b[i];
    }
    for(int i=1; i<=n; ++i) {
        vector<bool> dp(1000);
        int s = a[i];
        dp[0]=1;
        for(int i=1; i<=m; ++i) {
            for(int w=s; w>=0; --w) {
                if(w-b[i]>=0 && dp[w-b[i]]==1 && !was[i]) {
                    dp[w]=1;
                    was[i]=1;
                }
            }
        }
        if(dp[s]==0) {
            cout<<"NO\n";
            return;
        }
    }
    cout<<"YES\n";
}
int main() {
    IOS
    //freopen("cinema.in", "r", stdin);
    //freopen("cinema.out", "w", stdout);
    int tt=1;
    //cin>>tt;
    while(tt--) {
        solve();
    }
    IOI
}

Compilation message (stderr)

bank.cpp:4: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
    4 | #pragma optimize ("g",on)
      |

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