Submission #490673

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
490673	2021-11-28T13:26:58 Z	CyberSleeper	Knapsack (NOI18_knapsack)	C++14	100 / 100	57 ms	3916 KB

knapsack

#include <bits/stdc++.h>
#define fastio      ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define debug(x)    cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl
#define fi          first
#define se          second
#define mp          make_pair
#define pb          push_back
#define ll          long long
#define ld          long double
#define pii         pair<int, int>
#define pll         pair<ll, ll>
#define ar3         array<int, 3>
#define nl          '\n'
#define tb          '\t'
#define sp          ' '
using namespace std;

const int MX=100005, MOD=1e9+7, BLOCK=500, INF=2e9+7;
const ll INFF=1e18+7;
const ld ERR=1e-7, pi=3.14159265358979323846;

int S, N, DP[2][2005];
vector<pii> A[MX];

int main(){
    fastio;
    cin >> S >> N;
    for(int i=1, v, w, k; i<=N; i++){
        cin >> v >> w >> k;
        A[w].pb({v, k});
    }
    for(int i=1; i<=S; i++)
        DP[0][i]=-INF;
    DP[0][0]=0;
    for(int i=1; i<=S; i++){
        sort(A[i].begin(), A[i].end(), greater<pii>());
        int now=i%2, bef=now^1;
        for(int j=1; j<=S; j++)
            DP[now][j]=-INF;
        DP[now][0]=0;
        for(int j=0; j<=S; j++){
            int skor=DP[bef][j], idx=0, used=0, slot=j;
            while((idx<A[i].size()) && (i+slot)<=S){
                skor+=A[i][idx].fi;
                slot+=i;
                DP[now][slot]=max(DP[now][slot], skor);
                used++;
                if(used>=A[i][idx].se){
                    idx++;
                    used=0;
                }
            }
            DP[now][j]=max(DP[bef][j], DP[now][j]);
        }
    }
    N%=2;
    for(int i=0; i<S; i++)
        DP[S%2][S]=max(DP[S%2][S], DP[S%2][i]);
    cout << DP[S%2][S] << nl;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |             while((idx<A[i].size()) && (i+slot)<=S){
      |                    ~~~^~~~~~~~~~~~

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2636 KB	Output is correct
2	Correct	4 ms	2636 KB	Output is correct
3	Correct	5 ms	2676 KB	Output is correct
4	Correct	4 ms	2636 KB	Output is correct

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2636 KB	Output is correct
2	Correct	4 ms	2636 KB	Output is correct
3	Correct	5 ms	2676 KB	Output is correct
4	Correct	4 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	8 ms	2676 KB	Output is correct
7	Correct	7 ms	2676 KB	Output is correct
8	Correct	7 ms	2636 KB	Output is correct
9	Correct	7 ms	2676 KB	Output is correct
10	Correct	7 ms	2636 KB	Output is correct
11	Correct	7 ms	2636 KB	Output is correct
12	Correct	7 ms	2636 KB	Output is correct
13	Correct	7 ms	2676 KB	Output is correct
14	Correct	8 ms	2636 KB	Output is correct
15	Correct	1 ms	2636 KB	Output is correct
16	Correct	11 ms	2636 KB	Output is correct
17	Correct	9 ms	2636 KB	Output is correct
18	Correct	7 ms	2636 KB	Output is correct
19	Correct	7 ms	2636 KB	Output is correct
20	Correct	7 ms	2636 KB	Output is correct
21	Correct	7 ms	2636 KB	Output is correct
22	Correct	10 ms	2636 KB	Output is correct
23	Correct	7 ms	2636 KB	Output is correct
24	Correct	7 ms	2676 KB	Output is correct
25	Correct	1 ms	2636 KB	Output is correct
26	Correct	9 ms	2636 KB	Output is correct
27	Correct	7 ms	2676 KB	Output is correct
28	Correct	6 ms	2636 KB	Output is correct
29	Correct	7 ms	2680 KB	Output is correct
30	Correct	8 ms	2636 KB	Output is correct
31	Correct	7 ms	2636 KB	Output is correct
32	Correct	7 ms	2636 KB	Output is correct
33	Correct	8 ms	2636 KB	Output is correct
34	Correct	7 ms	2636 KB	Output is correct

Subtask #5
27.0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	2636 KB	Output is correct
2	Correct	4 ms	2636 KB	Output is correct
3	Correct	5 ms	2676 KB	Output is correct
4	Correct	4 ms	2636 KB	Output is correct
5	Correct	2 ms	2636 KB	Output is correct
6	Correct	8 ms	2676 KB	Output is correct
7	Correct	7 ms	2676 KB	Output is correct
8	Correct	7 ms	2636 KB	Output is correct
9	Correct	7 ms	2676 KB	Output is correct
10	Correct	7 ms	2636 KB	Output is correct
11	Correct	7 ms	2636 KB	Output is correct
12	Correct	7 ms	2636 KB	Output is correct
13	Correct	7 ms	2676 KB	Output is correct
14	Correct	8 ms	2636 KB	Output is correct
15	Correct	1 ms	2636 KB	Output is correct
16	Correct	11 ms	2636 KB	Output is correct
17	Correct	9 ms	2636 KB	Output is correct
18	Correct	7 ms	2636 KB	Output is correct
19	Correct	7 ms	2636 KB	Output is correct
20	Correct	7 ms	2636 KB	Output is correct
21	Correct	7 ms	2636 KB	Output is correct
22	Correct	10 ms	2636 KB	Output is correct
23	Correct	7 ms	2636 KB	Output is correct
24	Correct	7 ms	2676 KB	Output is correct
25	Correct	1 ms	2636 KB	Output is correct
26	Correct	9 ms	2636 KB	Output is correct
27	Correct	7 ms	2676 KB	Output is correct
28	Correct	6 ms	2636 KB	Output is correct
29	Correct	7 ms	2680 KB	Output is correct
30	Correct	8 ms	2636 KB	Output is correct
31	Correct	7 ms	2636 KB	Output is correct
32	Correct	7 ms	2636 KB	Output is correct
33	Correct	8 ms	2636 KB	Output is correct
34	Correct	7 ms	2636 KB	Output is correct
35	Correct	25 ms	3788 KB	Output is correct
36	Correct	39 ms	3836 KB	Output is correct
37	Correct	36 ms	3788 KB	Output is correct
38	Correct	35 ms	3676 KB	Output is correct
39	Correct	39 ms	3648 KB	Output is correct
40	Correct	57 ms	3852 KB	Output is correct
41	Correct	44 ms	3788 KB	Output is correct
42	Correct	45 ms	3748 KB	Output is correct
43	Correct	55 ms	3864 KB	Output is correct
44	Correct	51 ms	3788 KB	Output is correct
45	Correct	42 ms	3916 KB	Output is correct
46	Correct	38 ms	3788 KB	Output is correct
47	Correct	41 ms	3832 KB	Output is correct
48	Correct	48 ms	3780 KB	Output is correct
49	Correct	35 ms	3828 KB	Output is correct
50	Correct	49 ms	3632 KB	Output is correct

Submission #490673

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 17.0 / 17.0

Subtask #3 20.0 / 20.0

Subtask #4 24.0 / 24.0

Subtask #5 27.0 / 27.0

Subtask #1
12.0 / 12.0

Subtask #2
17.0 / 17.0

Subtask #3
20.0 / 20.0

Subtask #4
24.0 / 24.0

Subtask #5
27.0 / 27.0