CS Course HDU - 6186

Little A has come to college and majored in Computer and Science. 

Today he has learned bit-operations in Algorithm Lessons, and he got a problem as homework. 

Here is the problem: 

You are giving n non-negative integers  a1,a2,⋯,an a1,a2,⋯,an, and some queries. 

A query only contains a positive integer p, which means you 
are asked to answer the result of bit-operations (and, or, xor) of all the integers except  ap ap. 

Input

There are no more than 15 test cases. 

Each test case begins with two positive integers n and p 
in a line, indicate the number of positive integers and the number of queries. 

2≤n,q≤105 2≤n,q≤105 

Then n non-negative integers  a1,a2,⋯,an a1,a2,⋯,an follows in a line,  0≤ai≤109 0≤ai≤109 for each i in range[1,n]. 

After that there are q positive integers  p1,p2,⋯,pq p1,p2,⋯,pqin q lines,  1≤pi≤n 1≤pi≤n for each i in range[1,q].

Output

For each query p, output three non-negative integers indicates the result of bit-operations(and, or, xor) of all non-negative integers except  ap ap in a line. 

Sample Input

3 3
1 1 1
1
2
3

Sample Output

1 1 0
1 1 0
1 1 0

题意：输入n和q两组数，n代表n个数，q代表q次询问，每次询问是输入一个数m，然后输出三个数，分别是除了第m个数以外的所有数的按位与按位或按位异或，三个值；

思路：开六个数组，直接模拟前缀和后缀暴力即可：

#include <stdio.h>
long long a[100005];
long long s1[100005] , S1[100005];
long long s2[100005] , S2[100005];
long long s3[100005] , S3[100005];
int main() {
	long long n , q , m;
	while(~scanf("%lld%lld",&n,&q)) {
		for(int i = 1; i <= n; i++) {
			scanf("%lld",&a[i]);
		}
		s1[1] = a[1];s2[1] = a[1];s3[1] = a[1];
		for(int i = 2; i <= n; i++) {//前缀 
			s1[i] = s1[i-1]|a[i];
			s2[i] = s2[i-1]&a[i];
			s3[i] = s3[i-1]^a[i];
		}
		S1[n] = a[n];S2[n] = a[n];S3[n] = a[n];
		for(int i = n - 1; i >= 1; i--) {//后缀 
			S1[i] = S1[i+1]|a[i];
			S2[i] = S2[i+1]&a[i];
			S3[i] = S3[i+1]^a[i];
		}
		for(int i = 0; i < q; i++) {
			scanf("%lld",&m);
			if(m == 1) {
				printf("%lld %lld %lld\n",S2[m+1] , S1[m+1] , S3[m+1]);
			}
			else if(m == n) {
				printf("%lld %lld %lld\n",s2[m-1] , s1[m-1], s3[m-1]);
			}
			else {
				printf("%lld %lld %lld\n",s2[m-1]&S2[m+1] , s1[m-1]|S1[m+1] , s3[m-1]^S3[m+1]);
			}
		}
	}
	return 0;
}