제출 #285406

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

meetings

#include <bits/stdc++.h>

using namespace std;
const int c=5002;
vector<long long> sz;
long long n, q, maxi[c][c], kom[c][c];
vector<long long> minimum_costs(vector<int> h, vector<int> l, vector<int> r) {
    n=h.size(), q=l.size();
    for (int i=0; i<n; i++) maxi[i][i]=h[i];
    for (int i=0; i<n; i++) for (int j=i+1; j<n; j++) maxi[i][j]=max(maxi[i][j-1], maxi[j][j]);
    for (int i=0; i<n; i++) for (int j=0; j<i; j++) maxi[i][j]=maxi[j][i];
    /*for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) cout << maxi[i][j] << " ";
        cout << "\n";
    }*/
    for (int i=0; i<n; i++) for (int j=1; j<=n; j++) kom[i][j]=kom[i][j-1]+maxi[i][j-1];
    for (int i=0; i<q; i++) {
        long long ans=1e18;
        for (int j=l[i]; j<=r[i]; j++) {
            ans=min(ans, kom[j][r[i]+1]-kom[j][l[i]]);
        }
        sz.push_back(ans);
    }
    return sz;
}

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