oj.uz

답안 #14697

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
14697 2015-06-10T06:56:00 Z ansol4328 앱 (KOI13_app) C++
21 / 21
 4 ms 5068 KB 
#include<stdio.h>
#include<stdlib.h>

int dp[102][10002];

int main()
{
    int i, j, n, need, m[102][4];

    scanf("%d %d",&n,&need);
    for(i=1 ; i<=n ; i++) scanf("%d",&m[i][1]);
    for(i=1 ; i<=n ; i++) scanf("%d",&m[i][2]);
    for(i=1 ; i<=n ; i++)
    {
        for(j=1 ; j<=10000 ; j++) dp[i][j]=dp[i-1][j];
        for(j=1 ; j<=10000 ; j++)
        {
            if(j-m[i][2]>=0)
            {
                if(dp[i][j]<dp[i-1][j-m[i][2]]+m[i][1]) dp[i][j]=dp[i-1][j-m[i][2]]+m[i][1];
            }
        }
    }
    for(j=1 ; j<=10000 ; j++)
    {
        for(i=1 ; i<=n ; i++)
        {
            if(dp[i][j]>=need)
            {
                printf("%d",j);
                exit(1);
            }
        }
    }
    return 0;
}

Subtask #1
3.15 / 3.15

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5068 KB Output is correct
2 Correct 0 ms 5068 KB Output is correct
3 Correct 0 ms 5068 KB Output is correct
4 Correct 0 ms 5068 KB Output is correct
5 Correct 0 ms 5068 KB Output is correct
6 Correct 0 ms 5068 KB Output is correct

Subtask #2
3.15 / 3.15

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5068 KB Output is correct
2 Correct 0 ms 5068 KB Output is correct
3 Correct 0 ms 5068 KB Output is correct
4 Correct 0 ms 5068 KB Output is correct
5 Correct 0 ms 5068 KB Output is correct

Subtask #3
3.15 / 3.15

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5068 KB Output is correct
2 Correct 0 ms 5068 KB Output is correct
3 Correct 2 ms 5068 KB Output is correct
4 Correct 2 ms 5068 KB Output is correct
5 Correct 2 ms 5068 KB Output is correct
6 Correct 2 ms 5068 KB Output is correct

Subtask #4
3.15 / 3.15

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5068 KB Output is correct
2 Correct 0 ms 5068 KB Output is correct
3 Correct 0 ms 5068 KB Output is correct
4 Correct 0 ms 5068 KB Output is correct
5 Correct 0 ms 5068 KB Output is correct
6 Correct 0 ms 5068 KB Output is correct

Subtask #5
3.15 / 3.15

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5068 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 0 ms 5068 KB Output is correct
4 Correct 0 ms 5068 KB Output is correct
5 Correct 0 ms 5068 KB Output is correct
6 Correct 0 ms 5068 KB Output is correct

Subtask #6
3.15 / 3.15

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5068 KB Output is correct
2 Correct 3 ms 5068 KB Output is correct
3 Correct 0 ms 5068 KB Output is correct
4 Correct 0 ms 5068 KB Output is correct
5 Correct 0 ms 5068 KB Output is correct
6 Correct 0 ms 5068 KB Output is correct

Subtask #7
2.1 / 2.1

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5068 KB Output is correct
2 Correct 4 ms 5068 KB Output is correct
3 Correct 0 ms 5068 KB Output is correct
4 Correct 4 ms 5068 KB Output is correct