oj.uz

Submission #651327

# Submission time Handle Problem Language Result Execution time Memory
651327 2022-10-18T10:11:34 Z mychecksedad Bank (IZhO14_bank) C++17
100 / 100
 102 ms 6860 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 23;


int n, m, a[N], b[N];
vector<int> v[1005], bank, used(K), sums[1005], people, dp[K];
bitset<(1<<20)> dpp[K];
void solve(){
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= m; ++i) cin >> b[i];

    if(n>m){
        cout << "NO";
        return;
    }

    cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";

    for(int i = 1; i <= n; ++i) v[a[i]].pb(i);
    for(int i = 1; i <= m; ++i){
        if(!v[b[i]].empty()){
            used[v[b[i]].back()] = 1;
            v[b[i]].pop_back();
        }else{
            bank.pb(b[i]);
        }
    }
    for(int i = 1; i <= n; ++i) if(!used[i]) people.pb(a[i]);
    m = bank.size();
    n = people.size();
    if(m < 2*n){
        cout << "NO";
        return;
    }
    if(!n){
        cout << "YES";
        return;
    }
    for(int mask = 0; mask < (1<<m); ++mask){
        int sum = 0;
        for(int j = 0; j < m; ++j) if((1<<j)&mask) sum += bank[j];
        if(sum <= 1000) sums[sum].pb(mask);
    }

    dp[0] = sums[people[0]];
    for(int j = 1; j < n; ++j){
        bool ok = 0;
        for(int submask: dp[j - 1]){
            for(int subbank: sums[people[j]]){
                if(!(submask & subbank)){
                    ok = 1;
                    if(!dpp[j][subbank|submask]){
                        dpp[j][subbank|submask] = 1;
                        dp[j].pb(subbank|submask);
                    }
                }
            }
        }                    
    }
    if(!dp[n - 1].empty()){
        cout << "YES";
    }else{
        cout << "NO";
    }
}





int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
    return 0;
 
}

Compilation message

bank.cpp: In function 'void solve()':
bank.cpp:61:14: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   61 |         bool ok = 0;
      |              ^~
bank.cpp: In function 'int main()':
bank.cpp:87:16: warning: unused variable 'aa' [-Wunused-variable]
   87 |     int T = 1, aa;
      |                ^~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 63 ms 6860 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 60 ms 5796 KB Output is correct
9 Correct 61 ms 6220 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 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 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 340 KB Output is correct
6 Correct 1 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 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 63 ms 6860 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 60 ms 5796 KB Output is correct
9 Correct 61 ms 6220 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 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 340 KB Output is correct
25 Correct 1 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 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 69 ms 5668 KB Output is correct
32 Correct 102 ms 6236 KB Output is correct
33 Correct 56 ms 1548 KB Output is correct
34 Correct 27 ms 392 KB Output is correct
35 Correct 14 ms 412 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 60 ms 524 KB Output is correct
38 Correct 56 ms 468 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 58 ms 2076 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 64 ms 6312 KB Output is correct
43 Correct 57 ms 2520 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 63 ms 6724 KB Output is correct
46 Correct 58 ms 3868 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 65 ms 6024 KB Output is correct
49 Correct 65 ms 6220 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 32 ms 3428 KB Output is correct
52 Correct 64 ms 6012 KB Output is correct
53 Correct 13 ms 816 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct