Kyselyt

#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;

const int N=1<<17;
pair<int, int> st[2*N];

pair<int, int> get(int a, int b){
	a+=N;
	b+=N;
	pair<int, int> r={N, -N};
	while (a<=b){
		if (a%2){
			r.F=min(r.F, st[a].F);
			r.S=max(r.S, st[a].S);
			a++;
		}
		if (!(b%2)){
			r.F=min(r.F, st[b].F);
			r.S=max(r.S, st[b].S);
			b--;
		}
		a/=2;
		b/=2;
	}
	return r;
}

int a[101010];
void upd(int i){
	st[i+N]={a[i], a[i]};
	for (i=(i+N)/2;i;i/=2){
		st[i]={min(st[i*2].F, st[i*2+1].F), max(st[i*2].S, st[i*2+1].S)};
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n,q;
	cin>>n>>q;
	for (int i=0;i<2*N;i++){
		st[i]={N, -N};
	}
	for (int i=1;i<=n;i++){
		cin>>a[i];
		upd(i);
	}
	for (int i=0;i<q;i++){
		char k;
		int l,r;
		cin>>k>>l>>r;
		if (k=='!'){
			swap(a[l], a[r]);
			upd(l);
			upd(r);
		}
		else{
			auto t=get(l, r);
			if (t.S-t.F==r-l){
				cout<<"10-4\n";
			}
			else{
				cout<<"QAQ\n";
			}
		}
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED