oj.uz

Submission #961088

# Submission time Handle Problem Language Result Execution time Memory
961088 2024-04-11T13:37:49 Z Kavelmydex Bank (IZhO14_bank) C++17
71 / 100
 534 ms 135860 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]++;
        }   
    }
    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  =)
*/

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 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 532 ms 131752 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 450 ms 135800 KB Output is correct
9 Correct 462 ms 131920 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2508 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 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 2396 KB Output is correct
8 Correct 1 ms 2508 KB Output is correct
9 Correct 1 ms 2396 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 9 ms 4444 KB Output is correct
2 Correct 6 ms 4444 KB Output is correct
3 Correct 6 ms 4516 KB Output is correct
4 Correct 7 ms 4440 KB Output is correct
5 Correct 6 ms 4696 KB Output is correct
6 Correct 6 ms 4444 KB Output is correct
7 Correct 9 ms 4440 KB Output is correct
8 Correct 6 ms 4444 KB Output is correct
9 Correct 6 ms 4444 KB Output is correct
10 Correct 6 ms 4440 KB Output is correct
11 Correct 7 ms 4444 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 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 532 ms 131752 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 450 ms 135800 KB Output is correct
9 Correct 462 ms 131920 KB Output is correct
10 Correct 2 ms 2508 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 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 2396 KB Output is correct
17 Correct 1 ms 2508 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 9 ms 4444 KB Output is correct
21 Correct 6 ms 4444 KB Output is correct
22 Correct 6 ms 4516 KB Output is correct
23 Correct 7 ms 4440 KB Output is correct
24 Correct 6 ms 4696 KB Output is correct
25 Correct 6 ms 4444 KB Output is correct
26 Correct 9 ms 4440 KB Output is correct
27 Correct 6 ms 4444 KB Output is correct
28 Correct 6 ms 4444 KB Output is correct
29 Correct 6 ms 4440 KB Output is correct
30 Correct 7 ms 4444 KB Output is correct
31 Correct 473 ms 135560 KB Output is correct
32 Correct 519 ms 135800 KB Output is correct
33 Correct 534 ms 135764 KB Output is correct
34 Correct 522 ms 135844 KB Output is correct
35 Correct 488 ms 135708 KB Output is correct
36 Correct 477 ms 134028 KB Output is correct
37 Correct 509 ms 135764 KB Output is correct
38 Correct 480 ms 132004 KB Output is correct
39 Correct 439 ms 135816 KB Output is correct
40 Correct 510 ms 135776 KB Output is correct
41 Correct 468 ms 132512 KB Output is correct
42 Correct 496 ms 135820 KB Output is correct
43 Correct 488 ms 134872 KB Output is correct
44 Correct 457 ms 131948 KB Output is correct
45 Correct 469 ms 135764 KB Output is correct
46 Correct 496 ms 135740 KB Output is correct
47 Correct 451 ms 134016 KB Output is correct
48 Correct 475 ms 135848 KB Output is correct
49 Correct 449 ms 131856 KB Output is correct
50 Correct 379 ms 135848 KB Output is correct
51 Correct 445 ms 135852 KB Output is correct
52 Correct 438 ms 135860 KB Output is correct
53 Correct 441 ms 135708 KB Output is correct
54 Correct 388 ms 135788 KB Output is correct
55 Correct 390 ms 135644 KB Output is correct
56 Correct 380 ms 135652 KB Output is correct
57 Incorrect 381 ms 135760 KB Output isn't correct
58 Halted 0 ms 0 KB -