# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
501052 | EliteCallsYou | Bank (IZhO14_bank) | C++17 | 55 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# include <bits/stdc++.h>
using namespace std ;
//############################################################################
# define read(a)/**/for(int i=0;i<int(sizeof(a)/sizeof(a[0]));i++){cin>>a[i];}
# define print(x)/**/for(auto zx:x){cout<<zx<<' ';}
const char* tochar(string a){return a.c_str();}
void files(){freopen("planting.in","r",stdin);freopen("planting.out","w",stdout);}
void speed(){ios_base::sync_with_stdio(false);cin.tie(0);}
long long gcd(long long a,long long b){if(!b){return a;}a%=b;return gcd(b,a);}
long long lcm(long long a,long long b){return a /gcd(a,b) * b;}
//###########################################################################
const int N = 1e5 + 5 ;
const long long MOD = 1e17+7 ;
//###########################################################################
void hack(){}
//###########################################################################
int main(){
int n, m ;
cin >> n >> m ;
int s[n], c[m] ;
for ( int i = 0 ; i < n ; i ++ ){
cin >> s[i] ;
}
for ( int i = 0 ; i < m ; i ++ ){
cin >> c[i] ;
}
for ( int i = 0 ; i < (1<<20) ; i ++ ){
int sum = 0 ;
for ( int bit = 0 ; bit < min(20,m) ; bit ++ ){
if ( ((1<<bit)&i) ){
sum += c[bit] ;
}
}
if ( sum == s[0] ){
cout << "YES\n" ;
return 0 ;
}
}
cout << "NO\n" ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |