CS Course HDU
来源:互联网 发布:淘宝查看同行店铺数据 编辑:程序博客网 时间:2024/04/28 03:30
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 integersa1,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 exceptap .
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
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
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.
Then n non-negative integers
After that there are q positive integers
3 31 1 1123
1 1 01 1 01 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;}
阅读全文
0 0
- HDU 6186 CS Course
- CS Course HDU
- HDU 6186 && 2017广西邀请赛:CS Course
- HDU 6186 CS Course 简单思维题
- 【位运算】hdu-6186 CS Course
- 【2017广西邀请赛】hdu 6186 CS Course
- hdu 6186 CS Course (前缀+后缀)
- hdu 6186 CS Course 前缀后缀问题
- 【位运算知识+前缀思路+后缀思路】CS Course HDU
- HDU 6186 CS Course(线段树区间操作)
- HDU 6186 CS Course(位运算 思维)
- hdu 6186 CS Course (前后缀求区间问题)
- HDU6186-CS Course
- hdu 6186 CS Course 2017ACM/ICPC广西邀请赛-重现赛
- HDU-6186 CS Course (线段树)(2017ACM/ICPC广西邀请赛)
- 广西 2017 邀请赛 CS Course
- 广西2017邀请赛 Problem E CS Course
- 广西2017邀请赛 E: CS Course &,|,^ 运算
- 购物车_信息添加
- 网络地址图片二次采样(HttpURLConnection)
- acdream 1726 A Math game(部分和)
- 属性动画的简单使用
- PyTorch vs. TensorFlow之一个月用户体验
- CS Course HDU
- Intellij 启动报错probably the path to GIt executable is not valid
- 洛谷P1036 选数(回溯法)
- 探究神经机器翻译中的注意力机制:指哪儿打哪儿,还是指哪儿打一片?
- All In! 我学会了用强化学习打德州扑克
- 编程题1
- java 输入一个数 字符 字符串
- 说好的自动化呢?特斯拉 Model 3 仍依赖人工组装导致生产延迟
- 手把手教你可视化交叉验证代码,提高模型预测能力