Submission #424939

#	Time	Username	Problem	Language	Result	Execution time	Memory
424939		Pbezz	모임들 (IOI18_meetings)	C++14	19 / 100	640 ms	383420 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;

const ll MAXN = 5005;
const ll INF = 1e16+7;

ll cost[MAXN][MAXN];

std::vector<long long> minimum_costs(std::vector<int>H,std::vector<int>L,
                                     std::vector<int> R) {

	int Q = L.size(),n=H.size(),i,j,maxi;
	ll k;
  std::vector<long long> C(Q);

	for(i=0;i<n;i++){
	cost[i][i]=0;	maxi=H[i];
	for(j=i+1;j<n;j++){
	maxi=max(maxi,H[j]);
	cost[i][j]=cost[i][j-1]+maxi;
	}
}

	for(i=1;i<n;i++){maxi=H[i];
	for(j=i-1;j>=0;j--){
	maxi=max(maxi,H[j]);
	cost[i][j]=cost[i][j+1]+maxi;
	}
}
ll ans=INF;
	for(i=0;i<Q;i++){ans=INF;
	for(j=L[i];j<=R[i];j++){

	k = cost[j][L[i]] + cost[j][R[i]] + H[j];

	ans=min(ans,k);
	}
	C[i]=ans;
}



  return C;
}

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