Submission #74977

#	Time	Username	Problem	Language	Result	Execution time	Memory
74977		rekt_n00b	모임들 (IOI18_meetings)	C++14	19 / 100	685 ms	398824 KiB

meetings

#include "meetings.h"
using namespace std;

const int N = 5000;

long long costs[N][N];

std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,
                                     std::vector<int> R) {
    int n = H.size(), q = (int) L.size();
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            costs[i][j] = 0;
        }
    }
    for (int i = 0; i < n; i++) {
        costs[i][i] = H[i];
        {
            int mx = H[i];
            for (int j = i - 1; j >= 0; j--) {
                mx = max(mx, H[j]);
                costs[i][j] = costs[i][j + 1] + mx;
            }
        }
        {
            int mx = H[i];
            for (int j = i + 1; j < n; j++) {
                mx = max(mx, H[j]);
                costs[i][j] = costs[i][j - 1] + mx;
            }
        }
    }
    vector<long long> ans(q);
    for (int i = 0; i < q; i++) {
        ans[i] = 1e18;
        for (int k = L[i]; k <= R[i]; k++) {
            ans[i] = min(ans[i], costs[k][L[i]] + costs[k][R[i]] - H[k]);
        }
    }
    return ans;
}

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40