oj.uz

Submission #446748

# Submission time Handle Problem Language Result Execution time Memory
446748 2021-07-23T07:59:59 Z Khizri XORanges (eJOI19_xoranges) C++17
30 / 100
 1000 ms 11292 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
ll t=1,n,arr[mxn],q;
void solve(){
	cin>>n>>q;
	for(int i=1;i<=n;i++){
		cin>>arr[i];
	}
	while(q--){
		map<ll,ll>mp;
		ll k,l,r;
		cin>>k>>l>>r;
		if(k==1){
			arr[l]=r;
		}
		else{
			for(int i=l;i<=r;i++){
				mp[arr[i]]+=((i-l+1)*(r-i+1));
			}
			ll ans=0;
			for(auto it=mp.begin();it!=mp.end();it++){
				if((it->S)%2==1){
					ans^=(it->F);
				}
			}
			cout<<ans<<endl;
		}
	}
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	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 236 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 352 KB Output is correct
2 Correct 12 ms 352 KB Output is correct
3 Correct 13 ms 332 KB Output is correct
4 Correct 33 ms 356 KB Output is correct
5 Correct 31 ms 460 KB Output is correct

Subtask #3
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 236 KB Output is correct
6 Correct 12 ms 352 KB Output is correct
7 Correct 12 ms 352 KB Output is correct
8 Correct 13 ms 332 KB Output is correct
9 Correct 33 ms 356 KB Output is correct
10 Correct 31 ms 460 KB Output is correct
11 Correct 828 ms 772 KB Output is correct
12 Correct 829 ms 660 KB Output is correct
13 Execution timed out 1093 ms 780 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 11292 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 236 KB Output is correct
6 Correct 12 ms 352 KB Output is correct
7 Correct 12 ms 352 KB Output is correct
8 Correct 13 ms 332 KB Output is correct
9 Correct 33 ms 356 KB Output is correct
10 Correct 31 ms 460 KB Output is correct
11 Correct 828 ms 772 KB Output is correct
12 Correct 829 ms 660 KB Output is correct
13 Execution timed out 1093 ms 780 KB Time limit exceeded
14 Halted 0 ms 0 KB -