oj.uz

Submission #575844

# Submission time Handle Problem Language Result Execution time Memory
575844 2022-06-11T11:12:57 Z LunaMeme Bank (IZhO14_bank) C++14
100 / 100
 109 ms 8504 KB 
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
typedef vector<pair<int, int>> vii;
typedef vector<int> vi;
typedef long long ll;
#define PB push_back
#define MP make_pair
#define FOR(i, x, y) for (int i = x; i < y ; i ++)
const int MAXN = 21;
ii dp[1 << MAXN]; // num of covered & left over
int main(){
    int n, m;
    cin >> n >> m;
    vi a(n), b(m);
    FOR(i, 0, n){
        cin >> a[i];
    }
    FOR(i, 0, m){
        cin >> b[i];
    }
    sort(a.rbegin(), a.rend());
    dp[0] = MP(0, 0);
    FOR(s, 1, 1 << m){
        dp[s] = MP(0, 0);
        FOR(i, 0, m){
            if ((s & (1 << i))== 0){
                continue;
            }
            int prev = s- (1 << i);
            int indx = dp[prev].first;
            int left = dp[prev].second;
            if (left + b[i] == a[indx]){
                left = 0;
                indx ++;
            }
            else if (b[i] == a[indx]){
                indx ++;
            }
            else{
                left += b[i];
            }
            dp[s] = max(dp[s], MP(indx, left));

        }
        if (dp[s].first == n){
            cout << "YES\n";
            return 0;
        }
        //cout << s << " : " << dp[s].first << ' ' << dp[s].second << '\n';
    }
    cout << "NO\n";

}

Subtask #1
19.0 / 19.0

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

Subtask #2
25.0 / 25.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 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 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 304 KB Output is correct
10 Correct 1 ms 304 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 440 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 75 ms 8468 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 75 ms 8424 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 312 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 304 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 440 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 90 ms 8408 KB Output is correct
32 Correct 93 ms 8384 KB Output is correct
33 Correct 109 ms 8476 KB Output is correct
34 Correct 87 ms 8504 KB Output is correct
35 Correct 87 ms 8496 KB Output is correct
36 Correct 93 ms 8504 KB Output is correct
37 Correct 81 ms 8384 KB Output is correct
38 Correct 82 ms 8436 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 87 ms 8492 KB Output is correct
41 Correct 80 ms 8388 KB Output is correct
42 Correct 100 ms 8444 KB Output is correct
43 Correct 95 ms 8440 KB Output is correct
44 Correct 82 ms 8420 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 100 ms 8428 KB Output is correct
47 Correct 79 ms 8412 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 73 ms 8388 KB Output is correct
50 Correct 81 ms 8492 KB Output is correct
51 Correct 82 ms 8504 KB Output is correct
52 Correct 94 ms 8460 KB Output is correct
53 Correct 96 ms 8396 KB Output is correct
54 Correct 81 ms 8496 KB Output is correct
55 Correct 81 ms 8484 KB Output is correct
56 Correct 80 ms 8428 KB Output is correct
57 Correct 84 ms 8460 KB Output is correct
58 Correct 81 ms 8400 KB Output is correct