oj.uz

Submission #638712

# Submission time Handle Problem Language Result Execution time Memory
638712 2022-09-07T05:14:32 Z SalihSahin XORanges (eJOI19_xoranges) C++17
55 / 100
 1000 ms 6680 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fastio cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0)
#define endl "\n"
#define all(v) v.begin(),v.end()
#define int long long
using namespace std;

const int INF = 1e17, MOD = 1e9 + 7, N = 6e5 + 5, MOD2 = 998244353;

int fpow(int a, int b){  // returns a to the power of b %MOD
 if(b == 0) return 1;
 if(b == 1) return a;
 int x = fpow(a,b/2)%MOD;
 if(b%2) return ((x*x)%MOD*a)%MOD;
 else return (x*x)%MOD;
}


int32_t main(){
  fastio;
  int n, q;
  cin>>n>>q;

  vector<int> a(n + 1);
  for(int i = 1; i <= n; i++){
    cin>>a[i];
  }

  while(q--){
    int type;
    cin>>type;

    if(type == 1){
        int ind, x;
        cin>>ind>>x;
        a[ind] = x;
    }
    else{ // type == 2
        int l, u;
        cin>>l>>u;
        if((u - l + 1)&1){
          int res = 0;
          for(int start = l; start <= u; start += 2){
          res ^= a[start];
          }
          cout<<res<<endl;
        }
        else{
            cout<<0<<endl;
        }
    }
  }
  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 6680 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Execution timed out 1084 ms 6680 KB Time limit exceeded
16 Halted 0 ms 0 KB -