oj.uz

답안 #525506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525506 2022-02-11T19:40:15 Z ammar2000 XORanges (eJOI19_xoranges) C++17
55 / 100
 1000 ms 2028 KB 
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,q,a[SI];
int main()
{
   fast
   cin>>n>>q;
   for (int i=1;i<=n;i++)
    cin>>a[i];
   while (q--)
   {
       ll f,l,r;
       cin>>f>>l>>r;
       if (f==1)
        a[l]=r;
       else
       {
           ll xo=0;
        for (int i=l;i<=r;i++)
            if ((i-r+1)*(l-i+1)%2)
               xo^=a[i];
        cout << xo<<"\n";
       }
   }
    // use scanf not cin
   return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 10 ms 556 KB Output is correct
13 Correct 28 ms 460 KB Output is correct
14 Correct 27 ms 452 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1090 ms 2028 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 324 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 7 ms 460 KB Output is correct
12 Correct 10 ms 556 KB Output is correct
13 Correct 28 ms 460 KB Output is correct
14 Correct 27 ms 452 KB Output is correct
15 Execution timed out 1090 ms 2028 KB Time limit exceeded
16 Halted 0 ms 0 KB -