제출 #1089125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089125		vjudge1	은행 (IZhO14_bank)	C++17	19 / 100	61 ms	444 KiB

bank

//#pragma GCC optimize(" unroll-loops")
//#pragma gcc optimize("Ofast")
//#pragma GCC optimization("Ofast")
//#pragma optimize(Ofast)
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>
using namespace std;

typedef long long ll;
typedef long double ld;

#define all(x) x.begin(),x.end()
#define pb push_back
#define ent "\n"

const int maxn = (int)2e5 + 13;
const ll inf = (long long)1e18 + 20;
const int mod = (int)1e9 + 7;

int gcd(int x,int y){while(1){if(x > y)swap(x,y);if(!x)return y;y %= x;}}

int n,a[maxn];
int m,b[maxn];

void solve(){
	cin >> n >> m;
	for(int i = 1 ; i <= n ; i ++){
		cin >> a[i];
	}
	for(int i = 1 ; i <= m ; i ++){
		cin >> b[i];
	}
	for(int i = 1 ; i < (1ll << m) ; i ++){
		ll sum = 0;	
		for(int j = 0 ; j < m ; j ++){
			if((i >> j)&1){
				sum += b[j + 1];
			}
		}
		if(sum == a[1]){
			cout << "YES\n";
			return;
		}
	}
	cout << "NO\n";
}

int main(){
	// freopen("ones.in" , "r" , stdin) ;
	// freopen("ones.out" , "w" , stdout) ;
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t --){
		solve();
	}
	return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29