oj.uz

Submission #679283

# Submission time Handle Problem Language Result Execution time Memory
679283 2023-01-08T01:54:43 Z Hacv16 Bank (IZhO14_bank) C++17
52 / 100
 1000 ms 7756 KB 
#include<bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
const int MAX = 22;
const int MAXM = 50005;
const int INF = 0x3f3f3f3f;
 
int n, m, a[MAX], b[MAX];
bool dp[MAX][1 << MAX];
vector<int> g[MAXM];
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    cin >> n >> m;
 
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];
 
    for(int mask = 0; mask < (1 << m); mask++){
        int cur = 0;
        for(int i = 0; i < m; i++)
            if(mask & (1 << i)) cur += b[i];
        g[cur].emplace_back(mask);
    }

    for(int i = 1; i <= n; i++){
        if(g[a[i]].empty()){
            cout << "NO" << '\n';
            return 0; 
        }
    }
 
    dp[0][0] = true;
 
    for(int i = 1; i <= n; i++){
        for(int mask = 0; mask < (1 << m); mask++){
            for(auto sub : g[a[i]]){
                if((mask & sub) != sub) continue;
                dp[i][mask] |= (dp[i - 1][mask ^ sub]);
                if(dp[i][mask]) break;
            }
        }
    }
 
    bool pos = false;
 
    for(int mask = 0; mask < (1 << m) && !pos; mask++)
        pos |= dp[n][mask];
 
    cout << (pos ? "YES" : "NO") << '\n';
 
    return 0;
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 6 ms 1748 KB Output is correct
5 Correct 31 ms 7756 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Execution timed out 1090 ms 7256 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1748 KB Output is correct
2 Correct 2 ms 1620 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 2 ms 1492 KB Output is correct
5 Correct 2 ms 1620 KB Output is correct
6 Correct 2 ms 1620 KB Output is correct
7 Correct 2 ms 1620 KB Output is correct
8 Correct 2 ms 1620 KB Output is correct
9 Correct 2 ms 1748 KB Output is correct
10 Correct 3 ms 1748 KB Output is correct
11 Correct 2 ms 1572 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1492 KB Output is correct
2 Correct 1 ms 1492 KB Output is correct
3 Correct 1 ms 1492 KB Output is correct
4 Correct 6 ms 1748 KB Output is correct
5 Correct 31 ms 7756 KB Output is correct
6 Correct 1 ms 1492 KB Output is correct
7 Correct 1 ms 1492 KB Output is correct
8 Execution timed out 1090 ms 7256 KB Time limit exceeded
9 Halted 0 ms 0 KB -