-
Notifications
You must be signed in to change notification settings - Fork 0
/
296 C C. Greg and Array.cpp
123 lines (111 loc) · 2.85 KB
/
296 C C. Greg and Array.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/*
problem link: https://codeforces.com/contest/296/problem/C
my solution on codeforces : https://codeforces.com/contest/296/submission/176298705
problem name: C. Greg and Array
status: accepted
author: lilian_steven or LELLO
*/
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <cmath>
#include <unordered_map>
#include <algorithm>
#include <iomanip>
#include <bitset>
#include <utility>
#include <string>
#include <cctype>
#include <iomanip>
#include <numeric> // for NTH
#define bye return;
#define ll long long
#define lli long long int
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((x).size())
#define ison(num, bit) (num & (1 << bit))
#define setoff(num, bit) (num ^= (1 << bit)) // iff (num &(1<<bit))
#define flipbit(num, bit) (num ^= (1 << bit))
#define setbit(num, bit) (num |= (1 << bit))
#define clearbit(num, bit) (num &= ~(1 << bit))
#define pop_count(num) __builtin_popcount(num)
#define Num_of_Digits(n) ((ll)log10(n) + 1)
#define ceill(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define lastOne(x) (__builtin_clzll(x))
#define Pi 3.14159265358979323846264
#define sin(a) sin((a)*PI/180)
#define cos(a) cos((a)*PI/180)
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
using namespace std;
void AC() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); // or cin.tie(NULL)
cout.tie(nullptr); // or cout.tie(0)
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
// #endif
}
bool cmp(pair<int,int>&a, pair<int,int>&b){
if(a.first == b.first){
return a.second > b.second;
}
return a.first < b.first;
}
bool check_coprime(ll a, ll b) {
if ( __gcd(a, b) == 1) return true;
else return false ;
}
int a[100005];
long long q[100005];
long long p[100005];
void LELLO()
{
int n, m, k;
cin >> n >> m >> k;//one
for (int i = 1; i <= n; ++i)cin >> a[i];
vector<pair<int, int>>range(m + 1);
vector<long long>val(m + 1);
//two
for (int i = 1; i <= m; i++) {
int l, r, x;
cin >> l >> r >> x;
range[i] = { l,r };//make_pair(l,r)
val[i] = x;
}
//three
for (int i = 1; i <= k; i++) {
int x, y; cin >> x >> y;
q[x]++;
q[y + 1]--;
}
//prefix
// 2 3 2 // rept
for (int i = 1; i <= m; i++)q[i] += q[i - 1];
//new Val
for (int i = 1; i <= m; i++)
val[i] = val[i] * q[i];
for (int i = 1; i <= m; i++) {
int l = range[i].first;
int r = range[i].second;
p[l] += (val[i]);
p[r + 1] -= (val[i]);
}
for (int i = 1; i <= n; i++)p[i] += p[i - 1];
for (int i = 1; i <= n; i++)cout << p[i] + a[i] << " ";
}
void driver(ll t=1)
{
while (t--) LELLO();
}
signed main()
{
AC();
// ll test ; cin >> test ;
driver();
}