#include <bits/stdc++.h>
using namespace std;
const int nx=2e6+5, c=1e6;
#define ll long long
ll m, z, p[nx], n[nx], dp[nx], l;
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>m>>l;
for (int i=m; i>=1; i--) cin>>n[i];
cin>>z;
for (int i=1; i<=m; i++) cin>>p[i];
for (int i=0; i<nx; i++) dp[i]=-1;
dp[c]=z;
for (int i=1; i<=m; i++)
{
for (int t=0; t<n[i]; t++)
{
for (int j=0; j<nx; j++)
{
if (j+i<nx&&dp[j+i]!=-1) dp[j]=max(dp[j], dp[j+i]+1);
}
}
}
for (int i=1; i<=m; i++)
{
for (int t=0; t<p[i]; t++)
{
for (int j=nx-1; j>=0; j--)
{
if (j-i>=0&&dp[j-i]!=-1) dp[j]=max(dp[j], dp[j-i]+1);
}
}
}
if (z==0) cout<<1/0;
if (l+c<0||l+c>nx||dp[l+c]<1) cout<<"imposslble";
else cout<<dp[l+c];
}
Compilation message
vault.cpp: In function 'int main()':
vault.cpp:40:22: warning: division by zero [-Wdiv-by-zero]
40 | if (z==0) cout<<1/0;
| ~^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
15964 KB |
Output is correct |
2 |
Incorrect |
15 ms |
15964 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
15964 KB |
Output is correct |
2 |
Incorrect |
15 ms |
15964 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
15960 KB |
Output is correct |
2 |
Execution timed out |
5049 ms |
15960 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
15960 KB |
Output is correct |
2 |
Execution timed out |
5049 ms |
15960 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
15960 KB |
Output is correct |
2 |
Execution timed out |
5049 ms |
15960 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
15964 KB |
Output is correct |
2 |
Incorrect |
15 ms |
15964 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
15960 KB |
Output is correct |
2 |
Execution timed out |
5049 ms |
15960 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
15964 KB |
Output is correct |
2 |
Incorrect |
15 ms |
15964 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
83 ms |
15960 KB |
Output is correct |
2 |
Execution timed out |
5049 ms |
15960 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
15964 KB |
Output is correct |
2 |
Incorrect |
15 ms |
15964 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |