CodeForces - 635D（线段树点更新区间查询）

爱被打了一巴掌 2022-05-28 13:05 162阅读 0赞

D. Factory Repairs

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

A factory produces thimbles in bulk. Typically, it can produce up to *a* thimbles a day. However, some of the machinery is defective, so it can currently only produce *b* thimbles each day. The factory intends to choose a *k*\-day period to do maintenance and construction; it cannot produce any thimbles during this time, but will be restored to its full production of *a* thimbles per day after the *k* days are complete.

Initially, no orders are pending. The factory receives updates of the form *d**i*, *a**i*, indicating that *a**i* new orders have been placed for the *d**i*\-th day. Each order requires a single thimble to be produced on precisely the specified day. The factory may opt to fill as many or as few of the orders in a single batch as it likes.

As orders come in, the factory owner would like to know the maximum number of orders he will be able to fill if he starts repairs on a given day *p**i*. Help the owner answer his questions.

Input

The first line contains five integers *n*, *k*, *a*, *b*, and *q* (1 ≤ *k* ≤ *n* ≤ 200 000, 1 ≤ *b* < *a* ≤ 10 000, 1 ≤ *q* ≤ 200 000) — the number of days, the length of the repair time, the production rates of the factory, and the number of updates, respectively.

The next *q* lines contain the descriptions of the queries. Each query is of one of the following two forms:

*  1 *d**i* *a**i* (1 ≤ *d**i* ≤ *n*, 1 ≤ *a**i* ≤ 10 000), representing an update of *a**i* orders on day *d**i*, or
 *  2 *p**i* (1 ≤ *p**i* ≤ *n* - *k* + 1), representing a question: at the moment, how many orders could be filled if the factory decided to commence repairs on day *p**i*?

It's guaranteed that the input will contain at least one query of the second type.

Output

For each query of the second type, print a line containing a single integer — the maximum number of orders that the factory can fill over all *n* days.

Examples

input

Copy

5 2 2 1 8
    1 1 2
    1 5 3
    1 2 1
    2 2
    1 4 2
    1 3 2
    2 1
    2 3

output

3
    6
    4

input

Copy

5 4 10 1 6
    1 1 5
    1 5 5
    1 3 2
    1 5 2
    2 1
    2 2

output

7
    1

Note

Consider the first sample.

We produce up to 1 thimble a day currently and will produce up to 2 thimbles a day after repairs. Repairs take 2 days.

For the first question, we are able to fill 1 order on day 1, no orders on days 2 and 3 since we are repairing, no orders on day 4 since no thimbles have been ordered for that day, and 2 orders for day 5 since we are limited to our production capacity, for a total of 3 orders filled.

For the third question, we are able to fill 1 order on day 1, 1 order on day 2, and 2 orders on day 5, for a total of 4 orders.

#include<bits/stdc++.h>
    
    using namespace std;
    typedef long long ll;
    const int maxn=2e5+10;
    struct node{
        ll sa, sb;
    }tree[4*maxn];
    int n, k, a, b, q;
    
    ll _min(ll a, int b)
    {
    
        if(a>b) return b;
        else return a;
    }
    
    void build(int rt, int l, int r){
        if(l==r)
        {
            tree[rt].sa=0; tree[rt].sb=0;
            
            return;
        }
    
        int mid=(l+r)>>1;
    
        build(rt<<1, l, mid);
        build(rt<<1|1, mid+1, r);
    
    }
    
    
    void update(int rt, int l, int r, int day, int pr){
        if(day==l && r==day)
        {
            tree[rt].sa=_min(pr+tree[rt].sa, b);
            tree[rt].sb=_min(pr+tree[rt].sb, a);//取工作效率 和 工作量较小者
            return;
        }
    
        int mid=(l+r)>>1;
    
        if(mid>=day)
            update(rt<<1, l, mid, day, pr);
        else if(mid<day)
            update(rt<<1|1, mid+1, r, day, pr);
    
        tree[rt].sa=tree[rt<<1].sa+tree[rt<<1|1].sa;
        tree[rt].sb=tree[rt<<1].sb+tree[rt<<1|1].sb;
        return;
    }
    
    void query(int rt, int l, int r, int L, int R, ll &suma, ll &sumb){
        if(l==L && r==R)
        {
            suma+=tree[rt].sa;
            sumb+=tree[rt].sb;
            return;
        }
    
        int mid=(l+r)>>1;
    
        if(mid>=R)
            query(rt<<1, l, mid, L, R, suma, sumb);
        else if(mid<L)
            query(rt<<1|1, mid+1, r, L, R, suma, sumb);
        else
        {
            query(rt<<1, l, mid, L, mid, suma, sumb);
            query(rt<<1|1, mid+1, r, mid+1, R, suma, sumb);
        }
    }
    
    int main()
    {
        scanf("%d%d%d%d%d", &n, &k, &a, &b, &q);
        build(1, 1, n);
    
        while(q--){
            int op, w, e;
            scanf("%d", &op);
            if(op==1){
                scanf("%d%d", &w, &e);
                update(1, 1, n, w, e);
            }
            else{
    
                scanf("%d", &w);
                ll sum=0, s=0;
                
    			int l1=1, r1, l2, r2=n;
                r1=w-1; l2=w+k;
                if(l1<=r1)
                    query(1, 1, n, l1, r1, sum, s);
    
                if(l2<=r2)
                    query(1, 1, n, l2, r2, s, sum);
                printf("%lld\n", sum);
            }
        }
    
    }