Submission #961089

# Submission time Handle Problem Language Result Execution time Memory
961089 2024-04-11T13:41:10 Z Kavelmydex Bank (IZhO14_bank) C++17
100 / 100
623 ms 136124 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];
bitset <mx> bt[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];
    For(i,m){
        bt[1<<i][0] = 1;
        bt[1<<i] |= (bt[1<<i] << b[i]);
        if(bt[1<<i][a[0]]){
            dp[1<<i]++;
            bt[1<<i].reset();
            bt[1<<i][0] = 1;
        }   
    }
    for(int msk=3; msk < 1<<m; ++msk){
        if(__builtin_popcount(msk)==1) continue;
        For(i,m) if((1<<i)&msk){
            int other = msk - (1<<i);
            bitset<mx> cur = bt[other];
            cur |= (cur<<b[i]);
            if(dp[other] < n && cur[a[dp[other]]]){
                if(dp[msk] < dp[other]+1){
                    dp[msk] = dp[other]+1;
                    bt[msk].reset();
                    bt[msk][0] = 1;
                } 
            }else{
                if(dp[msk] < dp[other]){
                    dp[msk] = dp[other];
                    bt[msk] = cur;
                } else if(dp[msk]==dp[other]){
                    bt[msk] |= cur;
                }
            }   
        }
    }
    if(dp[(1<<m)-1] == n) cout << "YES";
    else cout << "NO";
    cout << endl;
    return 0;
}
/*
Just some notices : 
I believe you can do it !
You've done things that were harder ... 
Stay calm and focused  =)
*/
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 12 ms 6748 KB Output is correct
5 Correct 521 ms 132016 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 452 ms 135872 KB Output is correct
9 Correct 477 ms 131944 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 7 ms 4696 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 7 ms 4444 KB Output is correct
4 Correct 7 ms 4440 KB Output is correct
5 Correct 6 ms 4444 KB Output is correct
6 Correct 9 ms 4444 KB Output is correct
7 Correct 7 ms 4444 KB Output is correct
8 Correct 7 ms 4692 KB Output is correct
9 Correct 7 ms 4352 KB Output is correct
10 Correct 7 ms 4440 KB Output is correct
11 Correct 6 ms 4444 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 12 ms 6748 KB Output is correct
5 Correct 521 ms 132016 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 452 ms 135872 KB Output is correct
9 Correct 477 ms 131944 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 7 ms 4696 KB Output is correct
21 Correct 6 ms 4444 KB Output is correct
22 Correct 7 ms 4444 KB Output is correct
23 Correct 7 ms 4440 KB Output is correct
24 Correct 6 ms 4444 KB Output is correct
25 Correct 9 ms 4444 KB Output is correct
26 Correct 7 ms 4444 KB Output is correct
27 Correct 7 ms 4692 KB Output is correct
28 Correct 7 ms 4352 KB Output is correct
29 Correct 7 ms 4440 KB Output is correct
30 Correct 6 ms 4444 KB Output is correct
31 Correct 482 ms 136124 KB Output is correct
32 Correct 467 ms 135844 KB Output is correct
33 Correct 512 ms 135944 KB Output is correct
34 Correct 495 ms 135760 KB Output is correct
35 Correct 479 ms 135728 KB Output is correct
36 Correct 488 ms 133844 KB Output is correct
37 Correct 507 ms 135760 KB Output is correct
38 Correct 527 ms 131736 KB Output is correct
39 Correct 554 ms 135772 KB Output is correct
40 Correct 623 ms 135796 KB Output is correct
41 Correct 580 ms 132256 KB Output is correct
42 Correct 481 ms 135744 KB Output is correct
43 Correct 512 ms 134992 KB Output is correct
44 Correct 498 ms 131920 KB Output is correct
45 Correct 534 ms 135812 KB Output is correct
46 Correct 520 ms 135796 KB Output is correct
47 Correct 515 ms 134120 KB Output is correct
48 Correct 470 ms 135708 KB Output is correct
49 Correct 514 ms 131908 KB Output is correct
50 Correct 423 ms 135704 KB Output is correct
51 Correct 511 ms 135688 KB Output is correct
52 Correct 428 ms 135864 KB Output is correct
53 Correct 441 ms 135708 KB Output is correct
54 Correct 415 ms 135772 KB Output is correct
55 Correct 397 ms 135824 KB Output is correct
56 Correct 379 ms 135636 KB Output is correct
57 Correct 417 ms 135788 KB Output is correct
58 Correct 381 ms 135764 KB Output is correct