제출 #730039

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
730039		t6twotwo	Meetings (IOI18_meetings)	C++17	19 / 100	2859 ms	786432 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1E18;
vector<ll> minimum_costs(vector<int> H, vector<int> L, vector<int> R) {
    int N = H.size();
    int Q = L.size();
    vector pfs(N, vector<ll>(N + 1));
    for (int i = 0; i < N; i++) {
        vector<int> mx(N);
        mx[i] = H[i];
        for (int j = i - 1; j >= 0; j--) {
            mx[j] = max(mx[j + 1], H[j]);
        }
        for (int j = i + 1; j < N; j++) {
            mx[j] = max(mx[j - 1], H[j]);
        }
        for (int j = 0; j < N; j++) {
            pfs[i][j + 1] = pfs[i][j] + mx[j];
        }
    }
    vector<ll> ans(Q, inf);
    for (int i = 0; i < Q; i++) {
        for (int j = L[i]; j <= R[i]; j++) {
            ans[i] = min(ans[i], pfs[j][R[i] + 1] - pfs[j][L[i]]);
        }
    }
    return ans;
}

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