oj.uz

Submission #961133

# Submission time Handle Problem Language Result Execution time Memory
961133 2024-04-11T14:20:32 Z Kavelmydex Bank (IZhO14_bank) C++17
100 / 100
 95 ms 8652 KB 
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define endl "\n"
#define sp ' '
#define pb push_back
#define f first
#define s second
#define sz size()
#define all(x) (x).begin(),(x).end()
 
const int N = 20, OO = 2e9, mod = 1e9+7, mx = 1e3+1;
const int dx[]{0,1}, dy[]{1,0};
void tr(int a, int b){cout << a << sp << b << endl;}
void cmx(int &a, int b){a = max(a,b);}
void cmn(int &a, int b){a = min(a,b);}

int dp[1<<N], a[N], b[N];
int sum[1<<N];

int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0); 
    // freopen("talent.in", "r", stdin);
    // freopen("talent.out", "w", stdout);
    int n,m; cin >> n >> m;
    For(i,n) cin >> a[i];
    For(i,m) cin >> b[i];
    memset(dp,-1,sizeof(dp));
    dp[0] = 0;
    for(int msk=1; msk < 1<<m; ++msk){
        For(i,m) if((1<<i)&msk){
            int other = msk-(1<<i);
            if(dp[other]==-1) continue;

            if(sum[other]+b[i] == a[dp[other]]){
                dp[msk] = dp[other]+1;
            }else if(sum[other]+b[i] < a[dp[other]]){
                dp[msk] = dp[other];
                sum[msk] = sum[other]+b[i];
            }
        }
        if(dp[msk]==n){
            cout << "YES" << endl;
            return 0;
        }
    }
    cout << "NO" << endl;
    return 0;
}
/*
Just some notices : 
I believe you can do it !
You've done things that were harder ... 
Stay calm and focused  =)
*/

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6236 KB Output is correct
2 Correct 2 ms 6236 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 1 ms 6236 KB Output is correct
5 Correct 68 ms 8460 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6416 KB Output is correct
9 Correct 71 ms 8636 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6492 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 2 ms 6352 KB Output is correct
5 Correct 3 ms 6232 KB Output is correct
6 Correct 3 ms 6236 KB Output is correct
7 Correct 3 ms 6356 KB Output is correct
8 Correct 2 ms 6236 KB Output is correct
9 Correct 3 ms 6232 KB Output is correct
10 Correct 2 ms 6236 KB Output is correct
11 Correct 3 ms 6492 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6236 KB Output is correct
2 Correct 2 ms 6236 KB Output is correct
3 Correct 2 ms 6236 KB Output is correct
4 Correct 1 ms 6236 KB Output is correct
5 Correct 68 ms 8460 KB Output is correct
6 Correct 2 ms 6236 KB Output is correct
7 Correct 2 ms 6236 KB Output is correct
8 Correct 2 ms 6416 KB Output is correct
9 Correct 71 ms 8636 KB Output is correct
10 Correct 2 ms 6236 KB Output is correct
11 Correct 2 ms 6236 KB Output is correct
12 Correct 1 ms 6356 KB Output is correct
13 Correct 2 ms 6236 KB Output is correct
14 Correct 2 ms 6232 KB Output is correct
15 Correct 2 ms 6232 KB Output is correct
16 Correct 2 ms 6236 KB Output is correct
17 Correct 2 ms 6236 KB Output is correct
18 Correct 1 ms 6236 KB Output is correct
19 Correct 2 ms 6236 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 3 ms 6492 KB Output is correct
22 Correct 2 ms 6236 KB Output is correct
23 Correct 2 ms 6352 KB Output is correct
24 Correct 3 ms 6232 KB Output is correct
25 Correct 3 ms 6236 KB Output is correct
26 Correct 3 ms 6356 KB Output is correct
27 Correct 2 ms 6236 KB Output is correct
28 Correct 3 ms 6232 KB Output is correct
29 Correct 2 ms 6236 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 89 ms 8640 KB Output is correct
32 Correct 83 ms 8536 KB Output is correct
33 Correct 71 ms 8644 KB Output is correct
34 Correct 69 ms 8572 KB Output is correct
35 Correct 67 ms 8540 KB Output is correct
36 Correct 68 ms 8484 KB Output is correct
37 Correct 67 ms 8536 KB Output is correct
38 Correct 69 ms 8216 KB Output is correct
39 Correct 2 ms 6352 KB Output is correct
40 Correct 69 ms 8484 KB Output is correct
41 Correct 69 ms 8280 KB Output is correct
42 Correct 95 ms 8644 KB Output is correct
43 Correct 70 ms 8540 KB Output is correct
44 Correct 71 ms 8468 KB Output is correct
45 Correct 2 ms 6236 KB Output is correct
46 Correct 86 ms 8636 KB Output is correct
47 Correct 68 ms 8496 KB Output is correct
48 Correct 2 ms 6488 KB Output is correct
49 Correct 69 ms 8504 KB Output is correct
50 Correct 74 ms 8636 KB Output is correct
51 Correct 78 ms 8536 KB Output is correct
52 Correct 70 ms 8652 KB Output is correct
53 Correct 84 ms 8636 KB Output is correct
54 Correct 81 ms 8640 KB Output is correct
55 Correct 72 ms 8528 KB Output is correct
56 Correct 77 ms 7988 KB Output is correct
57 Correct 70 ms 8536 KB Output is correct
58 Correct 72 ms 8540 KB Output is correct