General
 
 
# Author Problem Lang Verdict Time Memory Sent Judged  
113049397 Practice:
Yang_Lin
1511G - 11 C++17 (GCC 9-64) Accepted 4929 ms 820 KB 2021-04-15 02:50:20 2021-04-15 02:50:20
→ Source
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;

int n, m, a[200005], ans, l, r, x, ii;

int main(){
    scanf("%d%d", &n, &m), a[n + 1] = 1 << 30;
    for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    sort(a + 1, a + n + 1), scanf("%d", &m);
    while(m--){
        scanf("%d%d", &l, &r), x = l;
        r = upper_bound(a + 1, a + n + 1, r) - a;
        l = upper_bound(a + 1, a + n + 1, l) - a;
        for(ii = l; ii < r; ++ii) ans ^= a[ii] - x;
        putchar("AB"[ans == 0]), ans = 0;
    }
    return 0;
}
?
Time: ? ms, memory: ? KB
Verdict: ?
Input
?
Participant's output
?
Jury's answer
?
Checker comment
?
Diagnostics
?
Click to see test details