Codeforces 296C Greg and Array【思维】

C. Greg and Array

time limit per test

1.5 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Greg has an array a = a1, a2, ..., an and m operations. Each operation looks as: li, ri, di, (1 ≤ li ≤ ri ≤ n). To apply operation i to the array means to increase all array elements with numbers li, li + 1, ..., ri by value di.

Greg wrote down k queries on a piece of paper. Each query has the following form: xi, yi, (1 ≤ xi ≤ yi ≤ m). That means that one should apply operations with numbers xi, xi + 1, ..., yi to the array.

Now Greg is wondering, what the array a will be after all the queries are executed. Help Greg.

Input

The first line contains integers n, m, k (1 ≤ n, m, k ≤ 105). The second line contains n integers: a1, a2, ..., an (0 ≤ ai ≤ 105) — the initial array.

Next m lines contain operations, the operation number i is written as three integers: li, ri, di, (1 ≤ li ≤ ri ≤ n), (0 ≤ di ≤ 105).

Next k lines contain the queries, the query number i is written as two integers: xi, yi, (1 ≤ xi ≤ yi ≤ m).

The numbers in the lines are separated by single spaces.

Output

On a single line print n integers a1, a2, ..., an — the array after executing all the queries. Separate the printed numbers by spaces.

Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams of the %I64dspecifier.

Examples

input

3 3 3
1 2 3
1 2 1
1 3 2
2 3 4
1 2
1 3
2 3

output

9 18 17

input

1 1 1
1
1 1 1
1 1

output

2

input

4 3 6
1 2 3 4
1 2 1
2 3 2
3 4 4
1 2
1 3
2 3
1 2
1 3
2 3

output

5 18 31 20

题目大意：

给出一个长度为N的数组，现在有M种的操作，表示【L,R】区间内所有元素都加上val。

有k个操作，每个操作表示第L种到第R种的操作都进行一次。

问最终序列的每个元素的值。

思路：

维护一个sum【i】，表示第i个操作进行了多少次。

那么对应k个操作，我们对应Sum【L】++，Sum【R+1】--即可。

然后在维护一个数组sum2【i】表示对于数组第i个位子，进行了多少次操作，加了多少数。

那么过程维护一下即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define ll __int64
struct node
{
    ll l,r,val;
}a[150000];
ll temp[150000];
ll sum[150000];
ll sum2[150000];
int main()
{
    ll n,m,q;
    while(~scanf("%I64d%I64d%I64d",&n,&m,&q))
    {
        for(ll i=1;i<=m;i++)sum[i]=0,sum2[i]=0;
        for(ll i=1;i<=n;i++)scanf("%I64d",&temp[i]);
        for(ll i=1;i<=m;i++)scanf("%I64d%I64d%I64d",&a[i].l,&a[i].r,&a[i].val);
        for(ll i=1;i<=q;i++)
        {
            ll l,r;scanf("%I64d%I64d",&l,&r);
            sum[l]+=1;
            sum[r+1]-=1;
        }
        ll now=0;
        for(ll i=1;i<=m;i++)
        {
            now+=sum[i];
            sum2[a[i].l]+=now*a[i].val;
            sum2[a[i].r+1]-=now*a[i].val;
        }
        now=0;
        for(ll i=1;i<=n;i++)
        {
            now+=sum2[i];
            printf("%I64d ",now+temp[i]);
        }
        printf("\n");
    }
}