Omenat

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#define ll long long
#define N (2<<16)
 
using namespace std;
 
long v[2*N];
long m[2*N];
 
void c (int k, long a) {
	k += N;
	v[k] = a;
	//cout<<"foo: "<<k<<endl;
	m[k] = a;
	for (k /= 2; k > 0; k /= 2) {
		v[k] = v[2*k] + v[2*k+1];
		m[k] = min(m[2*k], v[2*k+1]);
	}
}
 
void qu (long a, long b) {
	a += N;
	b += N;
	long w = (b - a + 1);
	long s = 0;
	long mn = 100000;
	while (a <= b) {
		if (a % 2 == 1) {
			mn = min(mn, m[a]);
			s += v[a++];
		}
		if (b % 2 == 0) {
			mn = min(mn, m[b]);
			s += v[b--];
		}
		a /= 2;
		b /= 2;
	}
 
	s -= (mn - 1) * w;
	//cout<<s<<" "<<(w * (w + 1) / 2)<<endl;
	if (s == (w * (w + 1) / 2)) cout<<"10-4"<<endl;
	else cout<<"QAQ"<<endl;
}
 
int main () {
	int n, q;
	cin>>n>>q;
	for (int i = 0; i < n; i++) {
		int k;
		cin>>k;
		c(i + 1, k);
	}
	for (int i = 0; i < q; i++) {
		char x;
		cin>>x;
		int a, b;
		cin>>a>>b;
		//a--; b--;
		if (x == '!') {
			long l = v[a + N];
			//cout<<l<<" "<<(a + N)<<":"<<v[b + N]<<" "<<(b + N)<<endl;
			c(a, v[b + N]);
			c(b, l);
		} else {
			qu(a, b);
		}
	}
}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR