답안 #937933

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
937933	2024-03-04T16:55:00 Z	ibrosh	은행 (IZhO14_bank)	C++17	100 / 100	94 ms	8796 KB

bank

// #pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define ll long long

using namespace std;
template<typename... T>
void see(T&... args) { ((cin >> args), ...);}
template<typename... T>
void put(T&&... args) { ((cout << args << " "), ...);}
template<typename... T>
void putl(T&&... args) { ((cout << args << " "), ...); cout<<'\n';}
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {cerr << *it << "=" << a << ", "; err(++it, args...);}

#define du long double
#define m_p make_pair
#define pb push_back
#define pii pair<int,int>
#define piii pair<pii,int>
#define vi vector<int>
#define vii vector<pii>
#define viii vector<pair<int,pii> >
#define si set<int>
#define sii multiset<pii>
#define siii set<pair<int,pii> >
#define F first
#define S second
#define pre precision
#define sz size()
#define all(x) x.begin(),x.end()
#ifndef ONLINE_JUDGE
#define OK  cout << __LINE__ << "| "<< "---------------------------OK-----------------------" << endl;
#define deb(x) cout << __LINE__ << "| "<< #x  << " = " << x << endl;
#else
#define OK  
#define deb(x) 
#endif
#define nl cout<<'\n'
#define OPEN  freopen ("exam.in","r" , stdin), freopen ("exam.out","w",stdout)
const ll mod=1e9+7;
const ll inf=1e18;
const du PI=3.14;
const int N=21;
const int dx[]={-1,0,1,0};
const int dy[]={0,-1,0,1};
int a[23],b[23];
int ans[N];
pair <int,int> dp[(1<<21)+9];
void Teemka_abi(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int j=1;j<=m;j++){
		cin>>b[j];
	}
	for(int mask=0;mask<(1<<m);mask++){
		for(int j=0;j<m;j++){
			if(mask & (1 << j)){
				int k=dp[mask^(1<<j)].F;
				int smn=dp[mask^(1<<j)].S+b[j+1];
				if(smn==a[k+1]){
					smn=0;
					k++;
				}
				if(dp[mask].F<k){
					dp[mask]={k,smn};
				}
				else if(dp[mask].F==k){
					dp[mask] = {k,smn};
				}
			}
		}
		if(dp[mask].F==n){
			cout<<"YES";
			return;
		}
	}
	cout<<"NO";
	
}
signed main(){
	ios_base::sync_with_stdio(false) ;
    cin.tie(0) ;
    cout.tie(0); 
	// OPEN;	
	int tt=1;
	// cin>>tt;
	while(tt--){
		Teemka_abi();
		cout<<endl;
	}
}

Subtask #1
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	76 ms	8528 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	73 ms	8528 KB	Output is correct

Subtask #2
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 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	344 KB	Output is correct

Subtask #3
27.0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	2 ms	504 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	2 ms	348 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct

Subtask #4
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	76 ms	8528 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	73 ms	8528 KB	Output is correct
10	Correct	0 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	1 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	344 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	468 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	2 ms	504 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	2 ms	348 KB	Output is correct
29	Correct	2 ms	348 KB	Output is correct
30	Correct	2 ms	348 KB	Output is correct
31	Correct	77 ms	8532 KB	Output is correct
32	Correct	81 ms	8532 KB	Output is correct
33	Correct	84 ms	8528 KB	Output is correct
34	Correct	78 ms	8528 KB	Output is correct
35	Correct	80 ms	8528 KB	Output is correct
36	Correct	76 ms	8528 KB	Output is correct
37	Correct	76 ms	8528 KB	Output is correct
38	Correct	74 ms	8532 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	74 ms	8532 KB	Output is correct
41	Correct	74 ms	8532 KB	Output is correct
42	Correct	94 ms	8768 KB	Output is correct
43	Correct	80 ms	8796 KB	Output is correct
44	Correct	74 ms	8496 KB	Output is correct
45	Correct	1 ms	344 KB	Output is correct
46	Correct	85 ms	8528 KB	Output is correct
47	Correct	77 ms	8628 KB	Output is correct
48	Correct	0 ms	464 KB	Output is correct
49	Correct	73 ms	8528 KB	Output is correct
50	Correct	78 ms	8528 KB	Output is correct
51	Correct	82 ms	8532 KB	Output is correct
52	Correct	85 ms	8528 KB	Output is correct
53	Correct	85 ms	8528 KB	Output is correct
54	Correct	88 ms	8444 KB	Output is correct
55	Correct	79 ms	8528 KB	Output is correct
56	Correct	84 ms	8584 KB	Output is correct
57	Correct	81 ms	8456 KB	Output is correct
58	Correct	80 ms	8532 KB	Output is correct

답안 #937933

Compilation message

Subtask #1 19.0 / 19.0

Subtask #2 25.0 / 25.0

Subtask #3 27.0 / 27.0

Subtask #4 29.0 / 29.0

Subtask #1
19.0 / 19.0

Subtask #2
25.0 / 25.0

Subtask #3
27.0 / 27.0

Subtask #4
29.0 / 29.0