제출 #91528

#제출 시각아이디문제언어결과실행 시간메모리
91528SOIVIEONE은행 (IZhO14_bank)C++14
19 / 100
61 ms752 KiB
#include <bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> #define INF 1000000021 #define MOD 1000000007 #define pb push_back #define sqr(a) (a)*(a) #define M(a, b) make_pair(a,b) #define T(a, b, c) make_pair(a, make_pair(b, c)) #define F first #define S second #define all(x) (x.begin(), x.end()) #define deb(x) cerr << #x << " = " << x << '\n' #define N 222222 using namespace std; //using namespace __gnu_pbds; typedef long double ld; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; //typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; const ld pi = 2 * acos(0.0); template<class T> bool umin(T& a, T b){if(a>b){a=b;return 1;}return 0;} template<class T> bool umax(T& a, T b){if(a<b){a=b;return 1;}return 0;} template<class T, class TT> bool pal(T a, TT n){int k=0;for(int i=0;i<=n/2;i++){if(a[i]!=a[n-i-1]){k=1;break;}}return k?0:1;} //int month[] = {0,31,28,31,30,31,30,31,31,30,31,30,31}; ll a[N], b[N]; int main() { ll n, m; cin >> n >> m; for(int i = 1; i <= n; i ++) cin >> b[i]; for(int i = 0; i < m; i ++) cin >> a[i]; for(int i = 0; i < (1 << m); i ++) { ll s = 0; for(int j = 0; j < m; j ++) { if(i & (1 << j)) s += a[j]; } if(s == b[1]) return cout << "YES",0 ; } cout << "NO"; getchar(); getchar(); return 0; //ios::sync_with_stdio(false); //cin.tie(0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...