Submission #885211

# Submission time Handle Problem Language Result Execution time Memory
885211 2023-12-09T09:08:35 Z parlimoos Bank (IZhO14_bank) C++14
100 / 100
82 ms 8792 KB
//Be Name KHODA
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
#define pb push_back
#define pp pop_back
#define cl clear
#define bg begin
#define lb lower_bound
#define ub upper_bound
#define arr(x) array<int , x>
#define endl '\n'

int n , m;
vector<int> a , b;
int dp[(1 << 20)][2];

void f(){
    dp[0][0] = 0 , dp[0][1] = 0;
    for(int msk = 0 ; msk < (1 << m) ; msk++){
        for(int j = 0 ; j < m ; j++){
            if((msk >> j) & 1){
                int lst = dp[msk ^ (1 << j)][0];
                int d = dp[msk ^ (1 << j)][1] + b[j];
                if(d < a[lst]){
                    dp[msk][0] = lst;
                    dp[msk][1] = d;
                }else if(d == a[lst]){
                    dp[msk][0] = lst + 1;
                    dp[msk][1] = 0;
                }
            }
        }
        if(dp[msk][0] == n){
            cout << "YES";
            exit(0);
        }
    }
    cout << "NO";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    for(int i = 0 ; i < n ; i++){
        int d;
        cin >> d;
        a.pb(d);
    }
    for(int i = 0 ; i < m ; i++){
        int d;
        cin >> d;
        b.pb(d);
    }
    for(int msk = 0 ; msk < (1 << m) ; msk++){
        dp[msk][0] = -1;
        dp[msk][1] = 0;
    }
    f();
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 67 ms 8540 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 66 ms 8540 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 352 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 2652 KB Output is correct
5 Correct 67 ms 8540 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 8540 KB Output is correct
9 Correct 66 ms 8540 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 352 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 75 ms 8540 KB Output is correct
32 Correct 77 ms 8636 KB Output is correct
33 Correct 72 ms 8536 KB Output is correct
34 Correct 68 ms 8540 KB Output is correct
35 Correct 72 ms 8536 KB Output is correct
36 Correct 74 ms 8784 KB Output is correct
37 Correct 72 ms 8640 KB Output is correct
38 Correct 72 ms 8540 KB Output is correct
39 Correct 2 ms 8540 KB Output is correct
40 Correct 68 ms 8640 KB Output is correct
41 Correct 70 ms 8540 KB Output is correct
42 Correct 82 ms 8540 KB Output is correct
43 Correct 69 ms 8540 KB Output is correct
44 Correct 69 ms 8636 KB Output is correct
45 Correct 2 ms 8540 KB Output is correct
46 Correct 73 ms 8540 KB Output is correct
47 Correct 69 ms 8540 KB Output is correct
48 Correct 2 ms 8540 KB Output is correct
49 Correct 68 ms 8620 KB Output is correct
50 Correct 74 ms 8652 KB Output is correct
51 Correct 69 ms 8540 KB Output is correct
52 Correct 67 ms 8540 KB Output is correct
53 Correct 78 ms 8536 KB Output is correct
54 Correct 75 ms 8636 KB Output is correct
55 Correct 73 ms 8636 KB Output is correct
56 Correct 73 ms 8540 KB Output is correct
57 Correct 70 ms 8792 KB Output is correct
58 Correct 70 ms 8540 KB Output is correct