oj.uz

Submission #544635

# Submission time Handle Problem Language Result Execution time Memory
544635 2022-04-02T14:08:55 Z pokmui9909 앱 (KOI13_app) C++17
21 / 21
 2 ms 2772 KB 
#include <bits/stdc++.h>
using namespace std;

int D[105][10005];
int ar[105][2];

int main()
{
    cin.tie(0); cout.tie(0);
    ios_base::sync_with_stdio(false);

    int n, m; cin >> n >> m;
    int sum = 0;
    for(int i = 1; i <= n; i++)
        cin >> ar[i][0];
    for(int i = 1; i <= n; i++)
    {
        cin >> ar[i][1];
        sum += ar[i][1];
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 0; j <= sum; j++)
        {
            if(j - ar[i][1] < 0)
                D[i][j] = D[i - 1][j];
            else
                D[i][j] = max(D[i - 1][j], D[i - 1][j - ar[i][1]] + ar[i][0]);
        }
    }
    int ans = 0;
    for(;D[n][ans] < m; ans++);
    cout << ans;
}

Subtask #1
3.15 / 3.15

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

Subtask #2
3.15 / 3.15

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

Subtask #3
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 1 ms 716 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 716 KB Output is correct

Subtask #4
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 852 KB Output is correct
3 Correct 1 ms 712 KB Output is correct
4 Correct 1 ms 840 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 468 KB Output is correct

Subtask #5
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2132 KB Output is correct
2 Correct 2 ms 2132 KB Output is correct
3 Correct 2 ms 2516 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #6
3.15 / 3.15

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2004 KB Output is correct
2 Correct 2 ms 1360 KB Output is correct
3 Correct 2 ms 1492 KB Output is correct
4 Correct 2 ms 2260 KB Output is correct
5 Correct 1 ms 1492 KB Output is correct
6 Correct 2 ms 2628 KB Output is correct

Subtask #7
2.1 / 2.1

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2772 KB Output is correct
2 Correct 2 ms 2516 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct