oj.uz

Submission #574413

# Submission time Handle Problem Language Result Execution time Memory
574413 2022-06-08T13:54:49 Z IWannaHaveAGirlfriend Knapsack (NOI18_knapsack) C++17
100 / 100
 69 ms 4140 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e5, M = 2e3;
vector<int> keep[M + 1];
int v[N + 1], w[N + 1], k[N + 1], id[N + 1], s, n;
long long dp[N + 1];
void read()
{
    cin >> s >> n;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> v[i] >> w[i] >> k[i];
        id[i] = i;
    }
    sort(id + 1, id + n + 1, [&](const int &x, const int &y)
         {
             return v[x] > v[y];
         });
}
void solve()
{
    for (int j = 1; j <= n; ++ j)
    {
        int i = id[j];
        while(k[i]--)
        {
            if (keep[w[i]].size() == s/w[i])
            {
                break;
            }
            keep[w[i]].push_back(v[i]);
        }
    }
    for (int i = 1; i <= s; ++ i)
    {
        if (keep[i].empty())
        {
            continue;
        }
        for (int j = s; j >= 0; -- j)
        {
            int x = j;
            long long sum = 0;
            for (int l : keep[i])
            {
                x += i;
                sum += l;
                if (x > s)
                {
                    break;
                }
                dp[x] = max(dp[x], dp[j] + sum);
            }
        }
        for (int j = 1; j <= s; ++ j)
        {
            dp[j] = max(dp[j], dp[j - 1]);
        }
    }
    cout << dp[s];
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:31:35: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |             if (keep[w[i]].size() == s/w[i])
      |                 ~~~~~~~~~~~~~~~~~~^~~~~~~~~
knapsack.cpp: In function 'int main()':
knapsack.cpp:72:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
20.0 / 20.0

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

Subtask #4
24.0 / 24.0

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

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 376 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 4 ms 372 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 4 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 372 KB Output is correct
29 Correct 1 ms 404 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 380 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 420 KB Output is correct
35 Correct 27 ms 2992 KB Output is correct
36 Correct 42 ms 3244 KB Output is correct
37 Correct 36 ms 3024 KB Output is correct
38 Correct 33 ms 3284 KB Output is correct
39 Correct 41 ms 4044 KB Output is correct
40 Correct 69 ms 4140 KB Output is correct
41 Correct 56 ms 3352 KB Output is correct
42 Correct 62 ms 3328 KB Output is correct
43 Correct 64 ms 3284 KB Output is correct
44 Correct 61 ms 3376 KB Output is correct
45 Correct 40 ms 3912 KB Output is correct
46 Correct 26 ms 3756 KB Output is correct
47 Correct 41 ms 4024 KB Output is correct
48 Correct 53 ms 4104 KB Output is correct
49 Correct 25 ms 3668 KB Output is correct
50 Correct 46 ms 3876 KB Output is correct