이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define INF 1e16
#define fi first
#define se second
#define pb push_back
#define in insert
#define speedup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
//--------------------------------|
const int DIM=2e5+7;
ll n,m,k,l,r,q,t;
ll a[DIM];
//--------------------------------|
int main()
{
speedup;
cin >> n >> q;
for (int i=1;i<=n;i++)
{
cin >> a[i];
}
while(q--)
{
cin >> t;
if (t==1)
{
cin >> k >> l;
a[k]=l;
}
else
{
cin >> l >> r;
if ((r-l+1)%2==0) cout << 0 << endl;
else
{
ll tmp=1;
ll res=0;
for (int i=l;i<=r;i++)
{
if (tmp%2!=0) res^=a[i];
tmp++;
}
cout << res << endl;
}
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |