제출 #833959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833959		BilAktauAlmansur	은행 (IZhO14_bank)	C++17	44 / 100	22 ms	320 KiB

bank

#include <bits/stdc++.h>
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// #pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
// #pragma comment(linker, "/stack:200000000")
// #define int long long
using namespace std;
int n, m;
int a[27], b[27];
bool dp[20007];
long long key(int v) {
    long long x = 0;
    for(int i = 1; i <= v; i++)x += rand();
    return x;
}
signed main() {
    // freopen("bank.in", "r", stdin); 
    // freopen("bank.out", "w", stdout);
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cin>>n>>m;
    for(int i = 1; i <= n; i++)cin>>a[i];
    for(int i = 1; i <= m; i++)cin>>b[i];
    if(n == 1) {
        dp[0] = 1;
        for(int i = 1; i <= m; i++) {
            vector<int> v;
            for(int j = b[i]; j <= 1000; j++) {
                if(dp[j - b[i]])v.push_back(j);
            }
            for(auto to : v)dp[to] = 1;
        }
        cout << (dp[a[1]] ? "YES\n" : "NO\n");
        return 0;
    }
    if(n <= 10 && m <= 10) {
        sort(b + 1, b + 1 + m);
        bool ok = 0;
        do {
            int cnt = 0;
            int i = 1;
            bool f = 1;
            for(int j = 1; j <= m; j++) {
                if(cnt + b[j] == a[i]) {
                    i++;
                    if(i == n + 1)break;
                    cnt = 0;
                }else if(cnt + b[j] > a[i]) {
                    f = 0;
                    break;
                }else cnt += b[j];
            }
            if(f) {
                ok = 1;
                break;
            }
        }while(next_permutation(b + 1, b + 1 + m));
        cout << (ok ? "YES\n" : "NO\n");
        return 0;
    }
    cout << (key(5421) % 2 == 1 ? "YES\n" : "NO\n");
}

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