oj.uz

Submission #482928

# Submission time Handle Problem Language Result Execution time Memory
482928 2021-10-26T19:22:17 Z Olympia Knapsack (NOI18_knapsack) C++17
12 / 100
 1 ms 204 KB 
#include <cmath>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <cassert>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
using namespace std;
#define ll long long
struct item {
    long long weight;
    long long worth;
    long long cnt;
};
bool comp (item i1, item i2) {
    if (i1.weight == i2.weight) {
        return (i1.worth > i2.worth);
    }
    return (i1.weight < i2.weight);
}
int main() {
    //freopen("hamming.in", "r", stdin);
    long long S, N;
    cin >> S >> N;
    vector<item> items;
    for (int i = 0; i < N; i++) {
        long long wei, wor;
        cin >> wor >> wei;
        long long cnt;
        cin >> cnt;
        items.push_back({wei, wor, cnt});
    }
    sort(items.begin(), items.end(), comp);
    long long dp[S + 1];
    for (int j = 0; j <= S; j++) {
        dp[j] = 0;
    }
    long long myMax = 0;
    long long prev_weight = -1;
    long long soFar = -1;
    for (int i = 1; i <= items.size(); i++) {
        if (items[i - 1].weight == prev_weight) {
            soFar++;
        } else {
            soFar = -1;
            prev_weight = items[i - 1].weight;
        }
        for (int j = S; j >= 0; j--) {
            int cntr = 0;
            while (cntr * items[i - 1].weight <= j && cntr <= items[i - 1].cnt) {
                dp[j] = max(dp[j], dp[j - cntr * items[i - 1].weight] + cntr * items[i - 1].worth);
                cntr++;
                soFar++;
            }
            myMax = max(myMax, dp[j]);
            if (soFar * items[i - 1].weight > S) {
                break;
            }
        }
    }
    cout << myMax << endl;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:46:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<item>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for (int i = 1; i <= items.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
0 / 17.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Halted 0 ms 0 KB -