Codeforces Round #179 (Div. 1)-A. Greg and Array

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Greg has an array a = a₁, a₂, ..., a_n and m operations. Each operation looks as: l_i, r_i, d_i, (1 ≤ l_i ≤ r_i ≤ n). To apply operation i to the array means to increase all array elements with numbers l_i, l_i + 1, ..., r_i by value d_i.

Greg wrote down k queries on a piece of paper. Each query has the following form: x_i, y_i, (1 ≤ x_i ≤ y_i ≤ m). That means that one should apply operations with numbers x_i, x_i + 1, ..., y_i 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 ≤ 10⁵). The second line contains n integers: a₁, a₂, ..., a_n (0 ≤ a_i ≤ 10⁵) — the initial array.

Next m lines contain operations, the operation number i is written as three integers: l_i, r_i, d_i, (1 ≤ l_i ≤ r_i ≤ n), (0 ≤ d_i ≤ 10⁵).

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

The numbers in the lines are separated by single spaces.

Output

On a single line print n integers a₁, a₂, ..., a_n — 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 %I64d specifier.

Sample test(s)

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

题意：

从数L到R加上D。

从操作X到Y 对数组进行操作。

思路：

数组vis 对操作数进行记录，数组q 对要修改的数进行记录。数组区间下标中左端点++，（右端点+1）- -，将数组进行一次循环即可记录所有数的情况。

CODE：

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
typedef long long ll;
const int inf=0xffffff;
const int M=100005;
using namespace std;

struct node
{
    int l,r,d;
}nn[M];
ll num[M],q[M],vis[M];

int main()
{
    //freopen("in.in","r",stdin);
    int n,m,k;
    while(~scanf("%d %d %d",&n,&m,&k))
    {
        memset(vis,0,sizeof(vis));
        memset(num,0,sizeof(num));
        memset(q,0,sizeof(q));
        for(int i=1;i<=n;i++)
            scanf("%lld",&num[i]);
        for(int i=1;i<=m;i++)
        {
            scanf("%d %d %d",&nn[i].l,&nn[i].r,&nn[i].d);
            nn[i].r++;
        }
        int x,y;
        for(int i=0;i<k;i++)
        {
            scanf("%d%d",&x,&y);
            vis[x]++;
            vis[y+1]--;
        }
        for(int i=1;i<=m;i++)
        {
            vis[i] += vis[i-1];
        }

        for(int i=1;i<=m;i++)
        {
            q[nn[i].l] += vis[i]*nn[i].d;
            q[nn[i].r] -= vis[i]*nn[i].d;
        }
        for(int i=1;i<=n;i++)
        {
            q[i] += q[i-1];
        }
        printf("%I64d",num[1]+q[1]);
        for(int i=2;i<=n;i++)
            printf(" %I64d",num[i]+q[i]);
        printf("\n");
    }

    return 0;
}