제출 #415361

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
415361		Kevin_Zhang_TW	모임들 (IOI18_meetings)	C++17	19 / 100	5543 ms	5488 KiB

meetings

#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV 
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l)==r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

const int MAX_N = 300010;
const ll inf = 1ll << 55;

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();
	std::vector<long long> C(Q);


	for (int i = 0;i < Q;++i) {
		vector<ll> pf(N), suf(N);

		{
			vector< pair<ll,ll> > stk;
			ll sum = 0;
			for (int j = L[i];j <= R[i];++j) {
				ll cl = j;
				while (stk.size()) {
					auto [h, l] = stk.back();
					if (h > H[j]) break;
					sum -= (cl - l) * h;
					cl = l;
					stk.pop_back();
				}
				stk.pb(H[j], cl);
				sum += (j - cl+1) * H[j];
				pf[j] = sum;
			}
		}
		{
			vector< pair<ll,ll> > stk;
			ll sum = 0;
			for (int j = R[i];j >= L[i];--j) {
				ll cr = j;
				while (stk.size()) {
					auto [h, r] = stk.back();
					if (h > H[j]) break;
					sum -= (r - cr) * h;
					cr = r;
					stk.pop_back();
				}
				stk.pb(H[j], cr);
				sum += (cr - j + 1) * H[j];
				suf[j] = sum;
			}
		}
		ll res = inf;

		for (int j = L[i];j <= R[i];++j) {
			chmin(res, pf[j] + suf[j] - H[j]);
		}

		C[i] = res;
	}
	return C;
}

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