hdu_6186_前缀后缀_水_死于英语
2017-09-12 22:02
393 查看
CS Course
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, 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.
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
Then n non-negative integers a1,a2,⋯,an follows in a line, 0≤ai≤109 for each i in range[1,n].
After that there are q positive integers p1,p2,⋯,pqin q lines, 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 in a line.
Sample Input
3 3
1 1 1
1
2
3
Sample Output
1 1 0
1 1 0
1 1 0
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, 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.
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
Then n non-negative integers a1,a2,⋯,an follows in a line, 0≤ai≤109 for each i in range[1,n].
After that there are q positive integers p1,p2,⋯,pqin q lines, 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 in a line.
Sample Input
3 3
1 1 1
1
2
3
Sample Output
1 1 0
1 1 0
1 1 0
mean: 给你a数组: 求除了第i位 外所有数 &,|,^ 的值; answer: 求前缀后缀就好
#include<bits/stdc++.h> using namespace std; const int N=(int) 1e5+10; int a ,st1 ,st2 ,st3 ,ed1 ,ed2 ,ed3 ; int main() { int n,m,i,j; while(cin>>n>>m>>a[1]) { st1[1]=st2[1]=st3[1]=a[1]; for(i=2;i<=n;i++) { scanf("%d",&a[i]); st1[i]=st1[i-1]&a[i]; st2[i]=st2[i-1]|a[i]; st3[i]=st3[i-1]^a[i]; } ed1 =ed2 =ed3 =a ; for(i=n-1;i>=1;i--) { ed1[i]=ed1[i+1]&a[i]; ed2[i]=ed2[i+1]|a[i]; ed3[i]=ed3[i+1]^a[i]; } while(m--) { int x; scanf("%d",&x); if(x==1) printf("%d %d %d\n",ed1[2],ed2[2],ed3[2]); else if(x==n) printf("%d %d %d\n",st1[n-1],st2[n-1],st3[n-1]); else printf("%d %d %d\n",st1[x-1]&ed1[x+1],st2[x-1]|ed2[x+1],st3[x-1]^ed3[x+1]); } } return 0; }
相关文章推荐
- [广西邀请赛 - E] [HDU] 6186 - CS Course - 思维 - 位运算 or 前缀和和后缀和
- 【位运算知识+前缀思路+后缀思路】CS Course HDU - 6186
- hdu 6186 CS Course 前缀后缀问题
- hdu 6186 CS Course (前缀+后缀)
- HDU 6186 前缀后缀
- HDU 6186 CS Course 前缀和,后缀和
- hdu 2594 Simpsons’ Hidden Talents (KMP求第一串前缀和第二串后缀最大值)
- HDU 5147 Sequence II (线段树求前缀和、后缀和)
- HDU - 6025 Coprime Sequence(前缀,后缀,gcd)
- 英语单词最常用的328个前缀后缀(超全面)
- A + B for you again(HDU-1867)(最长公共前缀和后缀)
- HDU 2594 Simpsons’ Hidden Talents(KMP求前缀后缀子串匹配)
- 英语词根、词根、前缀、后缀大全
- HDU 4436 str2int 后缀数组 + 前缀和预处理 或 后缀自动机
- 英语前缀后缀一览表 - Tao of programmer - CSDNBlog
- HDU 6025 Coprime Sequence 前缀gcd + 后缀gcd
- hdu 6025 gcd+前缀和+后缀和
- hdu 4691 最长公共前缀 后缀数组 +lcp+rmq
- HDU 2594 Simpsons’ Hidden Talents 两字符串前缀与后缀的最长公共部分
- hdu 5317 RGCDQ (2015多校第三场第2题)素数打表+前缀和相减求后缀(DP)