oj.uz

Submission #1079965

# Submission time Handle Problem Language Result Execution time Memory
1079965 2024-08-29T05:09:57 Z timoni XORanges (eJOI19_xoranges) C++17
30 / 100
 1000 ms 5724 KB 
//don't copy pls)
/*TAAK ZDES NADO RECURSIU PISAT*/

//I'm not in the danger i am the DANGER
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define pb push_back
#define int long long
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define pii pair<int,int>
#define sigma signed
using namespace std;
using namespace __gnu_pbds;
const int N = 3e5 + 5;
int mod = 1e9 + 7;
const int INF = 1e18;
int n,q,a[N],p[N];
void Gold(){
	cin >> n >> q;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i];
		p[i] = p[i - 1] ^ a[i];
	}
	while(q--){
		int tp;
		cin >> tp;
		if(tp == 1){
			int x,y;
			cin >> x >> y;
			a[x] = y;
			for(int i = 1 ; i <= n ; i++){
				p[i] = p[i - 1] ^ a[i];
			}
		}
		else{
			int l,r;
			cin >> l >> r;
			int x = 0;
			map <int,int> mp;
			for(int j = 1 ; j <= r - l + 1 ; j++){
				for(int i = l + j - 1 ; i <= r ; i++){
					x ^= (p[i] ^ p[i - j]);
				}
			}
			cout << x << '\n';
		}
	}
}
sigma main(){
	//freopen("txt.in","r",stdin);
	//freopen("txt.out","w",stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	srand(time(0));
	int TT = 1;
	// cin >> TT;
	for(int i = 1 ; i <= TT ; i++){
		//cout << "Case " << i << ": ";
		Gold();
	}
}

Subtask #1
12.0 / 12.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 8 ms 348 KB Output is correct
3 Correct 9 ms 496 KB Output is correct
4 Correct 37 ms 344 KB Output is correct
5 Correct 32 ms 344 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 9 ms 496 KB Output is correct
9 Correct 37 ms 344 KB Output is correct
10 Correct 32 ms 344 KB Output is correct
11 Execution timed out 1069 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1052 ms 5724 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 8 ms 348 KB Output is correct
8 Correct 9 ms 496 KB Output is correct
9 Correct 37 ms 344 KB Output is correct
10 Correct 32 ms 344 KB Output is correct
11 Execution timed out 1069 ms 604 KB Time limit exceeded
12 Halted 0 ms 0 KB -