제출 #992437

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
992437		Yazan_SA	모임들 (IOI18_meetings)	C++14	0 / 100	55 ms	74016 KiB

meetings

#include "bits/stdc++.h"
using namespace std;

vector<vector<int>>mp(3005,vector<int>(3005));

int sol(int x, vector<int> &h, int l, int r)
{
    long long ac=0;
    for(int i=l; i<=r; i++){
        ac+=mp[i][x];
    }
    return ac;
}

void init(vector<int> &h, int n)
{
    for(int i=0; i<n; i++){
        int mx=0;
        for(int j=i; j<n; j++){
            mx=max(mx,h[j]);
            mp[i][j]=mp[j][i]=mx;
        }
    }
}

std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L, std::vector<int> R)
{
    vector<long long>ans;
    int n=(int)H.size(),q=(int)L.size();
    assert(n*n*q<1e8);
    init(H,n);
    for(int i=0; i<q; i++){
        long long mn=1e18; 
        for(int x=L[i]; x<=R[i]; x++){
            long long ts=sol(x,H,L[i],R[i]);
           mn=min(ts,mn);
        }
        ans.push_back(mn);
    }
    return ans;
}



// signed main(){
//     for(auto c:minimum_costs({1000000000,1000000000,1000000000,1000000000,1000000000,1000000000,1000000000,1000000000,1000000000,1000000000},{0,3},{5,8}))cout<<c<<' ';
// }

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