| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 492660 | lukameladze | 사탕 분배 (IOI21_candies) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
# include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pb push_back
#define pii pair <int, int>
using namespace std;
const int N = 3e5 + 5;
int n,q,l[N],r[N],val[N],cc,idx,c[N],le,ri,mid,mxid,mnid,ans;
vector < pii > v[N];
int lazy[4*N];
struct nd {
int mx;
int mn;
int mxidx;
int mnidx;
int sum;
};
nd tree[4*N],emp;
nd merge(nd a, nd b) {
nd ans;
ans.mx = max(a.mx,b.mx);
ans.mn = min(a.mn,b.mn);
if (a.mx >= b.mx) ans.mxidx = a.mxidx;
else ans.mxidx = b.mxidx;
if (a.mn <= b.mn) ans.mnidx = a.mnidx;
else ans.mnidx = b.mnidx;
ans.sum = a.sum + b.sum;
return ans;
}
void build(int node, int le, int ri) {
if (le == ri) {
tree[node].mx = 0;
tree[node].mn = 0;
tree[node].mxidx = le;
tree[node].mnidx = le;
tree[node].sum = 0;
return ;
}
int mid = (le + ri) / 2;
build(2*node, le, mid);
build(2*node + 1, mid + 1, ri);
tree[node] = merge(tree[2*node],tree[2*node + 1]);
}
void update(int node, int le, int ri, int start, int end, int val) {
if (lazy[node]) {
tree[node].mx += lazy[node];
tree[node].mn += lazy[node];
tree[node].sum += (ri - le + 1) * lazy[node];
if (le != ri) {
lazy[2*node] += lazy[node];
lazy[2*node + 1] += lazy[node];
}
lazy[node] = 0;
}
if (le > end || ri < start) return ;
if (le >= start && ri <= end) {
tree[node].mx += val;
tree[node].mn += val;
tree[node].sum += (ri - le + 1) * val;
if (le != ri) {
lazy[2*node] += val;
lazy[2*node + 1] += val;
}
return ;
}
int mid = (le + ri) / 2;
update(2*node, le, mid ,start,end,val);
update(2*node + 1, mid + 1, ri, start,end, val);
tree[node] = merge(tree[2*node],tree[2*node + 1]);
}
nd getans(int node, int le, int ri, int start, int end) {
if (lazy[node]) {
tree[node].mx += lazy[node];
tree[node].mn += lazy[node];
tree[node].sum += (ri - le + 1) * lazy[node];
if (le != ri) {
lazy[2*node] += lazy[node];
lazy[2*node + 1] += lazy[node];
}
lazy[node] = 0;
}
if (le > end || ri < start) return emp;
if (le >= start && ri <= end) {
return tree[node];
}
int mid = (le + ri) / 2;
return merge(getans(2*node,le,mid,start,end), getans(2*node + 1, mid + 1, ri, start,end));
}
int check(int mid) {
if (getans(1,0,q,mid,q).mx - getans(1,0,q,mid,q).mn >= cc) return 1;
else return 0;
}
main() {
cin>>n;
for (int i = 1; i <= n; i++) {
cin>>c[i];
}
emp.mx = -1e9;
emp.mn = 1e9;
emp.sum = 0;
cin>>q;
for (int i = 1; i <= q; i++) {
cin>>l[i]>>r[i]>>val[i];
l[i]++;
r[i]++;
v[l[i]].pb({i,val[i]});
v[r[i] + 1].pb({i,-val[i]});
}
build(1,0,q);
for (int i = 1; i <= n; i++) {
//cout<<"s"<<endl;
for (int j = 0; j < v[i].size(); j++) {
idx = v[i][j].f;
//if (abs(v[i][j].s) == 26416) {
update(1,0,q,idx,q,v[i][j].s);
//cout<<idx<<" "<<q<<" "<<v[i][j].s<<endl;
//}
}
le = 0; ri = q;
cc = c[i];
ans = -1;
while (le <= ri) {
mid = (le + ri) / 2;
if (check(mid)) {
ans = mid;
le = mid + 1;
} else ri = mid - 1;
}
if (ans == -1) {
if (getans(1,0,q,0,q).mn < 0) {
int leeid = getans(1,0,q,0,q).mnidx;
cout<<getans(1,0,q,q,q).sum - getans(1,0,q,leeid,leeid).sum<<"\n";
continue;
}
cout<<getans(1,0,q,q,q).sum<<endl;
continue;
}
int mnval = getans(1,0,q,ans,q).mn;
mnid = getans(1,0,q,ans,q).mnidx;
int mxval = getans(1,0,q,ans,q).mx;
mxid = getans(1,0,q,ans,q).mxidx;
if (mnid >= mxid) {
le = mnid;
ri = q;
int leeid = getans(1,0,q,mnid,q).mnidx;
/*
while (le <= ri) {
mid = (le + ri) / 2;
if (getans(1,0,q,mnid,mid).mx == mnid)
}*/
cout<<getans(1,0,q,q,q).sum-getans(1,0,q,leeid,leeid).sum<<endl;
} else {
le = mxid;
ri = q;
int leeid = getans(1,0,q,mxid,q).mxidx;
cout<<c[i] + (getans(1,0,q,q,q).sum - getans(1,0,q,leeid,leeid).sum)<<endl;
}
}
}