oj.uz

Submission #869222

# Submission time Handle Problem Language Result Execution time Memory
869222 2023-11-03T14:19:58 Z JakobZorz Bank (IZhO14_bank) C++17
100 / 100
 102 ms 8688 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second

//#define TEST_CASES

int n,m;
int pay[20];
int note[20];
int pre[1<<20];
int rem[1<<20];

void solve(){
    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>pay[i];
    for(int i=0;i<m;i++)
        cin>>note[i];
    
    for(int mask=0;mask<(1<<m);mask++){
        for(int nnote=0;nnote<m;nnote++){
            int nmask=mask|(1<<nnote);
            if(nmask==mask)
                continue;
            
            int nrem=rem[mask]+note[nnote];
            int npre=pre[mask];
            if(nrem>pay[npre])
                continue;
            if(nrem==pay[npre]){
                nrem=0;
                npre++;
                if(npre==n){
                    cout<<"YES\n";
                    return;
                }
            }
            
            if(npre>=pre[nmask]){
                pre[nmask]=npre;
                rem[nmask]=nrem;
            }
        }
    }
    
    cout<<"NO\n";
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("bank.in","r",stdin);
    //freopen("bank.out","w",stdout);
#ifdef TEST_CASES
    int t;cin>>t;while(t--)solve();
#else
    solve();
#endif
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 78 ms 8488 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 95 ms 8656 KB Output is correct

Subtask #2
25.0 / 25.0

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

Subtask #3
27.0 / 27.0

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

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 78 ms 8488 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 95 ms 8656 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 460 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 48 ms 8524 KB Output is correct
32 Correct 53 ms 8532 KB Output is correct
33 Correct 54 ms 8532 KB Output is correct
34 Correct 48 ms 8528 KB Output is correct
35 Correct 89 ms 8424 KB Output is correct
36 Correct 80 ms 8536 KB Output is correct
37 Correct 90 ms 8432 KB Output is correct
38 Correct 79 ms 8640 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 83 ms 8468 KB Output is correct
41 Correct 79 ms 8528 KB Output is correct
42 Correct 102 ms 8412 KB Output is correct
43 Correct 99 ms 8528 KB Output is correct
44 Correct 79 ms 8636 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 55 ms 8540 KB Output is correct
47 Correct 81 ms 8528 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 77 ms 8644 KB Output is correct
50 Correct 48 ms 8532 KB Output is correct
51 Correct 76 ms 8688 KB Output is correct
52 Correct 47 ms 8468 KB Output is correct
53 Correct 52 ms 8528 KB Output is correct
54 Correct 48 ms 8508 KB Output is correct
55 Correct 48 ms 8520 KB Output is correct
56 Correct 50 ms 8508 KB Output is correct
57 Correct 93 ms 8648 KB Output is correct
58 Correct 49 ms 8532 KB Output is correct