oj.uz

Submission #82904

# Submission time Handle Problem Language Result Execution time Memory
82904 2018-11-02T18:36:36 Z ToadDaveski Bank (IZhO14_bank) C++14
19 / 100
 2 ms 1400 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll dp[45][45][2501],a[45],b[45];
int main()
{

    ll n,m,i,j,g;
    cin>>n>>m;
    for(i=1;i<=n;i++)
        cin>>a[i];
    for(i=1;i<=m;i++)
        cin>>b[i];
    dp[0][0][0]=1;
    for(i=1;i<=m;i++)
        for(j=0;j<=n;j++)
    {
        for(g=0;g<=a[j];g++)
        {
            dp[i][j][g]=dp[i-1][j][g];
            if (g==b[i]) dp[i][j][g]=max(dp[i][j][g],dp[i-1][j-1][a[j-1]]);
            if (g>b[i])dp[i][j][g]=max(dp[i][j][g],dp[i-1][j][g-b[i]]);
        }
    }
    if (dp[m][n][a[n]])
        cout<<"YES";
    else cout<<"NO";
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 544 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 584 KB Output is correct
6 Correct 1 ms 584 KB Output is correct
7 Correct 2 ms 584 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 760 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 760 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 508 KB Output is correct
3 Correct 2 ms 544 KB Output is correct
4 Correct 2 ms 584 KB Output is correct
5 Correct 2 ms 584 KB Output is correct
6 Correct 1 ms 584 KB Output is correct
7 Correct 2 ms 584 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 760 KB Output is correct
10 Incorrect 2 ms 760 KB Output isn't correct
11 Halted 0 ms 0 KB -