oj.uz

Submission #982849

# Submission time Handle Problem Language Result Execution time Memory
982849 2024-05-14T19:55:38 Z dpsaveslives Bank (IZhO14_bank) C++17
52 / 100
 1000 ms 996 KB 
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 21;
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int N,M; cin >> N >> M;
    vector<int> arr(N),bank(M);
    for(int i = 0;i<N;++i) cin >> arr[i];
    for(int i = 0;i<M;++i) cin >> bank[i];
    vector<vector<int>> poss(N);
    for(int i = 0;i<N;++i){
        for(int j = 1;j<(1<<M);++j){
            int cur = 0;
            for(int k = 0;k<M;++k){
                if((1<<k)&j){
                    cur += bank[k];
                }
            }
            if(cur == arr[i]){
                poss[i].push_back(j);
            }
        }
    }
    vector<bool> dp((1<<M),false); dp[0] = true;
    for(int i = 0;i<N;++i){
        vector<bool> newdp((1<<M),false);
        for(int j = (1<<M)-1;j>=0;--j){
            for(auto t : poss[i]){
                if(t&j) continue;
                if(dp[j]){
                    //cout << j << " " << t << "\n";
                    newdp[j|t] = true;
                }
            }
        }
        dp = newdp;
    }
    for(int i = 0;i<(1<<M);++i){
        if(dp[i]){
            cout << "YES\n";
            return 0;
        }
    }
    cout << "NO\n";
    return 0;
}

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 65 ms 688 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Execution timed out 1030 ms 996 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 348 KB Output is correct
2 Correct 1 ms 356 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 456 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 348 KB Output is correct
2 Correct 3 ms 344 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 13 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 5 ms 548 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 7 ms 348 KB Output is correct
10 Correct 7 ms 344 KB Output is correct
11 Correct 13 ms 600 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 7 ms 348 KB Output is correct
5 Correct 65 ms 688 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Execution timed out 1030 ms 996 KB Time limit exceeded
9 Halted 0 ms 0 KB -