oj.uz

Submission #434584

# Submission time Handle Problem Language Result Execution time Memory
434584 2021-06-21T12:26:02 Z MohammadAghil Bank (IZhO14_bank) C++14
100 / 100
 106 ms 8468 KB 
    #include <bits/stdc++.h> 
    using namespace std;
    typedef long long ll;
    #define rep(i,l,r) for(int i = (l); i < r; i++)
    #define per(i,r,l) for(int i = (r); i >= l; i--)
    #define all(x) x.begin(), x.end()
    #define sz(x) (int)(x).size()
    #define pb push_back
    #define ff first
    #define ss second 

    const ll mod = 1e9 + 7, maxn = 20, inf = 1e9 + 5;

    int a[maxn], c[maxn];
    pair<int, int> dp[1 << maxn];

    int main(){
        int n, m; cin >> n >> m;
        rep(i,0,n) cin >> a[i];
        rep(i,0,m) cin >> c[i];
        rep(b,1,1 << m){
            rep(i,0,m){
                dp[b].ff = -1;
                if((b & (1 << i)) && dp[b ^ (1 << i)].ff != -1){
                    int t = a[dp[b ^ (1 << i)].ff] - dp[b ^ (1 << i)].ss;
                    if(t < c[i]) continue;
                    dp[b] = dp[b ^ (1 << i)];
                    dp[b].ss += c[i];
                    if(dp[b].ss == a[dp[b].ff]) dp[b] = {dp[b].ff + 1, 0};
                    if(dp[b].ff == n) return cout << "YES\n", 0;
                    break;
                }
            }
        }
        cout << "NO\n";
        return 0;
    }

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 91 ms 8368 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 8 ms 8396 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 91 ms 8368 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 8 ms 8396 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 2 ms 332 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 2 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 33 ms 8420 KB Output is correct
32 Correct 17 ms 8420 KB Output is correct
33 Correct 97 ms 8364 KB Output is correct
34 Correct 89 ms 8452 KB Output is correct
35 Correct 90 ms 8388 KB Output is correct
36 Correct 105 ms 8420 KB Output is correct
37 Correct 90 ms 8420 KB Output is correct
38 Correct 106 ms 8388 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 90 ms 8424 KB Output is correct
41 Correct 100 ms 8388 KB Output is correct
42 Correct 69 ms 8388 KB Output is correct
43 Correct 92 ms 8392 KB Output is correct
44 Correct 92 ms 8360 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 102 ms 8372 KB Output is correct
47 Correct 88 ms 8384 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 89 ms 8456 KB Output is correct
50 Correct 22 ms 8396 KB Output is correct
51 Correct 88 ms 8448 KB Output is correct
52 Correct 85 ms 8420 KB Output is correct
53 Correct 21 ms 8468 KB Output is correct
54 Correct 22 ms 8396 KB Output is correct
55 Correct 23 ms 8396 KB Output is correct
56 Correct 16 ms 8412 KB Output is correct
57 Correct 19 ms 8376 KB Output is correct
58 Correct 15 ms 8396 KB Output is correct