# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098319 | vjudge1 | 은행 (IZhO14_bank) | C++17 | 185 ms | 904 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>
#define pb push_back
#define int long long
#define S second
#define F first
#define ahah ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int N=1e6+7;
const int MOD=1e9+7;
int a[N],b[N];
bool used[N];
signed main() {
ahah
int n,m;
cin >> n >> m;
for(int i = 1 ; i <= n ; i++){
cin >> a[i];
}
for(int i = 1 ; i <= m ; i++){
cin >> b[i];
}
sort(a+1,a+1+n);
sort(b+1,b+1+m);
reverse(b+1,b+1+m);
map<int,vector<int> >mp;
for(int i = 0 ; i < (1 << m) ; i++){
vector<int>vc;
for(int j = 0 ; j < m ; j++){
if(i&(1 << j)){
vc.pb(j+1);
}
}
int cnt=0;
for(int j = 0 ; j < vc.size() ; j++){
cnt+=b[vc[j]];
}
if(mp[cnt].size() == 0){
for(int j = 0 ; j < vc.size() ; j++){
mp[cnt].pb(vc[j]);
}
}
}
for(int i = 1 ; i <= n ; i++){
if(mp[a[i]].size() != 0){
for(int j = 0 ; j < mp[a[i]].size() ; j++){
if(used[mp[a[i]][j]]){
cout << "NO";
return 0;
}
else{
used[mp[a[i]][j]]=true;
}
}
}else{
cout << "NO";
return 0;
}
}
cout << "YES";
}
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... |