Submission #992427

#	Time	Username	Problem	Language	Result	Execution time	Memory
992427		Yazan_SA	Meetings (IOI18_meetings)	C++17	0 / 100	44 ms	74056 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)
{
    int ac=0;
    for(int i=l; i<=r; i++){
        int mx=mp[min(i,x)][max(i,x)];
        ac+=mx;
    }
    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]=mx;
            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++){
        int mn=1e9;
        for(int x=L[i]; x<=R[i]; x++){
            int ts=sol(x,H,L[i],R[i]);
            if(ts<mn)mn=ts;
        }
        ans.push_back(mn);
    }
    return ans;
}



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

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