이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, m;
cin >> n >> m;
int salary[n], billet[m];
for(int loop = 0; loop < n; ++loop) {
cin >> salary[loop];
}
for(int loop = 0; loop < m; ++loop) {
cin >> billet[loop];
}
vector<int> paid((1 << m), -1);
vector<int> leftover((1 << m), -1);
paid[0] = 0;
leftover[0] = 0;
for(int loop = 0; loop < (1 << m); ++loop) {
for(int looping = 0; looping < m; ++looping) {
if((loop & (1 << looping)) == 0) {
continue;
}
int avant = (loop & ~(1 << looping));
if(paid[avant] == -1) {
continue;
}
int pers = salary[paid[avant]];
if(leftover[avant] + billet[looping] < pers) {
leftover[loop] = leftover[avant] + billet[looping];
paid[loop] = paid[avant];
}
else if(leftover[avant] + billet[looping] == pers) {
leftover[loop] = 0;
paid[loop] = paid[avant] + 1;
}
}
if(paid[loop] == n) {
cout << "YES\n";
return 0;
}
}
cout << "NO\n";
}
# | 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... |