oj.uz

Submission #703913

# Submission time Handle Problem Language Result Execution time Memory
703913 2023-02-28T20:04:09 Z finn__ Cloud Computing (CEOI18_clo) C++17
100 / 100
 662 ms 1996 KB 
#include <bits/stdc++.h>
using namespace std;

struct Transaction
{
    uint64_t f;
    int64_t c, v;

    bool operator<(Transaction const &t) const
    {
        if (f == t.f)
            return v < 0 && !(t.v < 0);
        return f > t.f;
    }
};

#define N 4000
#define C 51

Transaction t[N];
int64_t dp[N * C];

int main()
{
    size_t n, l = 0;
    cin >> n;

    for (size_t i = 0; i < n; i++)
    {
        cin >> t[l].c >> t[l].f >> t[l].v;
        t[l].v = -t[l].v;
        l++;
    }

    size_t m;
    cin >> m;

    for (size_t i = 0; i < m; i++)
    {
        cin >> t[l].c >> t[l].f >> t[l].v;
        t[l].c = -t[l].c;
        l++;
    }

    sort(t, t + l);
    fill(dp + 1, dp + N * C, INT64_MIN);

    for (size_t i = 0; i < l; i++)
    {
        auto const &[f, c, v] = t[i];

        if (c < 0)
        {
            for (int64_t j = -c; j < N * C; j++)
                if (dp[j] != INT64_MIN)
                    dp[j + c] = max(dp[j + c], dp[j] + v);
        }
        else
        {
            for (int64_t j = N * C - c - 1; j >= 0; j--)
                if (dp[j] != INT64_MIN)
                    dp[j + c] = max(dp[j + c], dp[j] + v);
        }
    }

    int64_t max_value = 0;
    for (size_t i = 0; i < N * C; i++)
        max_value = max(max_value, dp[i]);

    cout << max_value << '\n';
}

Subtask #1
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 15 ms 1896 KB Output is correct
4 Correct 31 ms 1876 KB Output is correct
5 Correct 257 ms 1920 KB Output is correct
6 Correct 269 ms 1996 KB Output is correct
7 Correct 280 ms 1920 KB Output is correct
8 Correct 288 ms 1928 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1876 KB Output is correct
2 Correct 3 ms 1876 KB Output is correct
3 Correct 16 ms 1900 KB Output is correct
4 Correct 16 ms 1900 KB Output is correct
5 Correct 134 ms 1904 KB Output is correct
6 Correct 125 ms 1900 KB Output is correct
7 Correct 292 ms 1928 KB Output is correct
8 Correct 354 ms 1924 KB Output is correct
9 Correct 291 ms 1876 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1892 KB Output is correct
2 Correct 6 ms 1876 KB Output is correct
3 Correct 37 ms 1880 KB Output is correct
4 Correct 26 ms 1880 KB Output is correct
5 Correct 82 ms 1880 KB Output is correct
6 Correct 76 ms 1876 KB Output is correct
7 Correct 69 ms 1884 KB Output is correct
8 Correct 69 ms 1888 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1876 KB Output is correct
2 Correct 4 ms 1892 KB Output is correct
3 Correct 205 ms 1912 KB Output is correct
4 Correct 272 ms 1916 KB Output is correct
5 Correct 551 ms 1964 KB Output is correct
6 Correct 630 ms 1968 KB Output is correct
7 Correct 662 ms 1876 KB Output is correct
8 Correct 613 ms 1964 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1876 KB Output is correct
2 Correct 28 ms 1876 KB Output is correct
3 Correct 140 ms 1896 KB Output is correct
4 Correct 280 ms 1920 KB Output is correct
5 Correct 587 ms 1972 KB Output is correct
6 Correct 600 ms 1964 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 2 ms 1876 KB Output is correct
3 Correct 15 ms 1896 KB Output is correct
4 Correct 31 ms 1876 KB Output is correct
5 Correct 257 ms 1920 KB Output is correct
6 Correct 269 ms 1996 KB Output is correct
7 Correct 280 ms 1920 KB Output is correct
8 Correct 288 ms 1928 KB Output is correct
9 Correct 2 ms 1876 KB Output is correct
10 Correct 3 ms 1876 KB Output is correct
11 Correct 16 ms 1900 KB Output is correct
12 Correct 16 ms 1900 KB Output is correct
13 Correct 134 ms 1904 KB Output is correct
14 Correct 125 ms 1900 KB Output is correct
15 Correct 292 ms 1928 KB Output is correct
16 Correct 354 ms 1924 KB Output is correct
17 Correct 291 ms 1876 KB Output is correct
18 Correct 9 ms 1892 KB Output is correct
19 Correct 6 ms 1876 KB Output is correct
20 Correct 37 ms 1880 KB Output is correct
21 Correct 26 ms 1880 KB Output is correct
22 Correct 82 ms 1880 KB Output is correct
23 Correct 76 ms 1876 KB Output is correct
24 Correct 69 ms 1884 KB Output is correct
25 Correct 69 ms 1888 KB Output is correct
26 Correct 3 ms 1876 KB Output is correct
27 Correct 4 ms 1892 KB Output is correct
28 Correct 205 ms 1912 KB Output is correct
29 Correct 272 ms 1916 KB Output is correct
30 Correct 551 ms 1964 KB Output is correct
31 Correct 630 ms 1968 KB Output is correct
32 Correct 662 ms 1876 KB Output is correct
33 Correct 613 ms 1964 KB Output is correct
34 Correct 4 ms 1876 KB Output is correct
35 Correct 28 ms 1876 KB Output is correct
36 Correct 140 ms 1896 KB Output is correct
37 Correct 280 ms 1920 KB Output is correct
38 Correct 587 ms 1972 KB Output is correct
39 Correct 600 ms 1964 KB Output is correct
40 Correct 156 ms 1900 KB Output is correct
41 Correct 268 ms 1920 KB Output is correct
42 Correct 417 ms 1960 KB Output is correct
43 Correct 650 ms 1964 KB Output is correct
44 Correct 642 ms 1968 KB Output is correct
45 Correct 647 ms 1964 KB Output is correct
46 Correct 279 ms 1876 KB Output is correct
47 Correct 438 ms 1964 KB Output is correct
48 Correct 419 ms 1952 KB Output is correct