제출 #288301

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
288301		andrew	모임들 (IOI18_meetings)	C++17	19 / 100	4081 ms	786436 KiB

meetings

#include <bits/stdc++.h>
#include "meetings.h"

#define fi first
#define se second
#define p_b push_back
#define m_p make_pair
#define sz(x) (int)x.size()
#define pii pair <int, int>
#define all(x) x.begin(),x.end()

using namespace std;
typedef long long ll;
const ll inf = 1e18;

vector<ll> minimum_costs(vector<int> H, vector<int> l, vector<int> r) {
    int n = sz(H), q = sz(l);
    vector <ll> ans(q);
    vector < vector <ll> > pre_calc(n, vector <ll> (n, 0));
    for(int x = 0; x < n; x++){
        int mx = H[x];
        ll sc = 0;
        for(int j = x; j < n; j++){
            mx = max(mx, H[j]);
            sc += mx;
            pre_calc[x][j] = sc;
        }
        mx = H[x];
        sc = 0;
        for(int j = x; j >= 0; j--){
            mx = max(mx, H[j]);
            sc += mx;
            pre_calc[x][j] = sc;
        }
    }
    for(int i = 0; i < q; i++){
        ans[i] = pre_calc[l[i]][r[i]];
        for(int x = l[i] + 1; x <= r[i]; x++){
            ans[i] = min(ans[i], pre_calc[x - 1][l[i]] + pre_calc[x][r[i]]);
        }
    }
    return ans;
}

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