oj.uz

Submission #437407

# Submission time Handle Problem Language Result Execution time Memory
437407 2021-06-26T09:39:03 Z Atlant Bank (IZhO14_bank) C++14
100 / 100
 140 ms 8632 KB 
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define dem(x) __builtin_popcount(x)
#define endl '\n'
#define pb push_back
#define SZ(x) (int)((x).size())
#define fi first
#define se second
typedef pair<int,int> ii;
typedef long long ll;
const ll mod = 1e9 + 7; //998244353
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
//    freopen("c.inp","r",stdin);
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    vector<int> b(m), dp(1<<m,-1), have(1<<m, -1);
    for(int &i : a)cin >> i;
    for(int &i : b)cin >> i;
    dp[0] = have[0] = 0;
    for(int mask = 1;mask < 1 << m;++mask){
        for(int i = 0;i < m;++i)if(mask&(1<<i)){
            int tt = mask - (1 << i);
            if(dp[tt] == -1)continue;
            int Next = have[tt] + b[i];
            int target = a[dp[tt]];
            if(Next < target){
                dp[mask] = dp[tt];
                have[mask] = Next;
            }
            else if(Next == target){
                dp[mask] = dp[tt] + 1;
                have[mask] = 0;
            }
        }
        if(dp[mask] == n){
            cout << "YES";
            return 0;
        }
    }
    cout << "NO";
}

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 588 KB Output is correct
5 Correct 95 ms 8524 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 6 ms 8524 KB Output is correct
9 Correct 112 ms 8524 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 312 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 312 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 312 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 2 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 2 ms 436 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 588 KB Output is correct
5 Correct 95 ms 8524 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 6 ms 8524 KB Output is correct
9 Correct 112 ms 8524 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 312 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 312 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 312 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 2 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 2 ms 436 KB Output is correct
31 Correct 123 ms 8516 KB Output is correct
32 Correct 125 ms 8524 KB Output is correct
33 Correct 94 ms 8524 KB Output is correct
34 Correct 94 ms 8524 KB Output is correct
35 Correct 88 ms 8524 KB Output is correct
36 Correct 91 ms 8524 KB Output is correct
37 Correct 87 ms 8524 KB Output is correct
38 Correct 85 ms 8524 KB Output is correct
39 Correct 6 ms 8524 KB Output is correct
40 Correct 100 ms 8524 KB Output is correct
41 Correct 90 ms 8488 KB Output is correct
42 Correct 132 ms 8524 KB Output is correct
43 Correct 90 ms 8524 KB Output is correct
44 Correct 94 ms 8532 KB Output is correct
45 Correct 6 ms 8524 KB Output is correct
46 Correct 112 ms 8524 KB Output is correct
47 Correct 85 ms 8524 KB Output is correct
48 Correct 6 ms 8524 KB Output is correct
49 Correct 89 ms 8528 KB Output is correct
50 Correct 118 ms 8524 KB Output is correct
51 Correct 90 ms 8632 KB Output is correct
52 Correct 86 ms 8524 KB Output is correct
53 Correct 134 ms 8524 KB Output is correct
54 Correct 140 ms 8524 KB Output is correct
55 Correct 134 ms 8520 KB Output is correct
56 Correct 114 ms 8524 KB Output is correct
57 Correct 116 ms 8524 KB Output is correct
58 Correct 120 ms 8528 KB Output is correct