oj.uz

Submission #972032

# Submission time Handle Problem Language Result Execution time Memory
972032 2024-04-29T19:01:35 Z 0x34c Cloud Computing (CEOI18_clo) C++17
18 / 100
 462 ms 2068 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define endl '\n'
#define int ll

using namespace std;

struct node
{
    int c, f, v;
};

const int INF = 1e9;

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int N, M;
    cin >> N;

    vector<node> vals;
    int MX_C = 0;
    for (int i = 0; i < N; i++)
    {
        int c, f, v;
        cin >> c >> f >> v;

        vals.push_back({c, f, -v});
        MX_C += c;
    }

    cin >> M;
    for (int i = 0; i < M; i++)
    {
        int c, f, v;
        cin >> c >> f >> v;

        vals.push_back({-c, f, v});
    }

    sort(vals.begin(), vals.end(), [&](node &a, node &b)
         {  if(a.f == b.f) return a.c > b.c; return a.f > b.f; });

    MX_C++;
    int dp[2][MX_C];
    fill_n(&dp[0][0], 2 * MX_C, -INF);

    dp[0][0] = 0;
    int mx = 0, prev = 0, cur = 1;
    for (int i = 0; i < vals.size(); i++)
    {
        for (int c = MX_C - 1; c >= 0; c--)
        {
            dp[cur][c] = dp[prev][c];
            int cores = c - vals[i].c;
            if (0 <= cores && cores < MX_C)
            {
                dp[cur][c] = max(dp[prev][cores] + vals[i].v, dp[cur][c]);
                mx = max(mx, dp[cur][c]);
            }
        }
        swap(cur, prev);
    }
    cout << mx << endl;
}

Compilation message

clo.cpp: In function 'int main()':
clo.cpp:53:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for (int i = 0; i < vals.size(); i++)
      |                     ~~^~~~~~~~~~~~~

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 28 ms 860 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 132 ms 1336 KB Output is correct
8 Incorrect 25 ms 604 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Incorrect 1 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 18.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 9 ms 604 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Incorrect 244 ms 1412 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 27 ms 876 KB Output is correct
4 Correct 6 ms 348 KB Output is correct
5 Correct 462 ms 2004 KB Output is correct
6 Correct 450 ms 2068 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Incorrect 1 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -