제출 #294312

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
294312		Muhammetali	Meetings (IOI18_meetings)	C++11	19 / 100	609 ms	294776 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
template<class T>bool tmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool tmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int tree[5005][5005];
ll jem[5005][5005];
vl C;
std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,std::vector<int> R)
{
	for (int i=0;i<sz(H);i++)
	{
		int mx=0;
		for (int j=i;j>=0;j--)
		{
			mx=max(mx,H[j]);
			tree[i][j]=mx;
		}
		mx=0;
		for (int j=i;j<sz(H);j++)
		{
			mx=max(mx,H[j]);
			tree[i][j]=mx;
		}
	}
	for (int i=0;i<sz(H);i++)
	{
		jem[i][0]=tree[i][0];
		for (int j=1;j<sz(H);j++)
		{
			jem[i][j]=jem[i][j-1]+tree[i][j];
		}
	}
	for (int i=0;i<sz(L);i++)
	{
		ll res=1000000000000000000;
		if (L[i]==0) for (int j=L[i];j<=R[i];j++) res=min(res,jem[j][R[i]]);
		else for (int j=L[i];j<=R[i];j++) res=min(res,jem[j][R[i]]-jem[j][L[i]-1]);
		C.pb(res);
	}
	return C;
}

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