Create CF-D2-296C.cpp

Author: AymanSalah96

Codeforces/CF-D2-296C.cpp

@@ -0,0 +1,110 @@
+#include <cstring>
+#include <map>
+#include <deque>
+#include <queue>
+#include <stack>
+#include <sstream>
+#include <numeric>
+#include <iostream>
+#include <iomanip>
+#include <cstdio>
+#include <cmath>
+#include <fstream>
+#include <string>
+#include <cstdlib>
+#include <ctime>
+#include <functional>
+#include <algorithm>
+#include <vector>
+#include <set>
+#include <complex>
+#include <list>
+#include <climits>
+#include <cctype>
+#include <bitset>
+#include <assert.h>
+using namespace std;
+
+#define PI 3.14159265359
+#define all(v) v.begin(),v.end()
+#define sortva(v) sort(all(v))
+#define sortvd(v) sort(v.rbegin(),v.rend())
+#define sortaa(first,n) sort(first,first+n)
+#define sortad(first,n) sort(first,first+n),reverse(first,first+n)
+#define sfi1(v) scanf("%dist",&v)
+#define sfi2(v1,v2) scanf("%dist %dist",&v1,&v2)
+#define sfi3(v1,v2,v3) scanf("%dist %dist %dist",&v1,&v2,&v3)
+#define sfll1(v) scanf("%I64d",&v);
+#define sfll2(v1,v2) scanf("%I64d %I64d",&v1,&v2)
+#define sfll3(v1,v2,v3) scanf("%I64d %I64d %I64d",&v1,&v2,&v3)
+#define sfstr(v) scanf("%sum", v);
+#define sz(v) (int)v.size()
+#define ndl puts("")
+#define flush fflush(stdout)
+#define SS stringstream
+typedef long long ll;
+typedef unsigned long long ull;
+typedef long double ld;
+
+int di[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
+int dj[] = { 1, -1, 0, 0, -1, 1, 1, -1 };
+
+ll gcd(ll first, ll second) { return !second ? first : gcd(second, first % second); }
+ll lcm(ll first, ll second) { return (first / gcd(first, second)) * second; }
+
+void PLAY() {
+#ifndef ONLINE_JUDGE
+freopen("input.txt", "r", stdin);
+freopen("output.txt", "w", stdout);
+#endif
+
+cout << fixed << setprecision(5);
+ios::sync_with_stdio(0);
+cin.tie(0);
+cout.tie(0);
+}
+
+const int MAX = 1e5 + 10;
+ll pre1[MAX], pre2[MAX];
+
+int a[MAX], l[MAX], r[MAX];
+ll d[MAX];
+
+int main() {
+PLAY();
+
+int n, m, k;
+cin >> n >> m >> k;
+
+for (int i = 0; i < n; i++)
+cin >> a[i];
+
+for (int i = 0; i < m; i++) {
+cin >> l[i] >> r[i] >> d[i];
+l[i]--; r[i]--;
+}
+while (k--) {
+int l, r;
+cin >> l >> r;
+l--; r--;
+pre1[l]++;
+pre1[r + 1]--;
+}
+
+for (int i = 1; i < m; i++)
+pre1[i] += pre1[i - 1];
+
+for (int i = 0; i < m; i++) {
+d[i] *= pre1[i];
+pre2[l[i]] += d[i];
+pre2[r[i] + 1] -= d[i];
+}
+
+for (int i = 1; i < n; i++)
+pre2[i] += pre2[i - 1];
+
+for (int i = 0; i < n; i++)
+cout << a[i] + pre2[i] << " ";
+
+return 0;
+}