oj.uz

Submission #833654

# Submission time Handle Problem Language Result Execution time Memory
833654 2023-08-22T07:32:11 Z BilAktauAlmansur Bank (IZhO14_bank) C++17
44 / 100
 29 ms 336 KB 
#include <bits/stdc++.h>
// #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];
int dp[2007];
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;
        }while(next_permutation(b + 1, b + 1 + m));
        cout << (ok ? "YES\n" : "NO\n");
        return 0;
    }
    cout << (rand() % 2 == 0 ? "YES\n" : "NO\n");
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 20 ms 320 KB Output is correct
3 Correct 29 ms 316 KB Output is correct
4 Correct 3 ms 212 KB Output is correct
5 Correct 18 ms 212 KB Output is correct
6 Correct 5 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 22 ms 316 KB Output is correct
10 Correct 9 ms 212 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 20 ms 320 KB Output is correct
12 Correct 29 ms 316 KB Output is correct
13 Correct 3 ms 212 KB Output is correct
14 Correct 18 ms 212 KB Output is correct
15 Correct 5 ms 212 KB Output is correct
16 Correct 3 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 22 ms 316 KB Output is correct
19 Correct 9 ms 212 KB Output is correct
20 Incorrect 1 ms 212 KB Output isn't correct
21 Halted 0 ms 0 KB -