| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 944140 | teacup | Meetings (IOI18_meetings) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
typedef vector<int> vi;
#define iii tuple<int,int,int>
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef map<int,int> mii;
#ifndef debug
#define cerr if (0) cerr
#endif
const int INF=1e17;
int A[5005];
struct node {
int s, e;
int mn, mx, sum, add_val, set_val;
bool lset;
node *l, *r;
node (int _s, int _e, int A[] = NULL): s(_s), e(_e), mn(0), mx(0), sum(0), lset(0), add_val(0), set_val(0), l(NULL), r(NULL) {
if (A == NULL) return;
if (s == e) mn = mx = sum = A[s];
else {
l = new node(s, (s+e)>>1, A), r = new node((s+e+2)>>1, e, A);
combine();
}
}
void create_children() {
if (s == e) return;
if (l != NULL) return;
int m = (s+e)>>1;
l = new node(s, m);
r = new node(m+1, e);
}
void self_set(int v) {
lset = 1;
mn = mx = set_val = v;
sum = v * (e-s+1);
add_val = 0;
}
void self_add(int v) {
if (lset) { self_set(v + set_val); return; }
mn += v, mx += v, add_val += v;
sum += v*(e-s+1);
}
void lazy_propagate() {
if (s == e) return;
if (lset) {
l->self_set(set_val), r->self_set(set_val);
lset = set_val = 0;
}
if (add_val != 0) {
l->self_add(add_val), r->self_add(add_val);
add_val = 0;
}
}
void combine() {
if (l == NULL) return;
sum = l->sum + r->sum;
mn = min(l->mn, r->mn);
mx = max(l->mx, r->mx);
}
#define UPDATE(name)\
void name(int x, int y, int v) { \
if (s == x && e == y) { self_##name(v); return; } \
int m = (s+e)>>1; \
create_children(); lazy_propagate(); \
if (x <= m) l->name(x, min(y, m), v); \
if (y > m) r->name(max(x, m+1), y, v); \
combine(); \
}
UPDATE(add) //generates add
UPDATE(set) //generates set
#define QUERY(name, fn, var, lazyfn)\
int range_##name(int x, int y) {\
if (s == x && e == y) return var; \
if (l == NULL || lset) return lazyfn(var);\
int m = (s+e)>>1; lazy_propagate(); \
if (y <= m) return l->range_##name(x, y); \
if (x > m) return r->range_##name(x, y); \
return fn(l->range_##name(x, m), r->range_##name(m+1, y)) ; \
}
#define SAME(var) (var)
#define PART(var) ((var) /(e-s+1) * (y-x+1))
#define SUM(a, b) ((a)+(b))
QUERY(min, min, mn, SAME) //generates range_min
QUERY(max, max, mx, SAME) //generates range_max
QUERY(sum, SUM, sum, PART) //generates range_sum
~node() {
if (l != NULL) delete l;
if (r != NULL) delete r;
}
} *root;
vi minimum_costs(vector<int32_t> H, vector<int32_t> L,
vector<int32_t> R) {
int Q = L.size(), N = H.size();
vi C;
for (int i=0; i<H.size(); i++) A[i]=H[i];
root = new node(1, H.size()+5, A);
for (int _=0; _<Q; _++){
int L_ = L[_], R_ = R[_], actual_ans=INF;
for (int i=L_; i<=R_; i++){
int ans=0;
memset(A,0,sizeof(A));
for (int j = i-1; j >= L_; j--){
A[j] = max(A[j+1], H[j]);
}
for (int j = i+1; j <= R_; j++){
A[j] = max(A[j-1], H[j]);
}
for (int j=L_; j<=R_; j++) ans+=A[j];
actual_ans = min(ans, actual_ans);
}
C.push_back(actual_ans);
}
return C;
}