Timus 1644. A Whole Lot of Walnuts 算法

Ten big walnuts is a whole lot of walnuts, that's for sure! Two walnuts is too little for anybody. How about six walnuts? Is it a small number of walnuts or a large one? The Parrot has already found an answer to this question: after eating a small amount of walnuts he wants to eat some more, while after eating a large amount of walnuts he feels satisfied. The Parrot enjoys eating and hates overeating; that's why he wants to know a minimal number of walnuts that is enough to get satisfied.

In order to calculate this number, he conducted a series of experiments. Each experiment went like that: the Parrot, being quite hungry, ate a number of walnuts and checked if this was enough to get himself satisfied. Of course, if some number of walnuts is enough, any larger number will do either; vice versa, if after eating a number of walnuts he is still hungry, no smaller number can get the parrot satisfied. You should help the Parrot to process the results of the experiments.

Input

The first line of the input contains an integern— the number of experiments conducted by the parrot<nobr>(0 ≤<em>n</em>≤ 100)</nobr>. The followingnlines contain descriptions of these experiments. A description of an experiment consists of a number of walnuts eaten by the parrot (an integer from 3 to 9) and an outcome: “satisfied” in case this number was enough to get the parrot satisfied or “hungry” otherwise. It is known as a fact, that ten walnuts is always enough and two walnuts are always not enough.

Output

Output the minimal number of walnuts that is enough to get the parrot satisfied. If the results of the experiments are inconsistent, output “Inconsistent”.

Samples

input	output
4 4 hungry 7 satisfied 5 hungry 8 satisfied	7
2 6 hungry 5 satisfied	Inconsistent

本题很容易，不过有两个陷阱：

1 当数字相等的时候，可能出现satisfied和 hungry的情况，就是Inconsistent了

2 要认真读题意：It is known as a fact, that ten walnuts is always enough and two walnuts are always not enough.

有两种解法：

1

namespace 
{
	static const int MAX_WALNUTS = 10;
}
void AWholeLotofWalnuts1644()
{
	int n = 0, a = 0;
	string s;

	cin>>n;

	string walnuts[MAX_WALNUTS];
	for (int i = 0; i < n; i++)
	{
		cin>>a>>s;
		if (walnuts[a].size()) 
		{
			if (walnuts[a] != s)
			{
				cout<<"Inconsistent";
				return;
			}
		}
		walnuts[a] = s;
	}
	int ans = -1;
	for (int i = 0; i < MAX_WALNUTS; i++)
	{
		if (walnuts[i] == "satisfied" && -1 == ans)
		{
			ans = i;
		}
		if (walnuts[i] == "hungry" && -1 != ans)
		{
			cout<<"Inconsistent";
			return;
		}
	}
	if (-1 == ans) cout<<10;//It is known as a fact, that ten walnuts is always enough and two walnuts are always not enough.少了这句就答案错误了
	else cout<<ans;
}

2 更加简洁点：

void AWholeLotofWalnuts1644_2()
{
	int n = 0, a = 0;
	string s;

	cin>>n;
	int min_sat = MAX_WALNUTS;
	int max_hun = -1;
	for (int i = 0; i < n; i++)
	{
		cin>>a>>s;
		if ('h' == s[0]) max_hun = max_hun < a? a : max_hun;
		else if ('s' == s[0]) min_sat = min_sat > a? a : min_sat;
	}
	if (max_hun >= min_sat) cout<<"Inconsistent";
	else cout<<min_sat;
}