2017多校联合第七场1010/hdu 6129 Just do it(递推/杨辉三角)
来源:互联网 发布:iphone6移动数据开关 编辑:程序博客网 时间:2024/05/21 06:39
Just do it
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1203 Accepted Submission(s): 702
Problem Description
There is a nonnegative integer sequence a1...n of length n . HazelFan wants to do a type of transformation called prefix-XOR, which means a1...n changes into b1...n , where bi equals to the XOR value of a1,...,ai . He will repeat it for m times, please tell him the final sequence.
Input
The first line contains a positive integer T(1≤T≤5) , denoting the number of test cases.
For each test case:
The first line contains two positive integersn,m(1≤n≤2×105,1≤m≤109) .
The second line containsn nonnegative integers a1...n(0≤ai≤230−1) .
For each test case:
The first line contains two positive integers
The second line contains
Output
For each test case:
A single line containsn nonnegative integers, denoting the final sequence.
A single line contains
Sample Input
21 113 31 2 3
Sample Output
11 3 1
Source
2017 Multi-University Training Contest - Team 7
Recommend
liuyiding | We have carefully selected several similar problems for you: 6143 6142 6141 6140 6139
题目大意:
设定b【i】=a【1】^a【2】^a【3】^..................a【i】;
每进行一次,我们可以从a数组得到一个b数组。问进行m次的结果。
思路:
我们随手写下四项的前两次结果,不难看出,我们设定ans【i】【j】表示进行到第i次,第j个位子的答案的话,ans【i】【j】有推导式:
ans【i】【j】=ans【i-1】【j】^ans【i】【j-1】;
那么很显然,对于每一项,他的系数就是杨辉三角的值,那么如果当前位子系数为奇数的话,结果就会有贡献。
同样很显然,我们第i行,第j列的答案,其系数为C(i+j-2,j-1)【此时只考虑a的系数】;
那么我们只需要考虑第一项(a)对所有位子的结果的影响即可(因为b就相当于向后挪了一下递推即可)。
那么根据上述公式,考虑第一项(a)对所有位子的结果的影响然后递推一下就行了。
#include <iostream>#include <algorithm>#include <cstdio>#include <cmath>#include <cstring>#include <string>#include <string.h>#include <map>#include <set>#include <queue>#include <deque>#include <list>#include <bitset>#include <stack>#include <stdlib.h>#define lowbit(x) (x&-x)#define e exp(1.0)const int mod=1e9+7;const int inf=0x3f3f3f;//ios::sync_with_stdio(false);// auto start = clock();// cout << (clock() - start) / (double)CLOCKS_PER_SEC;typedef long long ll;typedef long long LL;using namespace std;const int maxn=2e5+10;ll a[maxn];ll b[maxn];int main(){ ios::sync_with_stdio(false); int T; cin>>T; while(T--) { memset(b,0,sizeof(b)); int n,m; cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++) { int x=i+m-2; int y=i-1; if((x&y)==y) { for(int j=i;j<=n;j++) b[j]^=a[j-i+1]; } } for(int i=1;i<n;i++) cout<<b[i]<<' '; cout<<b[n]<<endl; } return 0;}
阅读全文
0 0
- 2017多校联合第七场1010/hdu 6129 Just do it(递推/杨辉三角)
- 2017杭电多校第七场1010 Just do it(数论,杨辉三角)HDU 6129
- hdu6129 Just do it 2017多校第七场1010 杨辉三角+规律
- HDU 2017 多校联合训练赛7 1010 6129 Just do it 杨辉三角 组合数的奇偶判断
- hdu 6129 Just do it(杨辉三角)
- hdu 6129 Just do it(递推)
- Hdu 6129 Just do it【杨辉三角、规律】
- HDU 6129 Just do it(找规律+杨辉三角)
- hdu 6129 Just do it (杨辉三角)
- HDU 6129 Just do it【杨辉三角】
- hdu 6129 Just do it(递推)
- HDU 6129 Just do it(递推)
- 多校赛第七场1010 Just do it
- HDU 6129 Just do it(有点复杂的杨辉三角)
- HDU 6129 Just do it(杨辉三角+lucas \ 记忆化dp)
- hdu 6129 Just do it (规律递推)
- HDU 6129 Just do it【杨辉三角】【思维题】【好题】
- HDU 6129 Just do it【杨辉三角+思维+Lucas定理】
- View的scrollTo/scrollBy
- 简单分析cloudkitty的hashmap计费代码
- Oracle学习笔记day05——DDL语言
- 剑指offer:左旋转字符串
- String.format()的使用
- 2017多校联合第七场1010/hdu 6129 Just do it(递推/杨辉三角)
- effective C++ 条款三 解读
- org.apache.jasper.JasperException: Unable to compile class for JSP
- XML布局和代码快中设置前景/背景图片
- netifd支持的设备类型(netifd-2017-03-31)
- Playing with Numbers(Kattis
- Java 解决采集UTF-8网页空格变成问号乱码
- linux分区之gpt
- How to design DL model(2):Inception(v4)-ResNet and the Impact of Residual Connections on Learning