제출 #1096596

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1096596		dosts	Knapsack (NOI18_knapsack)	C++17	100 / 100	34 ms	1932 KiB

knapsack

//SİGUSMUS SEFEROĞLU
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+50,inf = 2e9;

const int BUF_SZ=1<<15;
char buf[BUF_SZ];
int pos;
int len;
inline char next_char() {
    if (pos == len) {
        pos = 0;
        len = (int)fread(buf, 1, BUF_SZ, stdin);
        if (!len) { return EOF; }
    }
    return buf[pos++];
}

inline int read_int() {
    int x;
    char ch=next_char();
    x = ch - '0';
    while (isdigit(ch = next_char())) { x = x * 10 + (ch - '0'); }
    return x;
}

int alloc[2008];
int ptr = 0;
int sz = 0;
                             
int v[N],k[N];
int sk[2008],sk1[2008];
vector<int>poss[2008];
signed main() { 
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int w=read_int(),n=read_int();
    int c;
    for (int i=1;i<=n;i++) v[i]=read_int(),c=read_int(),k[i]=read_int(),poss[c].push_back(i);
    int*sack=sk,*sack2=sk1;
    for (int i=0;i<=w+1;i++) sack2[i] = -inf;
    sack2[0] = 0;
    for (int ii=1;ii<2008;ii++) {
        int added=0;
        sort(poss[ii].begin(),poss[ii].end(),[&](const int x,const int y) {
            return v[x] > v[y];
        });
        for(int i:poss[ii]){
            if(w<=added*ii)break;
            added+=k[i];
            bool cool=0;
            for (int jj = 0;jj<ii;jj++) {
                sz = ptr = 0;
                for (int j = jj;j<=w;j+=ii) {
                    if (sz && k[i] < (j-alloc[ptr])/ii) {
                        sz--;
                        ptr++;
                    }
                    while (sz && (j-alloc[ptr+sz-1])/ii*v[i]+sack2[alloc[sz+ptr-1]] <= sack2[j]) {
                        sz--;
                    }
                    alloc[sz+ptr] = j;
                    sz++;
                    sack[j] = (j-alloc[ptr])/ii*v[i]+sack2[alloc[ptr]];
                    cool|=sack[j]!=sack2[j];
                }
            }
            if(!cool)break;
            swap(sack,sack2);
        }
    }
    int ans=0;
    for(int i=0;i<=w;i++)if(ans<sack2[i])ans=sack2[i];
    cout << ans;
}

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