oj.uz

Submission #908875

# Submission time Handle Problem Language Result Execution time Memory
908875 2024-01-17T01:00:56 Z tiwerlol Knapsack (NOI18_knapsack) C++17
100 / 100
 79 ms 35208 KB 
#include <bits/stdc++.h>
using namespace std;

ofstream fout("feast.out");
ifstream fin("feast.in");

#define miauDebug
#ifdef miauDebug
#define mau(x) MIAUMIAU(#x, x)
#else
#define mau(x)
#endif

void MIAUMIAU(const char* var_name, auto var_value) {
    cout << var_name << " = " << var_value << endl;
}

using ll = long long;
const int nM = 1e3+12;

const ll MOD =
1000000007;

ll dp[2001][2001];

void solve() {
    int s, n; cin >> s >> n;
    map<int, vector<pair<int, int>>> v;

    for(int z = 0; z < n; z++)
    {
        int val, g, cnt; cin >> val >> g >> cnt;

        v[g].push_back(make_pair(val, cnt));
    }

    int unde = 1;
    dp[0][0] = 1;
    for(auto &[g, prod] : v)
    {
        sort(prod.begin(), prod.end(), greater<pair<int, int>>());
        for(int i = 0; i <= s; i++)
        {
            dp[unde][i] = dp[unde-1][i];
            ll profit = 0, fol = 0, k = 0, copi = 0, sum = 0;

            while((copi + 1)*g <= i && k < prod.size())
            {
                copi++;
                sum += prod[k].first;
                dp[unde][i] = max(dp[unde][i], dp[unde-1][i- copi*g] + sum);
                fol++;
                if(fol==prod[k].second)
                {
                    fol = 0;
                    k++;
                }
            }
        }
        unde++;
    }
    ll mx = 0;
    for(int z = 0; z <= s; z++)
    {
        mx = max(mx, dp[unde-1][z]);
    }
    cout << mx-1;
}

signed main()
{
    cout.tie(NULL);
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    //cin >> p;
    int tt = 1;// cin >> tt;

    while(tt--)
        solve();
}

/*
5
3 1 6 3
iiiii
*/

Compilation message

knapsack.cpp:14:37: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   14 | void MIAUMIAU(const char* var_name, auto var_value) {
      |                                     ^~~~
knapsack.cpp: In function 'void solve()':
knapsack.cpp:47:42: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |             while((copi + 1)*g <= i && k < prod.size())
      |                                        ~~^~~~~~~~~~~~~
knapsack.cpp:45:16: warning: unused variable 'profit' [-Wunused-variable]
   45 |             ll profit = 0, fol = 0, k = 0, copi = 0, sum = 0;
      |                ^~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 2648 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2648 KB Output is correct
9 Correct 2 ms 2904 KB Output is correct
10 Correct 1 ms 2652 KB Output is correct

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 1 ms 2648 KB Output is correct
13 Correct 2 ms 2904 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 5 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 2572 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 7 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 3 ms 2652 KB Output is correct
31 Correct 1 ms 2652 KB Output is correct
32 Correct 1 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 2 ms 2652 KB Output is correct
35 Correct 22 ms 2288 KB Output is correct
36 Correct 29 ms 2520 KB Output is correct
37 Correct 28 ms 2520 KB Output is correct
38 Correct 28 ms 2720 KB Output is correct
39 Correct 27 ms 3520 KB Output is correct
40 Correct 77 ms 35208 KB Output is correct
41 Correct 58 ms 34384 KB Output is correct
42 Correct 58 ms 34340 KB Output is correct
43 Correct 79 ms 34372 KB Output is correct
44 Correct 72 ms 34224 KB Output is correct
45 Correct 32 ms 8072 KB Output is correct
46 Correct 27 ms 3408 KB Output is correct
47 Correct 39 ms 9940 KB Output is correct
48 Correct 55 ms 20816 KB Output is correct
49 Correct 27 ms 5724 KB Output is correct
50 Correct 53 ms 5488 KB Output is correct