oj.uz

Submission #824353

# Submission time Handle Problem Language Result Execution time Memory
824353 2023-08-14T03:54:29 Z devariaota Bank (IZhO14_bank) C++17
46 / 100
 75 ms 12868 KB 
#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define tup tuple<int, int, int>
#define pii pair<int, int>
#define fi first
#define se second
#define pub push_back
#define pob pop_back
int n, m;
signed main() {
    ioss;
    cin >> n >> m;
    vector<int> a(n+2), b(m+2);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < m; i++) cin >> b[i];

    vector<int> num[20004];
    for(int i = 0; i < (1 << m); i++) {
        int cur = 0;
        for(int j = 0; j < m; j++) {
            if(i & (1 << j)) cur += b[j];
        }
        num[cur].pub(i);
    }

    bool vis[m+2] = {};
    bool ok = 1;
    for(int i = 0; i < n; i++) {
        if(num[a[i]].size() == 0) {
            ok = 0;
            break;
        }

        for(auto idx : num[a[i]]) {
            bool done = 1;
            for(int j = 0; j < m; j++) {
                if(idx & (1 << j)) {
                    if(vis[j]) {
                        done = 0;
                        break;
                    }
                    vis[j] = 1;
                }
            }
            if(done) break;
        }
    }
    cout << (ok ? "YES" : "NO") << endl;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 75 ms 12868 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 72 ms 11444 KB Output is correct
9 Correct 75 ms 12052 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Incorrect 1 ms 724 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 1000 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 980 KB Output is correct
8 Correct 3 ms 980 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 908 KB Output is correct
11 Correct 2 ms 916 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 75 ms 12868 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 72 ms 11444 KB Output is correct
9 Correct 75 ms 12052 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Incorrect 1 ms 724 KB Output isn't correct
14 Halted 0 ms 0 KB -