oj.uz

Submission #850253

# Submission time Handle Problem Language Result Execution time Memory
850253 2023-09-16T08:18:34 Z PhamGiaKhanh Bank (IZhO14_bank) C++14
100 / 100
 96 ms 9660 KB 
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define setpre(n) setprecision(n) << fixed
typedef long long ll;
const int INF = 1e9;
const int maxN = 20;
const int maxM = 1e2 + 7;
const int MOD = 1e9 + 7;
using namespace std;
int a[maxN], b[maxN];
bool money[1 << maxN];
pair<int, int> dp[1 << maxN];
main()
{
    //freopen(".INP","r",stdin);
    //freopen(".OUT","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    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];
    }
    dp[0] = mp(0, 0);
    money[0] = 1;
    for(int i = 0; i < (1 << m); i++){
        for(int j = 0; j < m; j++){
            if(i & (1 << j)){
                if(!money[i ^ (1 << j)]) continue;
                pair<int, int> cur = dp[i ^ (1 << j)];
                if(cur.fi < n && cur.se + b[j] < a[cur.fi]){
                    cur.se += b[j];
                    dp[i] = cur;
                    money[i] = 1;
                }
                else if(cur.fi < n && cur.se + b[j] == a[cur.fi]){
                    cur.fi++;
                    cur.se = 0;
                    dp[i] = cur;
                    money[i] = 1;
                }
            }
        }
        if(money[i] && dp[i].fi >= n){
            cout << "YES" << '\n';
            return 0;
        }
    }
    cout << "NO" << '\n';
    return 0;
}

Compilation message

bank.cpp:16:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   16 | main()
      | ^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 74 ms 4552 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 73 ms 9552 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 74 ms 4552 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 73 ms 9552 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 2 ms 2396 KB Output is correct
21 Correct 2 ms 2392 KB Output is correct
22 Correct 2 ms 2392 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 2 ms 2392 KB Output is correct
25 Correct 2 ms 2392 KB Output is correct
26 Correct 2 ms 2392 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2392 KB Output is correct
29 Correct 2 ms 2592 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 86 ms 9552 KB Output is correct
32 Correct 83 ms 9552 KB Output is correct
33 Correct 75 ms 9552 KB Output is correct
34 Correct 71 ms 9176 KB Output is correct
35 Correct 71 ms 9160 KB Output is correct
36 Correct 71 ms 8720 KB Output is correct
37 Correct 71 ms 8876 KB Output is correct
38 Correct 71 ms 4552 KB Output is correct
39 Correct 1 ms 2392 KB Output is correct
40 Correct 73 ms 8712 KB Output is correct
41 Correct 71 ms 8528 KB Output is correct
42 Correct 96 ms 9552 KB Output is correct
43 Correct 73 ms 9296 KB Output is correct
44 Correct 71 ms 6480 KB Output is correct
45 Correct 2 ms 2392 KB Output is correct
46 Correct 84 ms 9556 KB Output is correct
47 Correct 73 ms 8688 KB Output is correct
48 Correct 1 ms 2392 KB Output is correct
49 Correct 71 ms 8700 KB Output is correct
50 Correct 76 ms 9560 KB Output is correct
51 Correct 71 ms 8796 KB Output is correct
52 Correct 71 ms 9476 KB Output is correct
53 Correct 85 ms 9552 KB Output is correct
54 Correct 81 ms 9552 KB Output is correct
55 Correct 76 ms 9552 KB Output is correct
56 Correct 77 ms 9552 KB Output is correct
57 Correct 78 ms 9660 KB Output is correct
58 Correct 77 ms 9624 KB Output is correct