Advertisement
Guest User

Untitled

a guest
Jul 6th, 2015
194
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.24 KB | None | 0 0
  1. //#define _CRT_SECURE_NO_WARNINGS
  2. #include <vector>
  3. #include <string>
  4. #include <iostream>
  5. #include <algorithm>
  6. #include <cmath>
  7. #include <cstdio>
  8. #include <cstdlib>
  9. #include <fstream>
  10. #include <map>
  11. #include <set>
  12. #include <queue>
  13. #include <memory.h>
  14. #include <time.h>
  15. #include <iostream>
  16. #include <string>
  17. #include <cstring>
  18. #include <vector>
  19. #include <cmath>
  20. #include <map>
  21. #include <algorithm>
  22. #include <cstdio>
  23. #include <set>
  24. #include <queue>
  25. #include <cassert>
  26. #include <climits>
  27. #define sz(x) int((x).size())
  28. #define FOR(i,a,b) for(ll(i) = (a); (i) <= (b); ++(i))
  29. #define ROF(i,a,b) for(ll(i) = (a); (i) >= (b); --(i))
  30. #define rep(i,n) for (int(i) = 0; (i) < (n); ++(i))
  31. #define fe(i,a) for (ll(i) = 0; (i) < int((a).size()); ++(i))
  32. #define C(a) memset((a),0,sizeof(a))
  33. #define pb push_back
  34. #define ppb pop_back
  35. #define all(c) (c).begin(), (c).end()
  36. #define sqr(a) (a)*(a)
  37. #define mp(a,b) make_pair((a), (b))
  38. #define X first
  39. #define Y second
  40. #define file freopen("input.txt","r",stdin)
  41. #define file2 freopen("output.txt", "w",stdout)
  42. #define text freopen("input.txt","r",stdin); freopen("output.txt", "w",stdout)
  43. using namespace std;
  44. typedef vector<int> vint;
  45. typedef long long ll;
  46. typedef unsigned long long ull;
  47. typedef pair<int, int> pii;
  48. #include <iostream>
  49. #include <cstdio>
  50. #include <cstdlib>
  51. #include <cmath>
  52. #include <cstring>
  53. #include <string>
  54. #include <vector>
  55. #include <climits>
  56. #include <cassert>
  57. #define y1 vamdlsfmvldf
  58. using namespace std;
  59. const int mod = 1000000007;
  60. const int INF = 1000000000;
  61. const int N = 1000005;
  62. using namespace std;
  63. int n;
  64. int t[N];
  65. ll sum (int r)
  66. {
  67. ll result = 0;
  68. for (; r >= 0; r = (r & (r + 1)) - 1)
  69. result += t[r];
  70. return result;
  71. }
  72. void inc (int i, int delta)
  73. {
  74. for (; i < n; i = (i | (i+1)))
  75. t[i] += delta;
  76. }
  77. ll sum (int l, int r){
  78. return sum (r) - sum (l - 1);
  79. }
  80. int main(){
  81. int q;
  82. scanf("%d %d", &n, &q);
  83. ++n;
  84. int dop1, dop2, dop3;
  85. char c;
  86. for(int i = 0; i < q; ++i){
  87. scanf("\n%c", &c);
  88. if(c == 'A'){
  89. scanf("%d %d %d", &dop1, &dop2, &dop3);
  90. inc(dop1, dop3);
  91. inc(dop2 + 1, -dop3);
  92. }
  93. else{
  94. scanf("%d", &dop1);
  95. printf("%I64d\n", sum(0, dop1));
  96. }
  97. }
  98. return 0;
  99. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement