[UESTC1059]秋实大哥与小朋友（线段树, 离散化）

题目链接：http://acm.uestc.edu.cn/#/problem/show/1059

普通线段树+离散化，关键是……离散化后建树和查询都要按照基本法！！！RE了不知道多少次………………我真是个沙茶……

 /*
 ━━━━━┒ギリギリ♂ eye！
 ┓┏┓┏┓┃キリキリ♂ mind！
 ┛┗┛┗┛┃＼○／
 ┓┏┓┏┓┃ /
 ┛┗┛┗┛┃ノ)
 ┓┏┓┏┓┃
 ┛┗┛┗┛┃
 ┓┏┓┏┓┃
 ┛┗┛┗┛┃
 ┓┏┓┏┓┃
 ┛┗┛┗┛┃
 ┓┏┓┏┓┃
 ┃┃┃┃┃┃
 ┻┻┻┻┻┻
 */
 #include <algorithm>
 #include <iostream>
 #include <iomanip>
 #include <cstring>
 #include <climits>
 #include <complex>
 #include <fstream>
 #include <cassert>
 #include <cstdio>
 #include <bitset>
 #include <vector>
 #include <deque>
 #include <queue>
 #include <stack>
 #include <ctime>
 #include <set>
 #include <map>
 #include <cmath>

 using namespace std;

 #define fr first
 #define sc second
 #define cl clear
 #define BUG puts("here!!!")
 #define W(a) while(a--)
 #define pb(a) push_back(a)
 #define Rint(a) scanf("%d", &a)
 #define Rll(a) scanf("%lld", &a)
 #define Rs(a) scanf("%s", a)
 #define Cin(a) cin >> a
 #define FRead() freopen("in", "r", stdin)
 #define FWrite() freopen("out", "w", stdout)
 #define Rep(i, len) for(LL i = 0; i < (len); i++)
 #define For(i, a, len) for(LL i = (a); i < (len); i++)
 #define Cls(a) memset((a), 0, sizeof(a))
 #define Clr(a, x) memset((a), (x), sizeof(a))
 #define Full(a) memset((a), 0x7f7f, sizeof(a))
 #define lrt rt << 1
 #define rrt rt << 1 | 1
 typedef long long LL;

 const int maxn = ;
 LL sum[maxn<<];
 LL add[maxn<<];
 int n, m;
 int hcnt;
 LL h[maxn];
 LL cmd[maxn], a[maxn], b[maxn], c[maxn];

 void pushUP(int rt) {
     sum[rt] = sum[lrt] + sum[rrt];
 }

 void pushDOWN(int rt, int m) {
     if(add[rt]) {
         add[lrt] += add[rt];
         add[rrt] += add[rt];
         sum[lrt] += (m - (m >> )) * add[rt];
         sum[rrt] += (m >> ) * add[rt];
         add[rt] = ;
     }
 }

 void build(int l, int r, int rt) {
     add[rt] = sum[rt] = ;
     if(l == r) return;
     int m = (l + r) >> ;
     build(l, m, lrt);
     build(m+, r, rrt);
     pushUP(rt);
 }

 void update(int L, int R, int x, int l, int r, int rt) {
     if(l >= L && R >= r) {
         add[rt] += x;
         sum[rt] += (r - l + ) * x;
         return;
     }
     pushDOWN(rt, r-l+);
     int m = (l + r) >> ;
     if(m >= L) update(L, R, x, l, m, lrt);
     if(m < R) update(L, R, x, m+, r, rrt);
     pushUP(rt);
 }

 LL query(int p, int l, int r, int rt) {
     if(l == r && p == l) return sum[rt];
     pushDOWN(rt, r-l+);
     int m = (l + r) >> ;
     if(p <= m) {
         LL ret = query(p, l, m, lrt);
         pushUP(rt);
         return ret;
     }
     else {
         LL ret = query(p, m+, r, rrt);
         pushUP(rt);
         return ret;
     }
 }

 int getid(int x) {
     return lower_bound(h, h+hcnt, x) - h + ;
 }

 int main() {
     // FRead();
     while(~Rint(n) && ~Rint(m)) {
         hcnt = ;
         Rep(i, m) {
             Rint(cmd[i]);
             if(cmd[i] == ) {
                 Rll(a[i]); Rll(b[i]); Rll(c[i]);
                 h[hcnt++] = a[i]; h[hcnt++] = b[i];
             }
             if(cmd[i] == ) {
                 Rll(a[i]);
                 h[hcnt++] = a[i];
             }
         }
         sort(h, h+hcnt); hcnt = unique(h, h+hcnt) - h;
         build(, hcnt, );
         Rep(i, m) {
             if(cmd[i] == ) update(getid(a[i]), getid(b[i]), c[i], , hcnt, );
             if(cmd[i] == ) printf("%lld\n", query(getid(a[i]), , hcnt, ));
         }
     }
     return ;
 }