oj.uz

Submission #671731

# Submission time Handle Problem Language Result Execution time Memory
671731 2022-12-13T15:44:24 Z LittleCube Cloud Computing (CEOI18_clo) C++14
100 / 100
 471 ms 1364 KB 
#include <bits/stdc++.h>
#define ll long long
#define plll tuple<ll, ll, ll>
using namespace std;

ll n, m, dp[100005];
vector<plll> items;

signed main()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int c, f, v;
        cin >> c >> f >> v;
        items.emplace_back(make_tuple(f, c, -v));
    }
    cin >> m;
    for (int i = 1; i <= m; i++)
    {
        int c, f, v;
        cin >> c >> f >> v;
        items.emplace_back(make_tuple(f, -c, v));
    }
    sort(items.begin(), items.end(), greater<>());
    for (int i = 1; i <= n * 50; i++)
        dp[i] = -1e18;
    for (int i = 1; i <= n + m; i++)
    {
        auto [f, c, v] = items[i - 1];
        if (c > 0)
            for (int j = n * 50; j >= c; j--)
                dp[j] = max(dp[j], dp[j - c] + v);
        else
            for (int j = 0; j <= n * 50 + c; j++)
                dp[j] = max(dp[j], dp[j - c] + v);
    }
    ll ans = 0;
    for (int i = 0; i <= n * 50; i++)
        ans = max(ans, dp[i]);
    cout << ans << '\n';
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:30:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   30 |         auto [f, c, v] = items[i - 1];
      |              ^

Subtask #1
18.0 / 18.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 36 ms 688 KB Output is correct
6 Correct 37 ms 704 KB Output is correct
7 Correct 176 ms 1208 KB Output is correct
8 Correct 175 ms 1200 KB Output is correct
9 Correct 172 ms 1160 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 4 ms 416 KB Output is correct
6 Correct 4 ms 316 KB Output is correct
7 Correct 7 ms 440 KB Output is correct
8 Correct 6 ms 432 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 97 ms 960 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 324 ms 1312 KB Output is correct
6 Correct 380 ms 1296 KB Output is correct
7 Correct 364 ms 1300 KB Output is correct
8 Correct 364 ms 1284 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 212 KB Output is correct
3 Correct 24 ms 468 KB Output is correct
4 Correct 70 ms 712 KB Output is correct
5 Correct 322 ms 1308 KB Output is correct
6 Correct 343 ms 1288 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 4 ms 404 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 36 ms 688 KB Output is correct
14 Correct 37 ms 704 KB Output is correct
15 Correct 176 ms 1208 KB Output is correct
16 Correct 175 ms 1200 KB Output is correct
17 Correct 172 ms 1160 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 4 ms 416 KB Output is correct
23 Correct 4 ms 316 KB Output is correct
24 Correct 7 ms 440 KB Output is correct
25 Correct 6 ms 432 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 97 ms 960 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 324 ms 1312 KB Output is correct
31 Correct 380 ms 1296 KB Output is correct
32 Correct 364 ms 1300 KB Output is correct
33 Correct 364 ms 1284 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 24 ms 468 KB Output is correct
37 Correct 70 ms 712 KB Output is correct
38 Correct 322 ms 1308 KB Output is correct
39 Correct 343 ms 1288 KB Output is correct
40 Correct 22 ms 448 KB Output is correct
41 Correct 62 ms 596 KB Output is correct
42 Correct 217 ms 1096 KB Output is correct
43 Correct 377 ms 1312 KB Output is correct
44 Correct 361 ms 1316 KB Output is correct
45 Correct 471 ms 1364 KB Output is correct
46 Correct 90 ms 792 KB Output is correct
47 Correct 192 ms 1088 KB Output is correct
48 Correct 216 ms 1084 KB Output is correct