Kyselyt

input/code.cpp: In member function 'LL MinSegTree::set(LL, LL)':
input/code.cpp:34:5: warning: no return statement in function returning non-void [-Wreturn-type]
     }
     ^
input/code.cpp: In member function 'LL MaxSegTree::set(LL, LL)':
input/code.cpp:69:5: warning: no return statement in function returning non-void [-Wreturn-type]
     }
     ^

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>

typedef long long LL;
using namespace std;

LL next_pow_2(LL n){
    LL x = 1;
    while(x < n) x *= 2;
    return x;
}

class MinSegTree{
public:
    vector<LL> v;
    LL n;
    
    MinSegTree(LL size){
        n = next_pow_2(size);
        v.resize(2*n,1e9);
    }
    
    LL set(LL index, LL value){
        index += n;
        v[index] = value;
        index /= 2;
        while(index != 0){
            v[index] = min(v[index*2], v[index*2 + 1]);
            index /= 2;
        }
    }
    
    LL get(LL l, LL r){
        LL ans = 1e9;
        l += n;
        r += n;
        while(l <= r){
            if(l % 2 == 1) ans = min(ans, v[l++]);
            if(r % 2 == 0){
                ans = min(ans, v[r--]);
            }
            l /= 2; r /= 2;
        }
        return ans;
    }
};

class MaxSegTree{
public:
    vector<LL> v;
    LL n;
    
    MaxSegTree(LL size){
        n = next_pow_2(size);
        v.resize(2*n,0);
    }
    
    LL set(LL index, LL value){
        index += n;
        v[index] = value;
        index /= 2;
        while(index != 0){
            v[index] = max(v[index*2], v[index*2 + 1]);
            index /= 2;
        }
    }
    
    LL get(LL l, LL r){
        LL ans = 0;
        l += n;
        r += n;
        while(l <= r){
            if(l % 2 == 1) ans = max(ans, v[l++]);
            if(r % 2 == 0) ans = max(ans, v[r--]);
            l /= 2; r /= 2;
        }
        return ans;
    }
};

int main(){
    LL n, q;
    cin >> n >> q;
    MinSegTree minTree(n);
    MaxSegTree maxTree(n);
    for(int i = 0; i < n; i++){
        LL x; cin >> x;
        minTree.set(i,x);
        maxTree.set(i,x);
    }
    
    for(int i = 0; i < q; i++){
        char type; cin >> type;
        LL l,r; cin >> l >> r; l--; r--;
        if(type == '!'){
            LL lx = minTree.get(l,l);
            LL rx = minTree.get(r,r);
            minTree.set(l,rx);
            minTree.set(r,lx);
            maxTree.set(l,rx);
            maxTree.set(r,lx);
        } else{
            if(maxTree.get(l,r) - minTree.get(l,r) == 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