#include <iostream>
#include <vector>
#include "stdio.h"
using namespace std;
// #define int long long
int const LLINF = 1e9 + 9;
int const N = (10000 * 101) / 2 + 2;
signed main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#ifdef WTF
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int m, l; cin >> m >> l;
vector <int> x, y, z;
for(int i = -m; i <= m; i ++){
int K; cin >> K;
while(K --){
if(i >= 0){
x.push_back(i);
} else {
y.push_back(-i);
}
}
}
vector <int> dp1(N, -LLINF), dp2(N, -LLINF);
dp1[0] = 0;
dp2[0] = 0;
for(int k: x){
for(int i = N - 1; i >= k; i --){
dp1[i] = max(dp1[i], dp1[i - k] + 1);
}
}
// for(int i = 0; i < N; i ++){
// cout << dp1[i] << " ";
// }
// cout << "\n";
for(int k: y){
for(int i = N - 1; i >= k; i --){
dp2[i] = max(dp2[i], dp2[i - k] + 1);
}
}
int ans = -LLINF;
if(l >= 0){
for(int i = l; i < N; i ++){
int j = i - l;
ans = max(ans, dp1[i] + dp2[j]);
}
} else {
l = -l;
for(int i = l; i < N; i ++){
int j = i - l;
ans = max(ans, dp2[i] + dp1[j]);
}
}
if(ans < 0){
cout << "impossible\n";
} else {
cout << ans << "\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
4180 KB |
Output is correct |
2 |
Correct |
7 ms |
4180 KB |
Output is correct |
3 |
Correct |
6 ms |
4180 KB |
Output is correct |
4 |
Correct |
30 ms |
4180 KB |
Output is correct |
5 |
Runtime error |
536 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
4180 KB |
Output is correct |
2 |
Correct |
7 ms |
4180 KB |
Output is correct |
3 |
Correct |
6 ms |
4180 KB |
Output is correct |
4 |
Correct |
30 ms |
4180 KB |
Output is correct |
5 |
Runtime error |
536 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
4180 KB |
Output is correct |
2 |
Runtime error |
527 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
4180 KB |
Output is correct |
2 |
Runtime error |
527 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
4180 KB |
Output is correct |
2 |
Runtime error |
527 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
4180 KB |
Output is correct |
2 |
Correct |
7 ms |
4180 KB |
Output is correct |
3 |
Correct |
6 ms |
4180 KB |
Output is correct |
4 |
Correct |
30 ms |
4180 KB |
Output is correct |
5 |
Runtime error |
536 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
4180 KB |
Output is correct |
2 |
Runtime error |
527 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
4180 KB |
Output is correct |
2 |
Correct |
7 ms |
4180 KB |
Output is correct |
3 |
Correct |
6 ms |
4180 KB |
Output is correct |
4 |
Correct |
30 ms |
4180 KB |
Output is correct |
5 |
Runtime error |
536 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
28 ms |
4180 KB |
Output is correct |
2 |
Runtime error |
527 ms |
524288 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
4180 KB |
Output is correct |
2 |
Correct |
7 ms |
4180 KB |
Output is correct |
3 |
Correct |
6 ms |
4180 KB |
Output is correct |
4 |
Correct |
30 ms |
4180 KB |
Output is correct |
5 |
Runtime error |
536 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |