제출 #1140972

#제출 시각아이디문제언어결과실행 시간메모리
1140972huseynahmadli2010XORanges (eJOI19_xoranges)C++20
12 / 100
1095 ms1860 KiB
#include <bits/stdc++.h>

using namespace std;

#define int long long

const int sz=2e5+5;

const int INF=1e18;

const int MOD=1e9+7;

int arr[sz];

void solve()
{
    int n,q;
    
    cin>>n>>q;
    
    for(int i=1;i<=n;i++)
        cin>>arr[i];
    
    for(int i=0;i<q;i++)
    {
        int type,l,r;
        
        cin>>type>>l>>r;
        
        if(type==1)
            arr[l]=r;
        
        else
        {
            int res=0;
            
            for(int j=1;j<=(r-l+1);j++)
            {
                for(int k=l;k<=(r-j+1);k++)
                {
                    int cur=0;
                    
                    for(int p=0;p<j;p++)
                        cur=cur^arr[k+p];
                    
                    //cout<<i<<' '<<cur<<'\n';
                    
                    res=res^cur;
                }
            }
            
            cout<<res<<'\n';
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    //freopen("feast.in","r",stdin);
    //freopen("feast.out","w",stdout);
    
    int t=1;
    
    //cin>>t;
    
    while(t--)
    {
        solve();
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...