oj.uz

Submission #979787

# Submission time Handle Problem Language Result Execution time Memory
979787 2024-05-11T11:11:13 Z batsukh2006 Bank (IZhO14_bank) C++17
100 / 100
 97 ms 16984 KB 
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<map>
#include<string>
#include<algorithm>
#include<vector>
#include<string.h>
#include<utility>
#include<set>
#include<cmath>
#include<queue>
#include<deque>
#include<functional>
#include<stack>
#include<limits.h>
#include<iomanip>
#include<unordered_map> 
#include<numeric>
#include<tuple>
using namespace std;
 
#define MOD 1000000007
#define int long long
#define ff first
#define ss second
#define endl '\n'
void solve(){
	int n,m; cin>>n>>m;
	vector<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];
	vector<pair<int,int> > dp(1<<m);
	bool ok=0;
	for(int i=0; i<(1<<m); i++){
		for(int k=0; k<m; k++){
			if(i&(1<<k)){
				if(dp[i^(1<<k)].ss+b[k]==a[dp[i^(1<<k)].ff]){
					dp[i]=max(dp[i],{dp[i^(1<<k)].ff+1,0});
				}else{
					dp[i]=max(dp[i],{dp[i^(1<<k)].ff,dp[i^(1<<k)].ss+b[k]});
				}
			}
		}
		if(dp[i].ff==n) ok=1;
	}
	if(ok) cout<<"YES";
	else cout<<"NO";
}
signed main(){
    // freopen("248.in", "r", stdin);
    // freopen("248.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    int t=1;
//    cin>>t;	
    while(t--){
        solve();
        cout<<endl;
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 81 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 83 ms 16732 KB Output is correct
9 Correct 80 ms 16728 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 1 ms 344 KB Output is correct
3 Correct 1 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 1 ms 344 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 1 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 81 ms 16732 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 83 ms 16732 KB Output is correct
9 Correct 80 ms 16728 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 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 1 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 600 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 84 ms 16732 KB Output is correct
32 Correct 84 ms 16732 KB Output is correct
33 Correct 87 ms 16732 KB Output is correct
34 Correct 87 ms 16728 KB Output is correct
35 Correct 85 ms 16732 KB Output is correct
36 Correct 84 ms 16732 KB Output is correct
37 Correct 83 ms 16728 KB Output is correct
38 Correct 80 ms 16732 KB Output is correct
39 Correct 82 ms 16728 KB Output is correct
40 Correct 94 ms 16732 KB Output is correct
41 Correct 83 ms 16728 KB Output is correct
42 Correct 97 ms 16732 KB Output is correct
43 Correct 85 ms 16728 KB Output is correct
44 Correct 82 ms 16732 KB Output is correct
45 Correct 97 ms 16732 KB Output is correct
46 Correct 89 ms 16728 KB Output is correct
47 Correct 83 ms 16728 KB Output is correct
48 Correct 83 ms 16728 KB Output is correct
49 Correct 80 ms 16728 KB Output is correct
50 Correct 81 ms 16728 KB Output is correct
51 Correct 84 ms 16732 KB Output is correct
52 Correct 82 ms 16732 KB Output is correct
53 Correct 88 ms 16728 KB Output is correct
54 Correct 87 ms 16736 KB Output is correct
55 Correct 80 ms 16728 KB Output is correct
56 Correct 85 ms 16728 KB Output is correct
57 Correct 83 ms 16728 KB Output is correct
58 Correct 83 ms 16984 KB Output is correct