oj.uz

Submission #768653

# Submission time Handle Problem Language Result Execution time Memory
768653 2023-06-28T10:35:33 Z mohamedsiu Knapsack (NOI18_knapsack) C++14
100 / 100
 59 ms 3728 KB 
#include<bits/stdc++.h>
//#define int long long
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
using ll = long long;
const int maxn = 2e3 + 5;
const int maxN = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 2e9 + 7;
const int tt = 250;
int dx[] = {0,-1,0,1,-1,1,-1,1};
int dy[] = {-1,0,1,0,-1,1,1,-1};

struct Item
{
    int val;
    int wei;
    int cnt;
};

Item a[maxN];

bool functor(Item p,Item q)
{
    return p.val > q.val;
}

int S,n;

vector<int> vc[maxn];
int dp[2][maxn];

int32_t main()
{
//    freopen("test.inp","r",stdin);
//    freopen("test.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> S >> n;
    for(int i = 1;i <= n;i++)
    {
        cin >> a[i].val >> a[i].wei >> a[i].cnt;
    }

    sort(a + 1,a + n + 1,functor);

    for(int i = 1;i <= n;i++)
    {
        while(vc[a[i].wei].size() < (S/a[i].wei) && a[i].cnt > 0)
        {
            vc[a[i].wei].push_back(a[i].val);
            a[i].cnt--;
        }
    }

    dp[0][0] = 0;

    for(int i = 1;i <= S;i++)
    {
        int now = i%2;
        int pre = 1 - now;
        for(int j = 0;j <= S;j++)
        {
            dp[now][j] = dp[pre][j];
            int cnt = 0;
            int sum = 0;
            for(int k: vc[i])
            {
                cnt++;
                sum += k;
                if(cnt*i > j) break;
                dp[now][j] = max(dp[now][j],dp[pre][j - cnt*i] + sum);
            }
        }
    }

    cout << dp[S%2][S];
}

Compilation message

knapsack.cpp: In function 'int32_t main()':
knapsack.cpp:52:35: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   52 |         while(vc[a[i].wei].size() < (S/a[i].wei) && a[i].cnt > 0)
      |               ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 5 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 340 KB Output is correct
9 Correct 4 ms 340 KB Output is correct
10 Correct 4 ms 392 KB Output is correct
11 Correct 4 ms 392 KB Output is correct
12 Correct 4 ms 392 KB Output is correct
13 Correct 4 ms 340 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 6 ms 392 KB Output is correct
17 Correct 4 ms 340 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 4 ms 388 KB Output is correct
21 Correct 7 ms 340 KB Output is correct
22 Correct 7 ms 388 KB Output is correct
23 Correct 5 ms 392 KB Output is correct
24 Correct 5 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 8 ms 340 KB Output is correct
27 Correct 7 ms 340 KB Output is correct
28 Correct 7 ms 340 KB Output is correct
29 Correct 5 ms 340 KB Output is correct
30 Correct 8 ms 340 KB Output is correct
31 Correct 8 ms 384 KB Output is correct
32 Correct 8 ms 340 KB Output is correct
33 Correct 8 ms 400 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 23 ms 2472 KB Output is correct
36 Correct 31 ms 2852 KB Output is correct
37 Correct 30 ms 2600 KB Output is correct
38 Correct 30 ms 2892 KB Output is correct
39 Correct 33 ms 3664 KB Output is correct
40 Correct 59 ms 3728 KB Output is correct
41 Correct 39 ms 2920 KB Output is correct
42 Correct 38 ms 2892 KB Output is correct
43 Correct 44 ms 2964 KB Output is correct
44 Correct 44 ms 2852 KB Output is correct
45 Correct 34 ms 3604 KB Output is correct
46 Correct 26 ms 3488 KB Output is correct
47 Correct 35 ms 3560 KB Output is correct
48 Correct 40 ms 3604 KB Output is correct
49 Correct 26 ms 3404 KB Output is correct
50 Correct 41 ms 3572 KB Output is correct