首页 > 代码库 > hdu 4712 Hamming Distance 随机
hdu 4712 Hamming Distance 随机
Hamming Distance
Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)
Problem Description
(From wikipedia) For binary strings a and b the Hamming distance is equal to the number of ones in a XOR b. For calculating Hamming distance between two strings a and b, they must have equal length.
Now given N different binary strings, please calculate the minimum Hamming distance between every pair of strings.
Now given N different binary strings, please calculate the minimum Hamming distance between every pair of strings.
Input
The first line of the input is an integer T, the number of test cases.(0<T<=20) Then T test case followed. The first line of each test case is an integer N (2<=N<=100000), the number of different binary strings. Then N lines followed, each of the next N line is a string consist of five characters. Each character is ‘0‘-‘9‘ or ‘A‘-‘F‘, it represents the hexadecimal code of the binary string. For example, the hexadecimal code "12345" represents binary string "00010010001101000101".
Output
For each test case, output the minimum Hamming distance between every pair of strings.
Sample Input
2212345543214123456789ABCDEF0137F
Sample Output
67
Source
2013 ACM/ICPC Asia Regional Online —— Warmup
思路：涨知识，还可以随机；
#include<bits/stdc++.h>using namespace std;#define ll long long#define pi (4*atan(1.0))#define eps 1e-14const int N=1e5+10,M=4e6+10,inf=1e9+10,mod=1e9+7;const ll INF=1e18+10;int getnum(char a){ if(a>=‘0‘&&a<=‘9‘) return a-‘0‘; return a-‘A‘+10;}int check(int x,int y){ int sum=0; while(x||y) { if(x%2!=y%2) sum++; x>>=1; y>>=1; } return sum;}char ch[N][10];int mp[20][20];int main(){ for(int i=0;i<16;i++) { for(int t=0;t<16;t++) mp[i][t]=check(i,t); } int T; scanf("%d",&T); while(T--) { int x; scanf("%d",&x); for(int i=0;i<x;i++) scanf("%s",ch[i]); int ans=inf; for(int i=0;i<=1000000;i++) { int k=0; int n=rand()%x; int m=rand()%x; if(n==m)continue; for(int t=0;t<5;t++) k+=mp[getnum(ch[n][t])][getnum(ch[m][t])]; ans=min(ans,k); } printf("%d\n",ans); } return 0;}
hdu 4712 Hamming Distance 随机
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。