fork download
copy 
  1. #include <bits/stdc++.h> // NeOWami
  2. using namespace std;
  3.  
  4. #define ft first
  5. #define sc second
  6. #define int long long
  7. const int N = 1e5 + 5;
  8. const int LG = 18;
  9. int n, d[N], a[N][LG], q;
  10.  
  11. namespace sub1 {
  12. void solve() {
  13.     while (q--) {
  14.         int type, u, v; cin >> type >> u >> v;
  15.         if (type == 0) {
  16.             int t; cin >> t;
  17.             for (int i = u; i <= v; i++) d[i] ^= t;
  18.         } 
  19.         else {
  20.             int ans = 0;
  21.             for (int i = u; i <= v; i++) ans += d[i];
  22.             cout << ans << "\n";
  23.         }
  24.     }
  25. }
  26. }
  27. namespace subfull {
  28. int st[N * 4][2][LG];
  29. void calc(int id, int len, int i) {
  30.     st[id][0][i] = len - st[id][0][i];
  31.     st[id][1][i] = !st[id][1][i];
  32. }
  33.  
  34. void down(int id, int l, int r) {
  35.     int mid = l + r >> 1;
  36.     for (int i = 0; i < LG; i++) if (st[id][1][i]) {
  37.         calc(id * 2, mid - l + 1, i);
  38.         calc(id * 2 + 1, r - mid, i);
  39.         st[id][1][i] = 0;
  40.     }
  41. }
  42. void build(int id, int l, int r) {
  43.     if (l == r) {
  44.         for (int i = 0; i < LG; i++) st[id][0][i] = a[l][i];
  45.         return;
  46.     }
  47.     int mid = l + r >> 1;
  48.     build(id * 2, l, mid);
  49.     build(id * 2 + 1, mid + 1, r);
  50.     for (int i = 0; i < LG; i++) st[id][0][i] = st[id * 2][0][i] + st[id * 2 + 1][0][i];
  51. }
  52.  
  53. void update(int id, int l, int r, int u, int v, int p) {
  54.     if (l > v || r < u) return;
  55.     if (l >= u && r <= v) {
  56.         for (int i = 0; i < LG; i++) if (p >> i & 1) calc(id, r - l + 1, i);
  57.         return;
  58.     }
  59.     down(id, l, r);
  60.     int mid = l + r >> 1;
  61.     update(id * 2, l, mid, u, v, p);
  62.     update(id * 2 + 1, mid + 1, r, u, v, p);
  63.     for (int i = 0; i < LG; i++) st[id][0][i] = st[id * 2][0][i] + st[id * 2 + 1][0][i];
  64. }
  65.  
  66. int get(int id, int l, int r, int u, int v) {
  67.     if (l > v || r < u) return 0;
  68.     if (l >= u && r <= v) {
  69.         int ans = 0;
  70.         for (int i = 0; i < LG; i++) ans += (1 << i) * st[id][0][i];
  71.         return ans;
  72.     }
  73.     down(id, l, r);
  74.     int mid = l + r >> 1;
  75.     return get(id * 2, l, mid, u, v) + get(id * 2 + 1, mid + 1, r, u, v);
  76. }
  77. void solve() {
  78.     for (int i = 1; i <= n; i++) {
  79.         int x = d[i];
  80.         for (int j = 0; j < LG; j++) a[i][j] = (x >> j) & 1;
  81.     }
  82.     build(1, 1, n);
  83.     while (q--) {
  84.         int type, u, v; cin >> type >> u >> v;
  85.         if (type == 0) {
  86.             int t; cin >> t;
  87.             update(1, 1, n, u, v, t);
  88.         } 
  89.         else cout << get(1, 1, n, u, v) << "\n";
  90.     }
  91. }
  92. }
  93. signed main() {
  94.     cin.tie(NULL)->sync_with_stdio(false);
  95.     if(ifstream("LZXOR.inp")) {
  96.         freopen("LZXOR.inp", "r", stdin);
  97.         freopen("LZXOR.out", "w", stdout);  
  98.     }
  99.     cin >> n;
  100.     for (int i = 1; i <= n; i++) cin >> d[i];
  101.     cin >> q;
  102.     if (n * q <= 1'000'000) return sub1::solve(), 0;
  103.     return subfull::solve(), 0;
  104.     return 0;
  105. }
Success #stdin #stdout 0s 5312KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/EeAWvR
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!