Submission #313031

#	Time	Username	Problem	Language	Result	Execution time	Memory
313031		reymontada61	모임들 (IOI18_meetings)	C++14	19 / 100	5559 ms	4216 KiB

meetings

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

std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,
                                     std::vector<int> R) {
  int Q = L.size();
  std::vector<long long> C(Q);
  
  int n = H.size();
  vector<long long> cost(n, 0);
  
  for (int i=0; i<Q; i++) {
	  int l = L[i], r = R[i];
	  for (int j=0; j<n; j++) {
		  cost[j] = 0;
	  }
	  
	  long long adder = 0;
	  vector<pair<long long, int>> proc;
	  proc.push_back({INT_MAX, l-1});
	  for (int j=l; j<=r; j++) {
		  while (proc.back().first <= H[j]) {
			  long long t = proc.size();
			  long long co = (proc[t-1].second - proc[t-2].second) * proc[t-1].first;
			  adder -= co;
			  proc.pop_back();
		  }
		  proc.push_back({H[j], j});
		  long long t = proc.size();
		  long long co = (proc[t-1].second - proc[t-2].second) * proc[t-1].first;
		  adder += co;
		  cost[j] += adder;
	  }
	  
	  adder = 0;
	  proc.clear();
	  proc.push_back({INT_MAX, r+1});
	  for (int j=r; j>=l; j--) {
		  while (proc.back().first <= H[j]) {
			  long long t = proc.size();
			  long long co = (proc[t-2].second - proc[t-1].second) * proc[t-1].first;
			  adder -= co;
			  proc.pop_back();
		  }
		  proc.push_back({H[j], j});
		  long long t = proc.size();
		  long long co = (proc[t-2].second - proc[t-1].second) * proc[t-1].first;
		  adder += co;
		  cost[j] += adder;
	  }
	  
	  for (int i=l; i<=r; i++) {
		  cost[i] -= H[i];
	  }
	  
	  C[i] = LLONG_MAX;
	  for (int j=l; j<=r; j++) {
		  C[i] = min(C[i], cost[j]);
	  }
  }
  
  return C;
  
}

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