제출 #1177820

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1177820		Mousa_Aboubaker	XORanges (eJOI19_xoranges)	C++20	30 / 100	1096 ms	1092 KiB

xoranges

#pragma GCC optimize("O3", "Ofast", "unroll-loops")
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <deque>
#include <climits>
#include <cmath>
#include <numeric>
#include <string>
#include <bitset>
#include <assert.h>
#include <iomanip>
using namespace std;

template <typename T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

// template <typename T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// #include <bits/stdc++.h>
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #define getrand(l, r) uniform_int_distribution<int>(l, r)(rng)

const long long infl = 1e18 + 1;
const int inf = 1e9 + 1;
const int mod1 = 1e9 + 7;
const int mod2 = 998244353;
const long double eps = 1e-7;
const int mod = mod2;

int add(int a, int b) { return (a + b) % mod; }
int sub(int a, int b) { return (a - b + mod) % mod; }
int mul(int a, int b) { return (int)((long long)a * b % mod); }
int pwr(int a, int b = mod - 2)
{
  int res = 1;
  for (; b > 0; b >>= 1, a = mul(a, a))
    if (b & 1)
      res = mul(res, a);
  return res;
}
template <typename T>
bool chmax(T &a, T b)
{
  if (b > a)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, T b)
{
  if (b < a)
  {
    a = b;
    return true;
  }
  return false;
}

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define SZ(x) (int)x.size()
#define vec vector
#define dbg(x) cout << (#x) << " : " << x << endl;
using ll = long long;
using ull = unsigned long long;

void solve()
{
  int n, q;
  cin >> n >> q;
  vec<int> a(n + 1);
  for(int i = 1; i <= n; i++)
    cin >> a[i];
  while(q--)
  {
    int t;
    cin >> t;
    if(t == 1)
    {
      int i, j;
      cin >> i >> j;
      a[i] = j;
    }
    else if(t == 2)
    {
      int l, u;
      cin >> l >> u;
      int res = 0;
      for(int i = l; i <= u; i++)
      {
        for(int j = i; j <= u; j++)
        {
          int x = 0;
          for(int k = i; k <= j; k++)
          {
            x = (x ^ a[k]);
          }
          res = (res ^ x);
        }
      }
      cout << res << '\n';
    }
  }
}

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1;
  while (t--)
  {
    solve();
    cout << (t ? "\n" : "");
  }
}

• Subtask 1: 12 / 12
• Subtask 2: 18 / 18
• Subtask 3: 0 / 25
• Subtask 4: 0 / 20
• Subtask 5: 0 / 25