oj.uz

Submission #12826

# Submission time Handle Problem Language Result Execution time Memory
12826 2015-01-09T07:04:50 Z lingxiang 앱 (KOI13_app) C++
21 / 21
 4 ms 4996 KB 
#include <stdio.h>

int mem[100];
int cost[100];
int d[100][10001];

int main()
{
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    int n, m;
    int i, j;
    int maxcost=0;
    scanf("%d %d", &n, &m);
    for(i=0; i<n; i++)
    {
        scanf(" %d", &mem[i]);
    }
    for(i=0; i<n; i++)
    {
        scanf(" %d", &cost[i]);
        maxcost+=cost[i];
    }
    for(i=0; i<n; i++)
        for(j=0; j<=maxcost; j++)
            d[i][j]=-1;
    d[0][0]=0;
    d[0][cost[0]]=mem[0];
    for(i=1; i<n; i++)
    {
        for(j=0; j<=maxcost; j++)
            d[i][j]=d[i-1][j];
        for(j=cost[i]; j<=maxcost; j++)
        {
            if(d[i-1][j-cost[i]]!=-1 && d[i-1][j]<d[i-1][j-cost[i]]+mem[i])
            {
                d[i][j]=d[i-1][j-cost[i]]+mem[i];
            }
        }
    }
    for(j=0; j<=maxcost; j++)
    {
        if(d[n-1][j]>=m)
        {
            printf("%d", j);
            break;
        }
    }
    return 0;
}

Subtask #1
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4996 KB Output is correct
2 Correct 0 ms 4996 KB Output is correct
3 Correct 0 ms 4996 KB Output is correct
4 Correct 0 ms 4996 KB Output is correct
5 Correct 0 ms 4996 KB Output is correct
6 Correct 0 ms 4996 KB Output is correct

Subtask #2
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4996 KB Output is correct
2 Correct 0 ms 4996 KB Output is correct
3 Correct 0 ms 4996 KB Output is correct
4 Correct 0 ms 4996 KB Output is correct
5 Correct 0 ms 4996 KB Output is correct

Subtask #3
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4996 KB Output is correct
2 Correct 0 ms 4996 KB Output is correct
3 Correct 0 ms 4996 KB Output is correct
4 Correct 0 ms 4996 KB Output is correct
5 Correct 0 ms 4996 KB Output is correct
6 Correct 0 ms 4996 KB Output is correct

Subtask #4
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4996 KB Output is correct
2 Correct 0 ms 4996 KB Output is correct
3 Correct 0 ms 4996 KB Output is correct
4 Correct 0 ms 4996 KB Output is correct
5 Correct 0 ms 4996 KB Output is correct
6 Correct 0 ms 4996 KB Output is correct

Subtask #5
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4996 KB Output is correct
2 Correct 0 ms 4996 KB Output is correct
3 Correct 0 ms 4996 KB Output is correct
4 Correct 0 ms 4996 KB Output is correct
5 Correct 0 ms 4996 KB Output is correct
6 Correct 0 ms 4996 KB Output is correct

Subtask #6
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4996 KB Output is correct
2 Correct 0 ms 4996 KB Output is correct
3 Correct 0 ms 4996 KB Output is correct
4 Correct 0 ms 4996 KB Output is correct
5 Correct 0 ms 4996 KB Output is correct
6 Correct 0 ms 4996 KB Output is correct

Subtask #7
2.1 / 2.1

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4996 KB Output is correct
2 Correct 0 ms 4996 KB Output is correct
3 Correct 4 ms 4996 KB Output is correct
4 Correct 0 ms 4996 KB Output is correct