#include <bits/stdc++.h>
using namespace std;
const int MAX_M = 300;
const int MAX_S = 3e5;
const int MIN_S = -MAX_S;
const long long INF = 1e18;
int a[2 * MAX_M + 1];
long long maxObj[MAX_S - MIN_S + 1];
int main() {
int m, l;
cin >> m >> l;
for ( int i = 0; i <= 2 * m; i++ )
cin >> a[i];
for ( int s = 0; s <= MAX_S - MIN_S; s++ )
maxObj[s] = -INF;
maxObj[0 - MIN_S] = 0;
for ( int i = 0; i <= 2 * m; i++ ) {
int x = i - m;
for ( int j = 1; j <= a[i] && j * x <= MAX_S && j * x >= MIN_S; j++ ) {
if ( x > 0 ) {
for ( int s = MAX_S - MIN_S; s >= x; s-- )
maxObj[s] = max( maxObj[s], maxObj[s - x] + 1 );
} else {
for ( int s = x; s <= MAX_S - MIN_S; s++ )
maxObj[s] = max( maxObj[s], maxObj[s - x] + 1 );
}
}
}
if ( maxObj[l - MIN_S] < 0 )
cout << "impossible\n";
else
cout << maxObj[l - MIN_S] << "\n";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
4952 KB |
Output is correct |
2 |
Correct |
6 ms |
4956 KB |
Output is correct |
3 |
Correct |
4 ms |
4956 KB |
Output is correct |
4 |
Correct |
29 ms |
4956 KB |
Output is correct |
5 |
Runtime error |
5 ms |
10076 KB |
Execution killed with signal 11 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
4952 KB |
Output is correct |
2 |
Correct |
6 ms |
4956 KB |
Output is correct |
3 |
Correct |
4 ms |
4956 KB |
Output is correct |
4 |
Correct |
29 ms |
4956 KB |
Output is correct |
5 |
Runtime error |
5 ms |
10076 KB |
Execution killed with signal 11 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
5116 KB |
Output is correct |
2 |
Runtime error |
5 ms |
10072 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
5116 KB |
Output is correct |
2 |
Runtime error |
5 ms |
10072 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
5116 KB |
Output is correct |
2 |
Runtime error |
5 ms |
10072 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
4952 KB |
Output is correct |
2 |
Correct |
6 ms |
4956 KB |
Output is correct |
3 |
Correct |
4 ms |
4956 KB |
Output is correct |
4 |
Correct |
29 ms |
4956 KB |
Output is correct |
5 |
Runtime error |
5 ms |
10076 KB |
Execution killed with signal 11 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
5116 KB |
Output is correct |
2 |
Runtime error |
5 ms |
10072 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
4952 KB |
Output is correct |
2 |
Correct |
6 ms |
4956 KB |
Output is correct |
3 |
Correct |
4 ms |
4956 KB |
Output is correct |
4 |
Correct |
29 ms |
4956 KB |
Output is correct |
5 |
Runtime error |
5 ms |
10076 KB |
Execution killed with signal 11 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
29 ms |
5116 KB |
Output is correct |
2 |
Runtime error |
5 ms |
10072 KB |
Execution killed with signal 11 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
4952 KB |
Output is correct |
2 |
Correct |
6 ms |
4956 KB |
Output is correct |
3 |
Correct |
4 ms |
4956 KB |
Output is correct |
4 |
Correct |
29 ms |
4956 KB |
Output is correct |
5 |
Runtime error |
5 ms |
10076 KB |
Execution killed with signal 11 |
6 |
Halted |
0 ms |
0 KB |
- |