oj.uz

Submission #981565

# Submission time Handle Problem Language Result Execution time Memory
981565 2024-05-13T10:43:02 Z Nomio XORanges (eJOI19_xoranges) C++17
30 / 100
 49 ms 65536 KB 
#include<bits/stdc++.h>
using namespace std;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n, q;
	cin >> n >> q;
	int a[n + 1], b[n + 1][n + 1] {};
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			for(int k = i; k <= min(i + j - 1, n); k++) {
				b[i][j] = (b[i][j] ^ a[k]);
			}
		}
	}
	if(n <= 100) {
		while(q--) {
			int t, l, r;
			cin >> t >> l >> r;
			if(t == 1) {
				a[l] = r; 
			} else {
				int S = a[l];
				for(int i = l + 1; i <= r; i++) {
					S = (S ^ a[i]);
				}
				for(int i = 2; i <= r - l + 1; i++) {
					for(int j = l; j <= r - i + 1; j++) {
						int A = 0;
						for(int k = j; k <= j + i - 1; k++) {
							A = (A ^ a[k]);
						}
						S = (S ^ A);
					}
				}
				cout << S << '\n';
			}
		}
	} else if(n <= 500) {
		while(q--) {
			int t, l, r;
			cin >> t >> l >> r;
			int S = 0;
			for(int i = 1; i <= r - l + 1; i++) {
				for(int j = l; j <= r - i + 1; j++) {
					S = (S ^ b[j][i]);
				}
			}
			cout << S << '\n';
		}
	}
	return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1372 KB Output is correct
2 Correct 23 ms 1408 KB Output is correct
3 Correct 24 ms 1372 KB Output is correct
4 Correct 49 ms 1372 KB Output is correct
5 Correct 49 ms 1368 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 23 ms 1372 KB Output is correct
7 Correct 23 ms 1408 KB Output is correct
8 Correct 24 ms 1372 KB Output is correct
9 Correct 49 ms 1372 KB Output is correct
10 Correct 49 ms 1368 KB Output is correct
11 Runtime error 36 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 3 ms 348 KB Output is correct
6 Correct 23 ms 1372 KB Output is correct
7 Correct 23 ms 1408 KB Output is correct
8 Correct 24 ms 1372 KB Output is correct
9 Correct 49 ms 1372 KB Output is correct
10 Correct 49 ms 1368 KB Output is correct
11 Runtime error 36 ms 65536 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -