제출 #788957

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788957		codergirl	Knapsack (NOI18_knapsack)	C++14	73 / 100	1062 ms	16000 KiB

knapsack

#include <iostream>
#include <cmath>

int main() {
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    
    long v[1000000], w[1000000]; int s, n; std::cin >> s >> n;
    
    long counter = 0, t; int x, y, z;
    for (int i=0; i < n; i++) {
        std::cin >> y >> z >> x;
        for (int j=0; j < 30; j++) {
            if (x == 0) break;
            t = std::pow(2, j);
            
            if (z*t > s) break;
            
            if (x < t) {
                v[counter] = y*x, w[counter++] = z*x; break;
            }
            
            v[counter] = y*t, w[counter++] = z*t; x -= t;
        }
    }
    
    long arr[2][s+1];
    for (long j=0; j <= s; j++) arr[0][j] = 0;
    arr[1][0] = 0;
    
    int a=0, b=1;
    for (long i=1; i <= counter; i++) {
        a = 1-a, b = 1-b;
        for (long j=1; j <= s; j++) arr[a][j] = (j-w[i-1] >= 0) ? std::max(arr[b][j-w[i-1]]+v[i-1], arr[b][j]) : arr[b][j];
    }
    
    std::cout << arr[a][s] << '\n';
}

• Subtask 1: 12 / 12
• Subtask 2: 17 / 17
• Subtask 3: 20 / 20
• Subtask 4: 24 / 24
• Subtask 5: 0 / 27