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 int int64_t
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n, target; cin >> n >> target;
vector<int> coins(2*n+1);
for (int i = 0; i<2*n+1; i++) cin >> coins[i];
vector<int> coinsEXPL;
for (int i = 0; i<2*n+1; i++) {
for (int j = 0; j<coins[i]; j++) coinsEXPL.push_back(i-n);
}
map<int, int> dp;
dp[0] = 0;
for (int i: coinsEXPL) {
map<int, int> newDP = dp;
for (auto j: dp) {
cerr << j.first << " " << j.second << "\n";
newDP[j.first+i] = max(j.second+1, newDP[j.first+i]);
}
dp = newDP;
}
if (dp.count(target)) cout << dp[target] << "\n";
else cout << "impossible\n";
return 0;
}
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |