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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 252525
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
ll fenwick[MAX_N];
ll t[MAX_N], l[MAX_N], r[MAX_N], v[MAX_N];
vpll eft[MAX_N];
pll qry[MAX_N];
vpll last(MAX_N, {-1, 0});
vll res;
void update(ll n, ll m, ll v) {
while(n <= m) {
fenwick[n] += v;
n += n & -n;
}
}
ll query(ll n) {
ll res = 0;
while(n) {
res += fenwick[n];
n -= n & -n;
}
return res;
}
void solve(ll m, ll q) {
for(ll i = 0, re = 0; i < q; i++) {
if(t[i] == 1) {
update(l[i], m, v[i]);
update(r[i] + 1, m, -v[i]);
} else if(t[i] == 2) {
for(auto& [id, n] : eft[i]) {
res[id] -= query(n);
}
} else {
res[re++] += query(qry[i].second);
}
}
}
void qry1(ll j) {
cin>>l[j]>>r[j]>>v[j];
}
void qry2(ll j) {
cin>>qry[j].first>>qry[j].second;
last[qry[j].first] = {j, qry[j].second};
}
void qry3(ll j) {
cin>>qry[j].first>>qry[j].second;
ll id = res.size();
auto [pos, v] = last[qry[j].first];
if(pos != -1) eft[pos].push_back({id, qry[j].second});
res.push_back(v);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n, m, q;
cin>>n>>m>>q;
for(ll j = 0; j < q; j++) {
cin>>t[j];
if(t[j] == 1) qry1(j);
else if(t[j] == 2) qry2(j);
else if(t[j] == 3) qry3(j);
}
solve(m, q);
for(auto& r : res) cout<<r<<endl;
}
return 0;
}
|
