?
# | Author | Problem | Lang | Verdict | Time | Memory | Sent | Judged | |
---|---|---|---|---|---|---|---|---|---|
112986460 |
Practice: huangxiaohua |
1511G - 11 | C++17 (GCC 9-64) | Accepted | 4945 ms | 1020 KB | 2021-04-14 10:45:32 | 2021-04-14 10:45:32 |
#pragma GCC optimize("Ofast") #pragma GCC target("avx2") #include <bits/stdc++.h> using namespace std; int i,j,k,n,m,t,l,r,sb,x,y; char res[200500]; int main(){ scanf("%d%*d",&n); int v[n]; for(i=1;i<=n;i++){ scanf("%d",&v[i-1]); } sort(v,v+n); scanf("%d",&t); for(int T=0;T<t;T++){ scanf("%d%d",&x,&y); l=upper_bound(v,v+n,x)-v; r=upper_bound(v,v+n,y)-v; sb=0; for(i=l;i<r;i++){sb^=(v[i]-x);} res[T]="BA"[(bool)sb]; } puts(res); }
?
?
?
?