제출 #244084

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
244084		crossing0ver	모임들 (IOI18_meetings)	C++17	0 / 100	27 ms	2424 KiB

meetings

#include<bits/stdc++.h>
#define ll long long 
#define pb push_back
#define vi vector<int>
#define fi first
#define se second
#define local

#ifndef local
#include "meetings.h"
#endif
using namespace std;
int Q,n;
vector<ll> small(vi H,vi L,vi R) {
	vector<ll> T(Q);
	for (int i = 0; i < Q; i++) {
		int l = L[i], r = R[i];
		stack<ll> st;
		ll sum = 0;
		vector<ll> ans(n),bans(n);
		for (int x = l ; x <= r; x++) {
			int e = 1;
			if (st.size() && st.top() < H[x]) {
				sum -= st.top();
				st.pop();
				sum += H[x];
				e++;
			}
			while (e--) st.push(H[x]), sum += H[x];
			ans[x] = sum;
		}
		while(!st.empty()) st.pop();
		 sum = 0;
		for (int x = r; x >= l; x--) {
			int e = 1;
			if (st.size() && st.top() < H[x]) {
				sum -= st.top();
				st.pop();
				sum += H[x];
				e++;
			}
			while(e--) st.push(H[x]), sum += H[x];
			sum -= H[x];
			ans[i] += sum;
		}
		ll mn = LLONG_MAX;
		for (int i = l; i <= r; i++) mn = min(mn,ans[i]);
		T[i] = mn;
	}
	return T;
}
vector<ll> minimum_costs(vi H, vi L,vi R) {
  n = H.size(); Q = L.size();
  if (n <= 5000 && Q <= 5000) return small(H,L,R);
  std::vector<long long> C(Q);
  for (int j = 0; j < Q; ++j) {
    C[j] = H[L[j]];
  }
  return C;
}

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