Google code jam round 1A 2014 : A

Problem A. Charging Chaos

This contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guide to get started.

Small input 8 points	Solve A-small Judge's response for last submission: Correct.
Large input 17 points	Solve A-large Judge's response for last submission: Correct.

Problem

Shota the farmer has a problem. He has just moved into his newly built farmhouse, but it turns out that the outlets haven't been configured correctly for all of his devices. Being a modern farmer, Shota owns a large number of smartphones and laptops, and even owns a tablet for his favorite cow Wagyu to use. In total, he owns N different devices.

As these devices have different specifications and are made by a variety of companies, they each require a different electric flow to charge. Similarly, each outlet in the house outputs a specific electric flow. An electric flow can be represented by a string of 0s and 1s of length L.

Shota would like to be able to charge all N of his devices at the same time. Coincidentally, there are exactly N outlets in his new house. In order to configure the electric flow from the outlets, there is a master control panel with L switches. The i^th switch flips the i^th bit of the electric flow from each outlet in the house. For example, if the electric flow from the outlets is:

Outlet 0: 10
Outlet 1: 01
Outlet 2: 11

Then flipping the second switch will reconfigure the electric flow to:

Outlet 0: 11
Outlet 1: 00
Outlet 2: 10

If Shota has a smartphone that needs flow "11" to charge, a tablet that needs flow "10" to charge, and a laptop that needs flow "00" to charge, then flipping the second switch will make him very happy!

Misaki has been hired by Shota to help him solve this problem. She has measured the electric flows from the outlets in the house, and noticed that they are all different. Decide if it is possible for Shota to charge all of his devices at the same time, and if it is possible, figure out the minimum number of switches that needs to be flipped, because the switches are big and heavy and Misaki doesn't want to flip more than what she needs to.

Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of three lines. The first line contains two space-separated integers N and L. The second line contains N space-separated strings of length L, representing the initial electric flow from the outlets. The third line also contains N space-separated strings of length L, representing the electric flow required by Shota's devices.

Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the minimum number of switches to be flipped in order for Shota to charge all his devices. If it is impossible, y should be the string "NOT POSSIBLE" (without the quotes). Please note that our judge is not case-sensitive, but it is strict in other ways: so although "not  possible" will be judged correct, any misspelling will be judged wrong. We suggest copying/pasting the string NOT POSSIBLE into your code.

Limits

1 ≤ T ≤ 100.
No two outlets will be producing the same electric flow, initially.
No two devices will require the same electric flow.

Small dataset

1 ≤ N ≤ 10.
2 ≤ L ≤ 10.

Large dataset

1 ≤ N ≤ 150.
10 ≤ L ≤ 40.

Sample

Input	Output
3 3 2 01 11 10 11 00 10 2 3 101 111 010 001 2 2 01 10 10 01	Case #1: 1 Case #2: NOT POSSIBLE Case #3: 0

Explanation

In the first example case, Misaki can flip the second switch once. The electric flow from the outlets becomes:

Outlet 0: 00
Outlet 1: 10
Outlet 2: 11

Then Shota can use the outlet 0 to charge device 1, the outlet 1 to charge device 2, outlet 2 to charge device 0. This is also a solution that requires the minimum amount number of switches to be flipped.

题意：给两个01组成的矩阵，有一种翻转操作，可以把其中的一列数取反（1变0,0变1），问最少需要几次翻转，能使得左边矩阵里的每一行都可以在右边矩阵有唯一一行与其相等。

做法：以左边第一列为基准，分别与右边矩形的每一行匹配，发现需要翻转哪几行，然后把右边矩阵全部按照规则翻转，排序判断是否匹配，取最小值即可。复杂度O(n^3logn).

翻转操作可以用 异或 来实现。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<stdlib.h>
#include<string>
using namespace std;
#define maxn 100005
long long n1[200],n2[200];
long long tran(char x[]){
	long long ans = 0;
	int len = strlen(x);
	for (int i = 0; i < len; i++)
	{
		ans *= 2;
		if(x[i] == '1')ans++;
	}
	return ans;
}
int one(long long t){
	if(t == 0)return 0;
	int ans = 1;
	while(t&(t-1)){
		ans++;
		t &= (t-1);
	}
	return ans;
}
int main(){
	freopen("A-large-practice.in","r",stdin);
	freopen("A-large-out.txt","w",stdout);
	int cas = 0;
	int t,n,l;
	cin>>t;
	char tt[200];
	while(t--){
		cin>>n>>l;
		for (int i = 0; i < n; i++)
		{
			cin>>tt;n1[i] = tran(tt);
		}
		sort(n1,n1+n);
		for (int i = 0; i < n; i++)
		{
			cin>>tt;n2[i] = tran(tt);
		}
		int ans = maxn;
		long long tmp[200];
		int k;
		for (int i = 0; i < n; i++)
		{
			long long tp = 0;
			tp = n1[0] ^ n2[i];
			for (k = 0; k < n; k++)
			{
				tmp[k] = n2[k] ^ tp;
			}
			sort(tmp,tmp+n);
			for (k = 0; k < n; k++)
			{
				if(tmp[k] == n1[k]);
				else break;
			}
			if(k == n)ans = min(ans,one(tp));
		}
		printf("Case #%d: ",++cas);
		if(ans == maxn)cout<<"NOT POSSIBLE"<<endl;
		else cout<<ans<<endl;
	}
	return 0;
}