oj.uz

Submission #501936

# Submission time Handle Problem Language Result Execution time Memory
501936 2022-01-04T20:06:26 Z alexdd Knapsack (NOI18_knapsack) C++17
100 / 100
 134 ms 3752 KB 
#include<iostream>
#include<algorithm>
using namespace std;
struct element
{
    int v,w,k;
};
element num[1000001],newv[1000001];
int dp[1000001],dp2[1000001];
bool fr[2001];
bool cmp(element x, element y)
{
    if(x.w<y.w)
        return 1;
    if(y.w<x.w)
        return 0;
    if(x.v<y.v)
        return 0;
    if(y.v<x.v)
        return 1;
    return 0;
}
int main()
{
    int s,n;
    cin>>s>>n;
    for(int i=0;i<n;i++)
    {
        cin>>num[i].v>>num[i].w>>num[i].k;
        fr[num[i].w]=1;
    }
    sort(num,num+n,cmp);
    int poz=0,cnt=0;
    bool bl=0;
    for(int i=0;i<n;i++)
    {
        if(i==0 || num[i].w!=num[i-1].w)
        {
            cnt=0;
            bl=0;
            for(int j=1;j<=num[i].k;j++)
            {
                if(cnt+1>s/num[i].w)
                    break;
                cnt++;
                poz++;
                newv[poz]=num[i];
            }
        }
        else
        {
            if(cnt+1>s/num[i].w)
                continue;
            for(int j=1;j<=num[i].k;j++)
            {
                if(cnt+1>s/num[i].w)
                    break;
                cnt++;
                poz++;
                newv[poz]=num[i];
            }
        }
    }
    for(int i=1;i<=poz;i++)
    {
        for(int j=0;j<=s;j++)
        {
            if(j+newv[i].w>s)
                continue;
            dp2[j+newv[i].w]=max(dp2[j+newv[i].w], dp[j]+newv[i].v);
        }
        for(int j=1;j<=s;j++)
        {
            dp[j]=dp2[j];
        }
    }
    int maxim=-1;
    for(int i=1;i<=s;i++)
    {
        if(dp[i]>maxim)
            maxim=dp[i];
    }
    cout<<maxim;
}

Compilation message

knapsack.cpp: In function 'int main()':
knapsack.cpp:34:10: warning: variable 'bl' set but not used [-Wunused-but-set-variable]
   34 |     bool bl=0;
      |          ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 204 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 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 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 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 2 ms 296 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 324 KB Output is correct
34 Correct 1 ms 272 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 5 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 2 ms 296 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 2 ms 324 KB Output is correct
34 Correct 1 ms 272 KB Output is correct
35 Correct 64 ms 2476 KB Output is correct
36 Correct 78 ms 2760 KB Output is correct
37 Correct 81 ms 2500 KB Output is correct
38 Correct 84 ms 2796 KB Output is correct
39 Correct 100 ms 3536 KB Output is correct
40 Correct 134 ms 3752 KB Output is correct
41 Correct 93 ms 2820 KB Output is correct
42 Correct 98 ms 2908 KB Output is correct
43 Correct 124 ms 2892 KB Output is correct
44 Correct 107 ms 2996 KB Output is correct
45 Correct 99 ms 3524 KB Output is correct
46 Correct 95 ms 3488 KB Output is correct
47 Correct 101 ms 3564 KB Output is correct
48 Correct 112 ms 3560 KB Output is correct
49 Correct 83 ms 3284 KB Output is correct
50 Correct 111 ms 3480 KB Output is correct