제출 #1168528

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1168528		al95ireyiz	XORanges (eJOI19_xoranges)	C++20	100 / 100	78 ms	6316 KiB

xoranges

// Sometimes we try to understand errors we shouldn't...
#pragma GCC optimize("O3")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("no-stack-protector")
#include<bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using Tree=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statisticslmode_update>;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
// TEMPLATE
string sp=" ";
#define fr first
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define mkp make_pair
#define qll queue<ll>
#define dqll deque<ll>
#define mll map<ll,ll>
#define vll vector<ll>
#define er(x) erase(x)
#define pll pair<ll,ll>
#define ull unsigned ll
#define mne min_element
#define mxe max_element
#define rs(x) resize(x)
#define vpll vector<pll>
#define vvll vector<vll>
#define pq priority_queue
#define len(x)(ll)x.size()
#define lcm(x,y) x/__gcd(x,y)*y
#define all(x) x.begin(),x.end()
#define umll unordered_map<ll,ll>
#define lg2(x)(63-__builtin_clzll(x))
#define precision(x) fixed<<setprecision(x)
#define popcnt(x)(ll)__builtin_popcountll(x)
template<typename t1,typename t2>istream&operator>>(istream &is,pair<t1,t2>&x){return is>>x.fr>>x.sc;}
template<typename t1,typename t2>ostream&operator<<(ostream &os,pair<t1,t2>&x){return os<<x.fr<<' '<<x.sc;}
template<typename t1>istream&operator>>(istream &is,vector<t1>&vc){for(t1 &j:vc)is>>j;return is;}
template<typename t1>ostream&operator<<(ostream &os,vector<t1>&vc){for(t1 &j:vc)os<<j<<sp;return os;}
// #define ll int_fast32_t
// #define ll int_fast64_t
// #pragma GCC optimize("O2")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
const ll INF=1e9;
const ll INFL=1e18;
const ll MOD=1e9+7;
// const ll MOD=998244353;
const ll maxn=2e5+5;
// TEMPLATE
ll n,m,k=0;
inline void prc(){}
ll fw[maxn][2];
void upd(ll i, ll val, ll pos){
    for(;i<=n;i+=i&-i) fw[i][pos] ^= val;
}
ll get(ll i, ll pos){
    ll cv = 0;
    for(;i>0;i-=i&-i) cv ^= fw[i][pos];
    return cv;
}
void _(){
    cin>>n>>m;
    vll v(n+1);
    for(ll i=1;i<=n;i++) cin>>v[i], upd(i, v[i], i%2);
    for(ll i=0,t,a,b;i<m;i++){
        cin>>t>>a>>b;
        if(t == 1){
            ll d = b ^ v[a];
            upd(a, d, a%2);
            v[a] = b;
        }
        else{
            if(a%2 != b%2){ // cut uzunluq
                ll cv = 0;
                // for(auto i : {0, 1}) cv ^= (get(b, i) ^ get(a-1, i));
                cout<<cv<<'\n';
            }
            else{ // tek uzunluq
                cout<<(get(b, a%2) ^ get(a-1, a%2))<<'\n';
            }
        }
    }
}
signed main(){
    clock_t testcaseruntime=clock();
    cin.tie(0)->sync_with_stdio(0);
    prc();
    ll t=1;
    // cin>>t;
    for(ll tt=1;tt<=t;tt++){
        // cout<<"Case "<<tt<<": ";
        _();
    }
    cerr<<"\n\033[1;31mTime: \033[1;30m"<<(double)(clock()-testcaseruntime)/CLOCKS_PER_SEC<<"\033[1;32m seconds"<<'\n';
}

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