oj.uz

Submission #592386

# Submission time Handle Problem Language Result Execution time Memory
592386 2022-07-09T06:38:46 Z bLIC Bank (IZhO14_bank) C++17
100 / 100
 114 ms 8536 KB 
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)(x).size()
#define ft first
#define sd second
#define pb push_back
#define endl '\n'

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<pair<ll, ll>> vll;

#define dgb if(0)


const ll MOD = 1e18;
const int INF = 1e9;

int n, m;  


void solve(){
    cin>>n>>m;

    int a[n], b[m];
    for (int i = 0;i<n;i++) cin>>a[i];
    for (int i = 0;i<m;i++) cin>>b[i];

    int covered[1<<m]{}, leftover[1<<m]{};
    memset(covered, -1, sizeof(covered));
    memset(leftover, -1, sizeof(leftover));
    covered[0] = leftover[0] = 0;
    bool ans = false;
    for (int i = 1;i<(1<<m);i++){
        for (int j = 0;j<m;j++){
            if (i&(1<<j)){
                int pre = i^(1<<j);
                if (covered[pre]==-1) continue;
                if (leftover[pre]+b[j]==a[covered[pre]]) {
                    covered[i] = covered[pre]+1;
                    ans|=(covered[i]==n);
                    leftover[i] = 0;
                }
                else if (leftover[pre]+b[j]<a[covered[pre]]) {
                    covered[i] = covered[pre];
                    leftover[i] = leftover[pre]+b[j];
                }
            }
        }
    }
    if (ans) cout<<"YES";
    else cout<<"NO";
}


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

//   freopen("movie.in", "r", stdin);
//   freopen("movie.out", "w", stdout);
    int t=1;
    // cin>>t;
    while(t--){
        solve();
        cout<<'\n';
    }
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 75 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 100 ms 8404 KB Output is correct
9 Correct 84 ms 8500 KB Output is correct

Subtask #2
25.0 / 25.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 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 75 ms 8404 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 100 ms 8404 KB Output is correct
9 Correct 84 ms 8500 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 324 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 2 ms 340 KB Output is correct
31 Correct 95 ms 8404 KB Output is correct
32 Correct 98 ms 8508 KB Output is correct
33 Correct 84 ms 8512 KB Output is correct
34 Correct 67 ms 8500 KB Output is correct
35 Correct 70 ms 8532 KB Output is correct
36 Correct 70 ms 8536 KB Output is correct
37 Correct 72 ms 8508 KB Output is correct
38 Correct 71 ms 8512 KB Output is correct
39 Correct 73 ms 8500 KB Output is correct
40 Correct 71 ms 8404 KB Output is correct
41 Correct 67 ms 8516 KB Output is correct
42 Correct 114 ms 8500 KB Output is correct
43 Correct 72 ms 8404 KB Output is correct
44 Correct 72 ms 8516 KB Output is correct
45 Correct 111 ms 8504 KB Output is correct
46 Correct 88 ms 8400 KB Output is correct
47 Correct 66 ms 8532 KB Output is correct
48 Correct 102 ms 8508 KB Output is correct
49 Correct 64 ms 8404 KB Output is correct
50 Correct 89 ms 8504 KB Output is correct
51 Correct 69 ms 8512 KB Output is correct
52 Correct 66 ms 8500 KB Output is correct
53 Correct 100 ms 8500 KB Output is correct
54 Correct 95 ms 8508 KB Output is correct
55 Correct 86 ms 8504 KB Output is correct
56 Correct 83 ms 8500 KB Output is correct
57 Correct 103 ms 8404 KB Output is correct
58 Correct 82 ms 8516 KB Output is correct