oj.uz

Submission #1099441

# Submission time Handle Problem Language Result Execution time Memory
1099441 2024-10-11T10:00:07 Z vjudge1 XORanges (eJOI19_xoranges) C++17
55 / 100
 1000 ms 2768 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long



signed main()
{
   int n, q; cin >> n >> q;
   vector<int> a(n + 1);
   for (int i = 1; i <= n; i++){
       cin >> a[i];
   }
    while(q--){
        int t, l, u; cin >> t >> l >> u;
        int x = 0;
        if (t == 2){
            if ((u - l + 1) % 2 == 0){
            cout << 0 << endl;
            }else{
                for (int i = l; i <= u; i+=2){
                    x ^= a[i];
                }
                cout << x << endl;
            }
        }else{
            a[l] = u;
        }
        
    }
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 6 ms 604 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 10 ms 348 KB Output is correct
14 Correct 10 ms 348 KB Output is correct

Subtask #4
0 / 20.0

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

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 6 ms 604 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 10 ms 348 KB Output is correct
14 Correct 10 ms 348 KB Output is correct
15 Execution timed out 1074 ms 2768 KB Time limit exceeded
16 Halted 0 ms 0 KB -