oj.uz

Submission #446051

# Submission time Handle Problem Language Result Execution time Memory
446051 2021-07-20T14:50:14 Z MaisyDoge13 Knapsack (NOI18_knapsack) C++17
73 / 100
 892 ms 262148 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <cmath>
#include <algorithm>
#include <array>
#include <set>
#include <climits>
#include <map>
#include <memory>
#include <string>
#include <deque>
#include <queue>
#include <stack>
using namespace std;

#define input "knapsack.in"
#define output "knapsack.out"
#define int long long
#define double long double
typedef tuple<double, int, int, int> item;
int S, n;
vector<item> items;
vector<vector<int>> dp;
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen(input, "r", stdin);
    //freopen(output, "w", stdout);
    cin >> S >> n;
    dp.resize(S+1, vector<int>(n+1, 0));
    items.reserve(n);
    for (int i=0;i<n;i++) {
        int val, weight, amt;
        cin >> val >> weight >> amt;
        items.push_back({(double)(val)/weight, val, weight, amt});
    }
    sort(items.begin(), items.end(), [](item& a, item& b) -> bool {
        return get<0>(a)<get<0>(b);
    });
    /* for (int i=0;i<n;i++) cout << get<0>(items[i]) << ' ' << get<1>(items[i]) <<
    ' ' << get<2>(items[i]) << ' ' << get<3>(items[i]) << endl; */
    for (int i=0;i<n;i++) dp[get<2>(items[i])][i+1]=get<1>(items[i]);
    for (int s=1;s<=S;s++) {
        for (int i=1;i<=n;i++) {
            dp[s][i]=max(dp[s-1][i], dp[s][i]);
            int amt=get<3>(items[i-1]), wt=get<2>(items[i-1]), val=get<1>(items[i-1]);
            for (int k=0;k<=s && k/wt<=amt;k+=wt) {
                int used=k/wt*val;
                dp[s][i]=max(dp[s][i], used+dp[s-k][i-1]);
            }
        }
    }
    cout << dp[S][n] << endl;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 6 ms 1868 KB Output is correct
3 Correct 5 ms 1868 KB Output is correct
4 Correct 3 ms 1868 KB Output is correct
5 Correct 2 ms 1868 KB Output is correct
6 Correct 3 ms 1868 KB Output is correct
7 Correct 3 ms 1868 KB Output is correct
8 Correct 3 ms 1868 KB Output is correct
9 Correct 3 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 6 ms 1868 KB Output is correct
3 Correct 5 ms 1868 KB Output is correct
4 Correct 3 ms 1868 KB Output is correct
5 Correct 2 ms 1868 KB Output is correct
6 Correct 3 ms 1868 KB Output is correct
7 Correct 3 ms 1868 KB Output is correct
8 Correct 3 ms 1868 KB Output is correct
9 Correct 3 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 15 ms 1924 KB Output is correct
13 Correct 4 ms 1868 KB Output is correct
14 Correct 2 ms 1868 KB Output is correct
15 Correct 2 ms 1868 KB Output is correct
16 Correct 4 ms 1868 KB Output is correct
17 Correct 5 ms 1868 KB Output is correct
18 Correct 4 ms 1920 KB Output is correct
19 Correct 4 ms 1868 KB Output is correct
20 Correct 4 ms 1868 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 6 ms 1868 KB Output is correct
7 Correct 5 ms 1868 KB Output is correct
8 Correct 3 ms 1868 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct
11 Correct 3 ms 1868 KB Output is correct
12 Correct 3 ms 1868 KB Output is correct
13 Correct 3 ms 1868 KB Output is correct
14 Correct 3 ms 1868 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 15 ms 1924 KB Output is correct
17 Correct 4 ms 1868 KB Output is correct
18 Correct 2 ms 1868 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 4 ms 1868 KB Output is correct
21 Correct 5 ms 1868 KB Output is correct
22 Correct 4 ms 1920 KB Output is correct
23 Correct 4 ms 1868 KB Output is correct
24 Correct 4 ms 1868 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 892 ms 1988 KB Output is correct
27 Correct 5 ms 1868 KB Output is correct
28 Correct 2 ms 1868 KB Output is correct
29 Correct 3 ms 1964 KB Output is correct
30 Correct 9 ms 1964 KB Output is correct
31 Correct 3 ms 1868 KB Output is correct
32 Correct 4 ms 1996 KB Output is correct
33 Correct 4 ms 1924 KB Output is correct
34 Correct 4 ms 1868 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 6 ms 1868 KB Output is correct
7 Correct 5 ms 1868 KB Output is correct
8 Correct 3 ms 1868 KB Output is correct
9 Correct 2 ms 1868 KB Output is correct
10 Correct 3 ms 1868 KB Output is correct
11 Correct 3 ms 1868 KB Output is correct
12 Correct 3 ms 1868 KB Output is correct
13 Correct 3 ms 1868 KB Output is correct
14 Correct 3 ms 1868 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 15 ms 1924 KB Output is correct
17 Correct 4 ms 1868 KB Output is correct
18 Correct 2 ms 1868 KB Output is correct
19 Correct 2 ms 1868 KB Output is correct
20 Correct 4 ms 1868 KB Output is correct
21 Correct 5 ms 1868 KB Output is correct
22 Correct 4 ms 1920 KB Output is correct
23 Correct 4 ms 1868 KB Output is correct
24 Correct 4 ms 1868 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 892 ms 1988 KB Output is correct
27 Correct 5 ms 1868 KB Output is correct
28 Correct 2 ms 1868 KB Output is correct
29 Correct 3 ms 1964 KB Output is correct
30 Correct 9 ms 1964 KB Output is correct
31 Correct 3 ms 1868 KB Output is correct
32 Correct 4 ms 1996 KB Output is correct
33 Correct 4 ms 1924 KB Output is correct
34 Correct 4 ms 1868 KB Output is correct
35 Correct 57 ms 6524 KB Output is correct
36 Runtime error 117 ms 262148 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -