oj.uz

Submission #575411

# Submission time Handle Problem Language Result Execution time Memory
575411 2022-06-10T10:45:27 Z ddy888 Bank (IZhO14_bank) C++17
100 / 100
 284 ms 16824 KB 
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb push_back
#define fi first
#define si second
typedef pair<int,int> pi;
typedef tuple<int,int,int> ti;  
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
int ar[21], br[21];
int dp[(1 << 21) + 1];
int sum[(1 << 21) + 1];
int ans;

int main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); 

    cin >> n >> m;
    for (int i = 1; i <= n; ++i) cin >> ar[i], ar[i] += ar[i - 1];
    for (int i = 1; i <= m; ++i) cin >> br[i];
    for (int i = 1; i <= (1 << (m + 1)) - 1; ++i) {
        int s = 0;
        for (int j = 1; j <= m; ++j) {
            if (i & (1 << j)) s += br[j];
        }
        sum[i] = s;
    }

    memset(dp, -1, sizeof dp);
    dp[0] = 0;
    for (int now = 1; now <= (1 << (m + 1)) - 1; ++now) {
        for (int i = 1; i <= m; ++i) {
            if (!(now & (1 << i))) continue;

            int from = now ^ (1 << i);
            if (dp[from] == -1) continue;
            if (sum[now] == ar[dp[from] + 1]) {
                dp[now] = max(dp[now], dp[from] + 1);
            } else if (sum[now] < ar[dp[from] + 1]) {                
                dp[now] = max(dp[now], dp[from]);
            }
            ans = max(ans, dp[now]);
        }
    }

    cout << (ans >= n ? "YES" : "NO");
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 4 ms 8532 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 10 ms 8788 KB Output is correct
5 Correct 208 ms 16800 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 4 ms 8508 KB Output is correct
8 Correct 247 ms 16612 KB Output is correct
9 Correct 246 ms 16788 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8660 KB Output is correct
2 Correct 7 ms 8660 KB Output is correct
3 Correct 7 ms 8652 KB Output is correct
4 Correct 6 ms 8660 KB Output is correct
5 Correct 7 ms 8660 KB Output is correct
6 Correct 6 ms 8660 KB Output is correct
7 Correct 7 ms 8660 KB Output is correct
8 Correct 7 ms 8660 KB Output is correct
9 Correct 6 ms 8672 KB Output is correct
10 Correct 6 ms 8668 KB Output is correct
11 Correct 7 ms 8656 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 4 ms 8532 KB Output is correct
3 Correct 4 ms 8532 KB Output is correct
4 Correct 10 ms 8788 KB Output is correct
5 Correct 208 ms 16800 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 4 ms 8508 KB Output is correct
8 Correct 247 ms 16612 KB Output is correct
9 Correct 246 ms 16788 KB Output is correct
10 Correct 4 ms 8532 KB Output is correct
11 Correct 4 ms 8532 KB Output is correct
12 Correct 4 ms 8532 KB Output is correct
13 Correct 4 ms 8532 KB Output is correct
14 Correct 4 ms 8520 KB Output is correct
15 Correct 4 ms 8528 KB Output is correct
16 Correct 4 ms 8532 KB Output is correct
17 Correct 4 ms 8532 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 4 ms 8532 KB Output is correct
20 Correct 6 ms 8660 KB Output is correct
21 Correct 7 ms 8660 KB Output is correct
22 Correct 7 ms 8652 KB Output is correct
23 Correct 6 ms 8660 KB Output is correct
24 Correct 7 ms 8660 KB Output is correct
25 Correct 6 ms 8660 KB Output is correct
26 Correct 7 ms 8660 KB Output is correct
27 Correct 7 ms 8660 KB Output is correct
28 Correct 6 ms 8672 KB Output is correct
29 Correct 6 ms 8668 KB Output is correct
30 Correct 7 ms 8656 KB Output is correct
31 Correct 259 ms 16716 KB Output is correct
32 Correct 270 ms 16688 KB Output is correct
33 Correct 222 ms 16680 KB Output is correct
34 Correct 212 ms 16684 KB Output is correct
35 Correct 214 ms 16720 KB Output is correct
36 Correct 210 ms 16712 KB Output is correct
37 Correct 210 ms 16716 KB Output is correct
38 Correct 209 ms 16612 KB Output is correct
39 Correct 227 ms 16716 KB Output is correct
40 Correct 206 ms 16720 KB Output is correct
41 Correct 207 ms 16700 KB Output is correct
42 Correct 271 ms 16716 KB Output is correct
43 Correct 210 ms 16716 KB Output is correct
44 Correct 210 ms 16648 KB Output is correct
45 Correct 274 ms 16716 KB Output is correct
46 Correct 249 ms 16720 KB Output is correct
47 Correct 209 ms 16780 KB Output is correct
48 Correct 234 ms 16720 KB Output is correct
49 Correct 214 ms 16596 KB Output is correct
50 Correct 262 ms 16772 KB Output is correct
51 Correct 212 ms 16744 KB Output is correct
52 Correct 229 ms 16708 KB Output is correct
53 Correct 274 ms 16716 KB Output is correct
54 Correct 284 ms 16716 KB Output is correct
55 Correct 253 ms 16720 KB Output is correct
56 Correct 255 ms 16764 KB Output is correct
57 Correct 253 ms 16824 KB Output is correct
58 Correct 266 ms 16620 KB Output is correct