HDU 5119 DP 滚动数组,dp求异或
2015-10-04 21:54
274 查看
Happy Matt Friends
Time Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 1544 Accepted Submission(s): 612
[align=left]Problem Description[/align]
Matt has N friends. They are playing a game together.
Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (exclusive-or) sum of the selected friends’magic numbers is no less than M , Matt wins.
Matt wants to know the number of ways to win.
[align=left]Input[/align]
The first line contains only one integer T , which indicates the number of test cases.
For each test case, the first line contains two integers N, M (1 ≤ N ≤ 40, 0 ≤ M ≤ 106).
In the second line, there are N integers ki (0 ≤ ki ≤ 106), indicating the i-th friend’s magic number.
[align=left]Output[/align]
For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1) and y indicates the number of ways where Matt can win.
[align=left]Sample Input[/align]
2 3 2 1 2 3 3 3 1 2 3
[align=left]Sample Output[/align]
Case #1: 4 Case #2: 2 HintIn the first sample, Matt can win by selecting: friend with number 1 and friend with number 2. The xor sum is 3. friend with number 1 and friend with number 3. The xor sum is 2. friend with number 2. The xor sum is 2. friend with number 3. The xor sum is 3. Hence, the answer is 4.
[align=left]Source[/align]
2014ACM/ICPC亚洲区北京站-重现赛(感谢北师和上交)
[align=left]Recommend[/align]
liuyiding
让求从n个数中任取任意个数(可以取0个);
看可以将取出的所有数异或之后有多少>=m的取法
#include <iostream> #include <cstdio> #include <algorithm> #include<cstring> using namespace std; long long f[2][1100100]; //会RE int a[45]; int main() { int t,ii,n,i,j,Min,m; long long ans; scanf("%d",&t); for (ii=1; ii<=t; ii++) { scanf("%d%d",&n,&m); for (i=1; i<=n; i++) scanf("%d",&a[i]); memset(f,0,sizeof(f)); f[0][0]=1; ans=0; for (i=1; i<=n; i++) for (j=0; j<1000000; j++) f[i%2][j]=f[(i-1)%2][j]+f[(i-1)%2][j^a[i]]; //会异或之后 RE,所以开大点 for (i=m; i<1000000; i++) ans+=f[n%2][i]; printf("Case #%d: %lld\n",ii,ans); } }
#include <iostream> #include<cstring> #include<cstdio> #include<set> #define LL long long using namespace std; const int maxn = 1000010; LL dp[45][maxn]; int a[45]; int main() { int T; int n,m; int cas = 0; scanf("%d",&T); while(T--) { memset(dp,0,sizeof(dp)); scanf("%d%d",&n,&m); for(int i=1; i<=n; i++) { scanf("%d",&a[i]); } LL ans = 0; dp[0][0] = 1; //取0个数时为1 for(int i=1; i<=n; i++) //将所有运算结果保存在[i][j]j中,i表示运算到了第i+1个数了. { for(int j=0; j<maxn; j++) { dp[i][j] += dp[i-1][j]; dp[i][(j^a[i])] += dp[i-1][j]; } } for(int i = m;i < maxn; i++) ans+=dp [i]; printf("Case #%d: %I64d\n",++cas,ans); } return 0; } #include<iostream> #include<cstring> #include<cstdio> const int Maxn =1000000; using namespace std; int a[100]; long long dp[42][1000100]; int main() { int n,T,m; while(~scanf("%d",&T)) { int Case=0; while(T--) { Case++; memset(dp,0,sizeof(dp)); scanf("%d%d",&n,&m); for(int i=0; i<n; i++) scanf("%d",&a[i]); dp[0][0]=1; long long ans=0; for(int i=0; i<n; i++) { for(int j=0; j<=Maxn; j++) //将所有运算结果保存在[i][j]j中,i表示运算到了第i+1个数了. { dp[i+1][j]+=dp[i][j]; dp[i+1][(j^a[i])]+=dp[i][j]; if((j^a[i])>=m) //>的优先级大于^ ans+=dp[i][j]; } } if(m==0) //也可以选0个数 ans++; printf("Case #%d: %lld\n",Case,ans); } } }
相关文章推荐
- OpenGL ES开发中遇到call to OpenGL ES API with no current context (logged once per thread) 问题原因
- JS(获得当前时间并且用2015-01-01格式表示)
- JavaScript中字符串的使用
- Linux 系统内核的调试
- 计算机中数据的表示和运算
- 免费超大量邮件发送服务Amazon SES和Mailgun提供SMTP和API支持
- Robot's Task(模拟)
- Android基础学习之AsyncTask(异步任务处理类)二
- 惠普实训第一阶段总结
- 几种常用的ios设计模式
- Extjs Web Desktop申请书
- Java中final、finally、finalize的区别
- 如此胆怯——致开口说英语
- 文章标题
- 取样
- 我写了一个高并发的BlockingQueue,有兴趣的可以看看
- Codeforces 583c GCD Table
- BestCoder Round #26 HDU5158 Have meal
- 模板和宏的区别
- [深入理解Java虚拟机]第二章 实战 :OutOfMemoryError异常