oj.uz

Submission #972814

# Submission time Handle Problem Language Result Execution time Memory
972814 2024-05-01T08:18:42 Z saidpon Bank (IZhO14_bank) C++14
100 / 100
 846 ms 11092 KB 
#include <bits/stdc++.h>
#define ordered_set tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nemeshay ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define allr(pon) pon.rbegin(), pon.rend()
#include <ext/pb_ds/assoc_container.hpp>
#define all(pon) pon.begin(), pon.end()
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair <int, int>
#define nosolve puts("-1")
#define YES puts("YES")
#define pb push_back
#define pf push_front
#define int long long
#define OK puts("OK")
#define NO puts("NO")
#define sigma signed
#define sc second
#define fr first
using namespace __gnu_pbds;
using namespace std;
const int N = 1048576, INF = 2e9 + 7;
int a[N], b[N], dp[N];
vector <int> pon[30];
sigma main(){
    nemeshay
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < m; i++) cin >> b[i];
    for (int l = 0; l < (1 << m); l++){
        int sum = 0;
        for (int j = 0; j < m; j++){
            if (l & (1 << j)) sum += b[j];
        }
        for (int i = 0; i < n; i++) if (sum == a[i]) pon[i].pb(l);
    }
    for (int i = 1; i < N; i++) dp[i] = -1;
    for (int i = 0; i < n; i++){
        for (int l = (1 << m) - 1; l >= 0; l--){
            if (dp[l] != -1){
                for (auto j: pon[i]){
                    if (!(l & j)){
                        dp[l | j] = dp[l] + 1;
                    }
                    if (dp[l | j] == n){
                        YES;
                        return 0;
                    }
                }
            }
        }
    }
    NO;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 2 ms 10900 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 5 ms 10840 KB Output is correct
5 Correct 74 ms 10692 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 72 ms 10836 KB Output is correct
9 Correct 73 ms 10692 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 10840 KB Output is correct
2 Correct 6 ms 10844 KB Output is correct
3 Correct 3 ms 10844 KB Output is correct
4 Correct 2 ms 10844 KB Output is correct
5 Correct 2 ms 10700 KB Output is correct
6 Correct 2 ms 10856 KB Output is correct
7 Correct 2 ms 10840 KB Output is correct
8 Correct 2 ms 10840 KB Output is correct
9 Correct 2 ms 10844 KB Output is correct
10 Correct 2 ms 10844 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10844 KB Output is correct
2 Correct 2 ms 10900 KB Output is correct
3 Correct 2 ms 10840 KB Output is correct
4 Correct 5 ms 10840 KB Output is correct
5 Correct 74 ms 10692 KB Output is correct
6 Correct 2 ms 10844 KB Output is correct
7 Correct 2 ms 10844 KB Output is correct
8 Correct 72 ms 10836 KB Output is correct
9 Correct 73 ms 10692 KB Output is correct
10 Correct 7 ms 10840 KB Output is correct
11 Correct 6 ms 10844 KB Output is correct
12 Correct 3 ms 10844 KB Output is correct
13 Correct 2 ms 10844 KB Output is correct
14 Correct 2 ms 10700 KB Output is correct
15 Correct 2 ms 10856 KB Output is correct
16 Correct 2 ms 10840 KB Output is correct
17 Correct 2 ms 10840 KB Output is correct
18 Correct 2 ms 10844 KB Output is correct
19 Correct 2 ms 10844 KB Output is correct
20 Correct 3 ms 10844 KB Output is correct
21 Correct 3 ms 10844 KB Output is correct
22 Correct 3 ms 10844 KB Output is correct
23 Correct 3 ms 10844 KB Output is correct
24 Correct 3 ms 10844 KB Output is correct
25 Correct 3 ms 10844 KB Output is correct
26 Correct 3 ms 10708 KB Output is correct
27 Correct 3 ms 10844 KB Output is correct
28 Correct 4 ms 10712 KB Output is correct
29 Correct 3 ms 10844 KB Output is correct
30 Correct 4 ms 10840 KB Output is correct
31 Correct 74 ms 10832 KB Output is correct
32 Correct 116 ms 11088 KB Output is correct
33 Correct 83 ms 10836 KB Output is correct
34 Correct 87 ms 10684 KB Output is correct
35 Correct 84 ms 10832 KB Output is correct
36 Correct 109 ms 10688 KB Output is correct
37 Correct 74 ms 10832 KB Output is correct
38 Correct 77 ms 10832 KB Output is correct
39 Correct 93 ms 10688 KB Output is correct
40 Correct 84 ms 10832 KB Output is correct
41 Correct 97 ms 10832 KB Output is correct
42 Correct 113 ms 10748 KB Output is correct
43 Correct 86 ms 10832 KB Output is correct
44 Correct 95 ms 10700 KB Output is correct
45 Correct 76 ms 10712 KB Output is correct
46 Correct 81 ms 10696 KB Output is correct
47 Correct 100 ms 10692 KB Output is correct
48 Correct 73 ms 10720 KB Output is correct
49 Correct 77 ms 10704 KB Output is correct
50 Correct 416 ms 10832 KB Output is correct
51 Correct 648 ms 11016 KB Output is correct
52 Correct 403 ms 10832 KB Output is correct
53 Correct 846 ms 11092 KB Output is correct
54 Correct 501 ms 10896 KB Output is correct
55 Correct 417 ms 10700 KB Output is correct
56 Correct 655 ms 10720 KB Output is correct
57 Correct 776 ms 10896 KB Output is correct
58 Correct 656 ms 10836 KB Output is correct