제출 #870804

#제출 시각아이디문제언어결과실행 시간메모리
870804NurislamBank (IZhO14_bank)C++14
71 / 100
1066 ms464 KiB
#include <bits/stdc++.h>
using namespace std;/*
<<<<It's never too late for a new beginning in your life>>>>
Today is hard
  tomorrow will worse
  but the day after tomorrow will be the sunshine..

HARD WORK BEATS TALENT WHEN TALENT DOESN'T WORK HARD............
Never give up  */

//The most CHALISHKANCHIK
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);
#define endl '\n'
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define rew(i, a, b) for(int i = a; i < b; i++)
#define wer(i, a, b) for(int i = b - 1; i >= a; i--)
#define int long long
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vii;
int n, m, ans = 0;
int a[21];
void ch(vi us, multiset<int> b){
	int it = 0;
	for(int i:us){
		if(i == 0)break;
		it++;
	}
	if(it == n){ans = 1;return;}
	multiset<int> st = b;
	for(int ms = 1; ms < (int)(1<<b.size()); ms++){
		vi res;
		int cnt = 0, sum = 0;
		for(int i:b){
			if((ms>>cnt) & 1){
				sum+=i;
				res.pb(i);
			}
			cnt++;
			//~ cout << ((ms >> cnt)&1);
			if(sum > a[it])break;
		}
		//~ cout << endl;
		if(sum == a[it]){
			for(int i:res)b.erase(b.find(i));
			us[it] = 1;
			ch(us, b);
			us[it] = 0;
			b = st;
		}
	}
}
void solve(){
	cin >> n >> m;
	multiset<int> st;
	rew(i, 0, n)cin >> a[i];
	rew(i, 0, m){int x;cin >> x;st.insert(x);}
	vi us(n, 0);
	ch(us, st);
	if(ans)cout << "YES\n";
	else cout << "NO\n";
}
main(){
	ios
	int t = 1;
	//~ cin >> t;
	while(t--){
		solve();
	}
}










컴파일 시 표준 에러 (stderr) 메시지

bank.cpp:67:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   67 | main(){
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...