Submission #292578

#	Time	Username	Problem	Language	Result	Execution time	Memory
292578		AKaan37	Meetings (IOI18_meetings)	C++17	19 / 100	927 ms	597600 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 5003;
const lo mod = 1000000007;

lo n,t,PS[li][li],ind;
lo cev;
int a[li][li];

std::vector<long long> minimum_costs(vector<int> h,vector<int> l,vector<int> r) {
	t = (int)l.size();
	n=(int)h.size();
	for(int i=0;i<n;i++){
		int mx=0;
		for(int j=i;j>=0;j--){
			mx=max(mx,h[j]);
			a[i][j]=mx;
		}
		mx=0;
		for(int j=i;j<n;j++){
			mx=max(mx,h[j]);
			a[i][j]=mx;
		}
	}
	for(int i=0;i<n;i++){
		ind=i;
		for(int j=0;j<n;j++){
			if(j==0){PS[ind][j]=a[ind][j];continue;}
			PS[ind][j]=PS[ind][j-1]+a[ind][j];
		}
	}
	vector<lo> v;
	for(int i=0;i<t;i++){
		cev=inf;
		for(int j=l[i];j<=r[i];j++){
			ind=j;
			lo at=0,at1=0;
			if(l[i]<=j)at=PS[ind][j]-(l[i]!=0?PS[ind][l[i]-1]:0);
			if(j+1<=r[i])at1=PS[ind][r[i]]-(j+1!=0?PS[ind][j]:0);
			cev=min(cev,at+at1);
		}
		v.pb(cev);
	}
	return v;
}

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