oj.uz

Submission #970770

# Submission time Handle Problem Language Result Execution time Memory
970770 2024-04-27T08:33:58 Z 0x34c Cloud Computing (CEOI18_clo) C++17
0 / 100
 2 ms 1372 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;
};

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

    int N, M;
    cin >> N;

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

        pc[i] = {c, f, v};
    }

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

        qr[i] = {c, f, v};
    }

    sort(pc.begin(), pc.end(), [&](node &a, node &b)
         { return a.f > b.f; });
    sort(qr.begin(), qr.end(), [&](node &a, node &b)
         { return a.f > b.f; });

    int dp[M][N];
    memset(dp, 0, sizeof dp);
    int mx = 0;
    for (int i = 0; i < M; i++)
        for (int j = 0; j < N; j++)
        {
            // skip zakazku
            if (i + 1 < M)
            {
                dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
                mx = max(mx, dp[i + 1][j]);
            }

            // skip pc
            if (j + 1 < N)
            {
                dp[i][j + 1] = max(dp[i][j + 1], dp[i][j]);
                mx = max(mx, dp[i][j + 1]);
            }

            // take next
            if (i + 1 < M && j + 1 < N && qr[i].f <= pc[j].f)
            {
                dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + (qr[i].v - pc[j].v));
                mx = max(mx, dp[i + 1][j + 1]);
            }
        }

    cout << mx << endl;
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
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 Incorrect 2 ms 1372 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -