oj.uz

Submission #464083

# Submission time Handle Problem Language Result Execution time Memory
464083 2021-08-12T10:58:36 Z gagik_2007 XORanges (eJOI19_xoranges) C++17
55 / 100
 1000 ms 2004 KB 
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <unordered_set>
using namespace std;

#define ll long long
#define ff first
#define ss second

ll n, k, sum, m, s, f;
ll MOD = 1e9 + 7;
ll ttt;
ll a[200007];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int j = 0; j < k; j++) {
		ll id, c, d;
		cin >> id >> c >> d;
		if (id == 1) {
			a[c] = d;
		}
		else {
			ll ans = 0;
			ll m = 2 * n - c - d - 1;
			for (int i = c; i <= d; i++) {
				ll f = i - c + 1;
				ll x = min(f, m - f + 1);
				if (m * x % 2 != 0) {
					ans = ans ^ a[i];
				}
				//cout << a[i] << " " << cur[a[i]] << endl;
			}
			cout << ans << endl;
		}
	}
	return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 13 ms 332 KB Output is correct
12 Correct 13 ms 372 KB Output is correct
13 Correct 44 ms 380 KB Output is correct
14 Correct 47 ms 368 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1098 ms 2004 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 2 ms 204 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 2 ms 204 KB Output is correct
9 Correct 2 ms 204 KB Output is correct
10 Correct 2 ms 204 KB Output is correct
11 Correct 13 ms 332 KB Output is correct
12 Correct 13 ms 372 KB Output is correct
13 Correct 44 ms 380 KB Output is correct
14 Correct 47 ms 368 KB Output is correct
15 Execution timed out 1098 ms 2004 KB Time limit exceeded
16 Halted 0 ms 0 KB -