제출 #970777

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
970777		0x34c	Cloud Computing (CEOI18_clo)	C++17	0 / 100	1 ms	1372 KiB

clo

#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 + 1][N + 1];
    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 + 1][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
• Subtask 2: 0 / 18
• Subtask 3: 0 / 18
• Subtask 4: 0 / 18
• Subtask 5: 0 / 18
• Subtask 6: 0 / 10