首页 > 代码库 > HDU - 5038 Grade

HDU - 5038 Grade

2024-07-23 17:11:53   216人阅读

Problem Description
Ted is a employee of Always Cook Mushroom (ACM). His boss Matt gives him a pack of mushrooms and ask him to grade each mushroom according to its weight. Suppose the weight of a mushroom is w, then it’s grade s is

s = 10000 - (100 - w)^2

What’s more, Ted also has to report the mode of the grade of these mushrooms. The mode is the value that appears most often. Mode may not be unique. If not all the value are the same but the frequencies of them are the same, there is no mode.
 

Input
The first line of the input contains an integer T, denoting the number of testcases. Then T test cases follow.

The first line of each test cases contains one integers N (1<=N<=10^6),denoting the number of the mushroom.

The second line contains N integers, denoting the weight of each mushroom. The weight is greater than 0, and less than 200.
 

Output
For each test case, output 2 lines.

The first line contains "Case #x:", where x is the case number (starting from 1)

The second line contains the mode of the grade of the given mushrooms. If there exists multiple modes, output them in ascending order. If there exists no mode, output “Bad Mushroom”.
 

Sample Input
3
6
100 100 100 99 98 101
6
100 100 100 99 99 101
6
100 100 98 99 99 97
 

Sample Output
Case #1:
10000
Case #2:
Bad Mushroom
Case #3:
9999 10000
题意：求经过公式计算过的结果出现的次数是否不一致，不一致的话，输出最大的那个
思路：map处理
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
typedef __int64 ll;
using namespace std;
const int maxn = 1000005;

ll n, num[maxn];
map<ll, int> mp; 

int main() {
	int t, cas = 1;
	scanf("%d", &t);
	while (t--) {
		scanf("%I64d", &n);
		ll a;
		mp.clear();
		for (int i = 0; i < n; i++) {
			scanf("%I64d", &a);
			mp[10000 - (100 - a) * (100 - a)]++;
		}

		int ok = 0;
		int first = mp[10000 - (100 - a) * (100 - a)];
		int Max = 0;
		for (map<ll, int>::iterator i = mp.begin(); i != mp.end(); i++) {
			if ((*i).second != first)
				ok = 1;
			Max = max(Max, (*i).second);
		}

		printf("Case #%d:\n", cas++);
		if (mp.size() == 1) {
			printf("%I64d\n", (ll)10000 - (100 - a) * (100 - a));
			continue;
		}
		if (ok == 0) {
			printf("Bad Mushroom\n");
			continue;
		}

		int flag = 1;
		for (map<ll, int >::iterator i = mp.begin(); i != mp.end(); i++) {
			if ((*i).second == Max) {
				if (flag) {
					printf("%I64d", (*i).first);
					flag = 0;
				}
				else printf(" %I64d", (*i).first);
			}
		}
		printf("\n");
	}
	return 0;
}


HDU - 5038 Grade


联系
我们