oj.uz

Submission #763351

# Submission time Handle Problem Language Result Execution time Memory
763351 2023-06-22T08:32:49 Z Blagoj Bank (IZhO14_bank) C++17
19 / 100
 59 ms 3176 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast,unroll-loops")

using namespace std;

#define endl '\n'
#define ll long long
#define all(x) x.begin(), x.end()

int n, m;
vector<int> s, v;
int dp[20][1 << 20];

int solve(int p, int mask) {
    if (p == n) return dp[p][mask] = 1; 
    if (mask == (1 << v.size()) - 1) return dp[p][mask] = -1;
    if (dp[p][mask] != 0) return dp[p][mask];
    vector<int> c;
    for (int i = 0; i < m; i++) if (!(mask & (1 << i))) c.push_back(i);
    dp[p][mask] = -1;
    for (int i = 0; i < (1 << c.size()); i++) {
        int sum = 0;
        for (int j = 0; j < c.size(); j++) if (i & (1 << j)) sum += v[c[j]];
        if (sum == s[p]) dp[p][mask] = max(dp[p][mask], solve(p + 1, mask | i));
    }
    return dp[p][mask];
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    s.resize(n);
    v.resize(m);
    for (int i = 0; i < n; i++) cin >> s[i];
    for (int i = 0; i < m; i++) cin >> v[i];
    sort(all(s));
    sort(all(v));
    solve(0, 0);
    cout << (dp[0][0] == 1 ? "YES" : "NO"); 
}

Compilation message

bank.cpp: In function 'int solve(int, int)':
bank.cpp:24:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int j = 0; j < c.size(); j++) if (i & (1 << j)) sum += v[c[j]];
      |                         ~~^~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 54 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 59 ms 3176 KB Output is correct
9 Correct 56 ms 212 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 324 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 Incorrect 1 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 54 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 59 ms 3176 KB Output is correct
9 Correct 56 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 324 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 Incorrect 1 ms 340 KB Output isn't correct
18 Halted 0 ms 0 KB -