HDOJ 4876 ZCC loves cards
来源:互联网 发布:新开店铺淘宝扶持政策 编辑:程序博客网 时间:2024/06/02 07:28
枚举组合,在不考虑连续的情况下判断是否可以覆盖L...R,对随机数据是一个很大的减枝.
通过检测的暴力计算一遍
ZCC loves cards
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1346 Accepted Submission(s): 335
Problem Description
ZCC loves playing cards. He has n magical cards and each has a number on it. He wants to choose k cards and place them around in any order to form a circle. He can choose any several consecutive cards the number of which is m(1<=m<=k) to play a magic. The magic is simple that ZCC can get a number x=a1⊕a2...⊕am, which ai means the number on the ith card he chooses. He can play the magic infinite times, but once he begin to play the magic, he can’t change anything in the card circle including the order.
ZCC has a lucky number L. ZCC want to obtain the number L~R by using one card circle. And if he can get other numbers which aren’t in the range [L,R], it doesn’t matter. Help him to find the maximal R.
ZCC has a lucky number L. ZCC want to obtain the number L~R by using one card circle. And if he can get other numbers which aren’t in the range [L,R], it doesn’t matter. Help him to find the maximal R.
Input
The input contains several test cases.The first line in each case contains three integers n, k and L(k≤n≤20,1≤k≤6,1≤L≤100). The next line contains n numbers means the numbers on the n cards. The ith number a[i] satisfies 1≤a[i]≤100.
You can assume that all the test case generated randomly.
You can assume that all the test case generated randomly.
Output
For each test case, output the maximal number R. And if L can’t be obtained, output 0.
Sample Input
4 3 12 3 4 5
Sample Output
7Hint⊕ means xor
Author
镇海中学
Source
2014 Multi-University Training Contest 2
Recommend
We have carefully selected several similar problems for you: 4881 4880 4879 4878 4877
#include <iostream>#include <cstring>#include <cstdio>#include <algorithm>using namespace std;int n,k,m,a[30],save[30],have[30],R,L;bool vis[3000],cx[200];void ckMax(int num,int sum){vis[sum]=true;if(num==k) return ;ckMax(num+1,sum^save[num]);ckMax(num+1,sum);}bool ck(){ memset(vis,0,sizeof(vis)); ckMax(0,0); for(int i=L;i<=R;i++) { if(vis[i]==false)return false; } return true;}void CALU() { if (!ck()) return; for(int i=0;i<k;i++) have[i]=save[i]; do { memset(vis,0,sizeof(vis)); for(int i=0;i<k;i++) { int x=0; for(int j=0;j<k;j++) { x^=have[(i+j)%k]; vis[x]=true; } } for(int i=L;i<=L+k*k;i++) { if(vis[i]==false) break; R=max(R,i); } }while(next_permutation(have,have+k-1));} void dfs(int num,int id){if(num==k){CALU();return ;}for(int i=id;i<n;i++){save[num]=a[i];dfs(num+1,i+1);}}int main(){while(scanf("%d%d%d",&n,&k,&L)!=EOF){R=L-1;for(int i=0;i<n;i++)scanf("%d",a+i);sort(a,a+n);dfs(0,0);if(R<L) printf("0\n");else printf("%d\n",R);}return 0;}
0 0
- HDOJ 4876 ZCC loves cards
- [HDOJ 4876] ZCC loves cards [搜索]
- HDOJ 4876 ZCC loves cards(搜索)
- HDU 4876 ZCC loves cards
- HDU-4876-ZCC loves cards
- hdu 4876 ZCC loves cards
- HDU 4876 ZCC loves cards
- HDU 4876 ZCC loves cards
- 【HDU 4876多校】ZCC loves cards【搜索】
- hdu 4876 ZCC loves cards(暴力)
- HDU 4876 ZCC loves cards(暴力剪枝)
- 【HDU】4876 ZCC loves cards 暴力
- hdu 4876 ZCC loves cards (搜索+剪枝)
- HDU4876 ZCC loves cards
- HDU4876:ZCC loves cards
- BZOJ3844: ZCC loves cards
- hdu 4876 ZCC loves cards(暴力+剪枝)
- hdu 4876 ZCC loves cards(暴搜+剪枝)
- 手动添加WM_CREATE消息映射
- POJ-1061 青蛙的约会-数论扩展欧几里德算法入门及推导
- bzoj1628 [Usaco2007 Demo]City skyline
- 关于利用Phongap+jQueryMobile来进行移动web应用开发心得
- 东软实训(二十七)
- HDOJ 4876 ZCC loves cards
- mysql> desc tablename; ERROR 1 (HY000): Can't create/write to file '/tmp/#sql_909_0.MYI'
- dfsgdfgfdhgdfhdfgdfgdfg
- poj 1703Find them Catch them
- 找工作笔试面试那些事儿(3)---内存管理那些事
- 重温sevlet jsp
- 贼心
- Mac下,批量删除.svn
- Android 标签控件