POJ1013-Counterfeit Dollar

Counterfeit Dollar

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 50542		Accepted: 15817

Description

Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even though its color and size make it indistinguishable from the real silver dollars. The counterfeit coin has a different weight from the other coins but Sally does not know if it is heavier or lighter than the real coins. 
Happily, Sally has a friend who loans her a very accurate balance scale. The friend will permit Sally three weighings to find the counterfeit coin. For instance, if Sally weighs two coins against each other and the scales balance then she knows these two coins are true. Now if Sally weighs 
one of the true coins against a third coin and the scales do not balance then Sally knows the third coin is counterfeit and she can tell whether it is light or heavy depending on whether the balance on which it is placed goes up or down, respectively. 
By choosing her weighings carefully, Sally is able to ensure that she will find the counterfeit coin with exactly three weighings.

Input

The first line of input is an integer n (n > 0) specifying the number of cases to follow. Each case consists of three lines of input, one for each weighing. Sally has identified each of the coins with the letters A--L. Information on a weighing will be given by two strings of letters and then one of the words ``up'', ``down'', or ``even''. The first string of letters will represent the coins on the left balance; the second string, the coins on the right balance. (Sally will always place the same number of coins on the right balance as on the left balance.) The word in the third position will tell whether the right side of the balance goes up, down, or remains even.

Output

For each case, the output will identify the counterfeit coin by its letter and tell whether it is heavy or light. The solution will always be uniquely determined.

链接

一、题意

        一共有十二枚硬币，其中有一枚假币，假币和真币只有质量上的区别，并且目前不知道比真比轻还是重。现在称重三次，给定天平的状态，在保证有解的情况下，问哪枚是假币，它比真比轻还是重。

二、思路

        因为题目保证有解，所以假币出现的次数必定等于天平不平衡的次数。这种情况下，对于轻的一面所有硬币都-1权重，重的一面所有硬币都+1权重，对于等重的两边都设置权重为一个特殊值。最后判断哪个硬币权重等于不平衡次数就可以，根据正负号可以判断假币的轻重。

三、代码

#include <iostream>
#include <sstream>
#include <iomanip>
#include <string>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;
typedef long long ll;
const int MAXN = 20;
const int MOD7 = 1000000007;
const int MOD9 = 1000000009;
const int INF = 2000000000;//0x7fffffff
const double EPS = 1e-9;
const double PI = 3.14159265358979;
const int dir_4r[] = { -1, 1, 0, 0 };
const int dir_4c[] = { 0, 0, -1, 1 };
const int dir_8r[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
const int dir_8c[] = { -1, 0, 1, -1, 1, -1, 0, 1 };

int counter[MAXN];
char l[MAXN], r[MAXN], str[MAXN];

int main() {
	int n;
	
	scanf("%d", &n);
	while (n--) {
		int bad = 0;//记录假币出现的次数
		memset(counter, 0, sizeof(counter));

		for (int t = 0; t < 3; ++t) {
			scanf("%s%s%s", l, r, str);
			if (str[0] == 'e') {
				//天平平衡，不可能出现假币
				for (int i = 0; l[i]; ++i) {
					counter[l[i] - 'A'] = 10;
					counter[r[i] - 'A'] = 10;
				}
			}
			else if (str[0] == 'u') {
				for (int i = 0; l[i]; ++i) {
					counter[l[i] - 'A']++;//左边可能出现较重的假币
					counter[r[i] - 'A']--;//右边可能出现较轻的假币
				}
				bad++;
			}
			else {
				for (int i = 0; l[i]; ++i) {
					counter[l[i] - 'A']--;//左边可能出现较轻的假币
					counter[r[i] - 'A']++;//右边可能出现较重的假币
				}
				bad++;
			}
		}

		for (int i = 0; i < 12; ++i) {
			if (counter[i] == bad)
				printf("%c is the counterfeit coin and it is heavy.\n", 'A' + i);
			else if (counter[i] == -bad)
				printf("%c is the counterfeit coin and it is light.\n", 'A' + i);
		}
	}

	//system("pause");
	return 0;
}