oj.uz

Submission #580598

# Submission time Handle Problem Language Result Execution time Memory
580598 2022-06-21T13:34:31 Z FatihSolak Bank (IZhO14_bank) C++17
100 / 100
 188 ms 90696 KB 
#include <bits/stdc++.h>
#define N 20
using namespace std;
int a[N];
int b[N];
bool ok[(1<<N)];
int n,m;
int dp[N+1][(1<<N)];
int sum[(1<<N)];
bool f(int x,int mask){
    if(dp[x][mask] != -1)
        return dp[x][mask];
    dp[x][mask] = 0;
    for(int mask2 = mask;mask2;mask2 = (mask2-1) & mask){
        if(sum[mask2] == a[x-1]){
            dp[x][mask] |= f(x-1,mask ^ mask2);
        }
        if(dp[x][mask])
            return 1;
    }
    return 0;
}
void solve(){
    cin >> n >> m;
    for(int i = 0;i<n;i++){
        cin >> a[i];
    }
    for(int i = 0;i<m;i++){
        cin >> b[i];
    }
    while(n && m){
        bool ok = 0;
        for(int i = 0;i<n && !ok;i++){
            for(int j = 0;j<m && !ok;j++){
                if(a[i] == b[j]){
                    ok = 1;
                    n--,m--;
                    for(int c = i;c<n;c++){
                        a[c] = a[c+1];
                    }
                    for(int c = j;c<m;c++){
                        b[c] = b[c+1];
                    }
                }
            }
        }
        if(!ok)break;
    }
    if(n*2 > m){
        cout << "NO" << endl;
        return;
    }
    for(int i = 0;i<(1<<m);i++){
        for(int j = 0;j<m;j++){
            if((1<<j) & i){
                sum[i] += b[j];
            }
        }
    }
    for(int j = 0;j<(1<<N);j++){
        dp[0][j] = 1;
    }
    for(int i = 1;i<=N;i++){
        for(int j = 0;j<(1<<N);j++){
            dp[i][j] = -1;
        }
    }
    if(f(n,(1<<m)-1)){
        cout << "YES" << endl;
    }
    else cout << "NO" << endl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
    #ifdef Local
        cout << endl << fixed << setprecision(2) << 1000.0*clock()/CLOCKS_PER_SEC << " milliseconds.";
    #endif
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 86476 KB Output is correct
2 Correct 33 ms 86496 KB Output is correct
3 Correct 32 ms 86496 KB Output is correct
4 Correct 35 ms 86524 KB Output is correct
5 Correct 95 ms 90500 KB Output is correct
6 Correct 33 ms 86424 KB Output is correct
7 Correct 37 ms 86420 KB Output is correct
8 Correct 98 ms 90576 KB Output is correct
9 Correct 96 ms 90580 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 86484 KB Output is correct
2 Correct 35 ms 86384 KB Output is correct
3 Correct 32 ms 86376 KB Output is correct
4 Correct 35 ms 86404 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 35 ms 86444 KB Output is correct
7 Correct 33 ms 86368 KB Output is correct
8 Correct 36 ms 86468 KB Output is correct
9 Correct 34 ms 86376 KB Output is correct
10 Correct 36 ms 86384 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 86444 KB Output is correct
2 Correct 35 ms 86484 KB Output is correct
3 Correct 33 ms 86484 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 36 ms 86536 KB Output is correct
7 Correct 35 ms 86524 KB Output is correct
8 Correct 36 ms 86484 KB Output is correct
9 Correct 36 ms 86408 KB Output is correct
10 Correct 34 ms 86420 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 86476 KB Output is correct
2 Correct 33 ms 86496 KB Output is correct
3 Correct 32 ms 86496 KB Output is correct
4 Correct 35 ms 86524 KB Output is correct
5 Correct 95 ms 90500 KB Output is correct
6 Correct 33 ms 86424 KB Output is correct
7 Correct 37 ms 86420 KB Output is correct
8 Correct 98 ms 90576 KB Output is correct
9 Correct 96 ms 90580 KB Output is correct
10 Correct 34 ms 86484 KB Output is correct
11 Correct 35 ms 86384 KB Output is correct
12 Correct 32 ms 86376 KB Output is correct
13 Correct 35 ms 86404 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 35 ms 86444 KB Output is correct
16 Correct 33 ms 86368 KB Output is correct
17 Correct 36 ms 86468 KB Output is correct
18 Correct 34 ms 86376 KB Output is correct
19 Correct 36 ms 86384 KB Output is correct
20 Correct 38 ms 86444 KB Output is correct
21 Correct 35 ms 86484 KB Output is correct
22 Correct 33 ms 86484 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 36 ms 86536 KB Output is correct
26 Correct 35 ms 86524 KB Output is correct
27 Correct 36 ms 86484 KB Output is correct
28 Correct 36 ms 86408 KB Output is correct
29 Correct 34 ms 86420 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 97 ms 90588 KB Output is correct
32 Correct 96 ms 90568 KB Output is correct
33 Correct 96 ms 90572 KB Output is correct
34 Correct 65 ms 88524 KB Output is correct
35 Correct 48 ms 87420 KB Output is correct
36 Correct 33 ms 86512 KB Output is correct
37 Correct 97 ms 90508 KB Output is correct
38 Correct 95 ms 90588 KB Output is correct
39 Correct 34 ms 86496 KB Output is correct
40 Correct 96 ms 90488 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 118 ms 90508 KB Output is correct
43 Correct 101 ms 90496 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 98 ms 90524 KB Output is correct
46 Correct 94 ms 90472 KB Output is correct
47 Correct 32 ms 86476 KB Output is correct
48 Correct 96 ms 90480 KB Output is correct
49 Correct 94 ms 90472 KB Output is correct
50 Correct 38 ms 86372 KB Output is correct
51 Correct 68 ms 88504 KB Output is correct
52 Correct 188 ms 90696 KB Output is correct
53 Correct 38 ms 86740 KB Output is correct
54 Correct 33 ms 86432 KB Output is correct
55 Correct 34 ms 86476 KB Output is correct
56 Correct 35 ms 86484 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 37 ms 86476 KB Output is correct