Submission #722304

# Submission time Handle Problem Language Result Execution time Memory
722304 2023-04-11T17:47:38 Z PagodePaiva Bank (IZhO14_bank) C++14
100 / 100
97 ms 8496 KB
		#include<bits/stdc++.h>
#define N 20
#define fr first
#define sc second

using namespace std;

int n, m;
int v[N], b[N];
pair <int, int> dp[(1 << N)];

bool comp(pair <int, int> a, pair <int, int> c){
    if(a.fr > c.fr) return true;
    if(a.fr < c.fr) return false;
    if(a.sc < c.sc) return true;
    return false;
}

int main(){
    cin >> m >> n;

    for(int i = 0;i < m;i++){
        cin >> b[i];
    }

    for(int i = 0;i < n;i++){
        cin >> v[i];
    }

    dp[0].fr = 0;
    dp[0].sc = 0;

    for(int mask = 1;mask < (1 << n);mask++){
        dp[mask].fr = dp[mask].sc = -1;

        for(int i = 0;i < n;i++){
            if((mask & (1 << i)) != 0){
                int s = mask^(1 << i);

                pair <int, int> aux;

                if(dp[s].sc + v[i] == b[dp[s].fr]){
                    aux.fr = dp[s].fr + 1;
                    aux.sc = 0;
                }

                else{
                    aux.fr = dp[s].fr;
                    aux.sc = dp[s].sc + v[i];
                }

                if(comp(aux, dp[mask])){
                    dp[mask] = aux;
                }
            }
        }

        // cout << mask << " " << dp[mask].fr << " " << dp[mask].sc << "\n";
    }

    cout << (dp[(1 << n)-1].fr == m ? "YES" : "NO") << "\n";

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 81 ms 8496 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 78 ms 8388 KB Output is correct
9 Correct 90 ms 8444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 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 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 312 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 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 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 81 ms 8496 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 78 ms 8388 KB Output is correct
9 Correct 90 ms 8444 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 436 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 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 1 ms 340 KB Output is correct
31 Correct 74 ms 8396 KB Output is correct
32 Correct 73 ms 8436 KB Output is correct
33 Correct 97 ms 8492 KB Output is correct
34 Correct 86 ms 8396 KB Output is correct
35 Correct 74 ms 8468 KB Output is correct
36 Correct 69 ms 8464 KB Output is correct
37 Correct 72 ms 8472 KB Output is correct
38 Correct 87 ms 8416 KB Output is correct
39 Correct 72 ms 8396 KB Output is correct
40 Correct 71 ms 8456 KB Output is correct
41 Correct 68 ms 8460 KB Output is correct
42 Correct 85 ms 8476 KB Output is correct
43 Correct 81 ms 8496 KB Output is correct
44 Correct 73 ms 8404 KB Output is correct
45 Correct 88 ms 8476 KB Output is correct
46 Correct 73 ms 8396 KB Output is correct
47 Correct 71 ms 8400 KB Output is correct
48 Correct 75 ms 8408 KB Output is correct
49 Correct 71 ms 8392 KB Output is correct
50 Correct 72 ms 8396 KB Output is correct
51 Correct 70 ms 8432 KB Output is correct
52 Correct 74 ms 8448 KB Output is correct
53 Correct 89 ms 8428 KB Output is correct
54 Correct 93 ms 8400 KB Output is correct
55 Correct 72 ms 8424 KB Output is correct
56 Correct 71 ms 8472 KB Output is correct
57 Correct 71 ms 8460 KB Output is correct
58 Correct 75 ms 8496 KB Output is correct