제출 #1219489

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219489		Solikha	XORanges (eJOI19_xoranges)	C++17	30 / 100	1095 ms	2008 KiB

xoranges

//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <random>
#include <chrono>
using namespace std;
#define int long long
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ss second
#define ff first
#define pb push_back 
using ull = unsigned long long;
 
void solve()
{
  int n, q; cin >> n >> q; 
  vector<int> v(n);
  for(int &i : v) cin >> i;

  while(q--){
    int t; cin >> t;
    if(t == 1){
      int i, x; cin >> i >> x;
      v[i - 1] = x;
    }else{
      int l, r; cin >> l >> r;
      int ans = 0;
      int x = 0;
      for(int i = l - 1; i < r; i++){
        t = v[i];
        x ^= v[i];
        for(int j = i + 1; j < r; j ++){
          t ^= v[j]; ans ^= t;
        }
      }
      cout << (ans ^ x) << endl;
    }
  }
}
 
signed main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  int t = 1; //cin >> t;
  while(t--){
    solve();
    cout << endl;
  }
  return 0;
}

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