oj.uz

Submission #1038585

# Submission time Handle Problem Language Result Execution time Memory
1038585 2024-07-30T02:33:46 Z 12345678 Uplifting Excursion (BOI22_vault) C++17
0 / 100
 5000 ms 16132 KB 
#include <bits/stdc++.h>

using namespace std;

const int nx=2e6+5, c=1e6;

#define ll long long

ll m, a[nx], 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 (dp[l+c]==-1) cout<<"imposslble";
    else cout<<dp[l+c];
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15964 KB Output is correct
2 Incorrect 15 ms 16132 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15964 KB Output is correct
2 Incorrect 15 ms 16132 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 15960 KB Output is correct
2 Execution timed out 5057 ms 15964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 15960 KB Output is correct
2 Execution timed out 5057 ms 15964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 15960 KB Output is correct
2 Execution timed out 5057 ms 15964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15964 KB Output is correct
2 Incorrect 15 ms 16132 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 15960 KB Output is correct
2 Execution timed out 5057 ms 15964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15964 KB Output is correct
2 Incorrect 15 ms 16132 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 15960 KB Output is correct
2 Execution timed out 5057 ms 15964 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 15964 KB Output is correct
2 Incorrect 15 ms 16132 KB Output isn't correct
3 Halted 0 ms 0 KB -