Submission #1757589


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <cmath>
#define	MOD  1000000007;
#define PI = 3.14159265358979323846;
using namespace std;

int main()
{
	int N;
	cin >> N;
	int a[100];

	map<int, int> mp;
	for (int i = 0; i < N; i++)
	{
		cin >> a[i];
		if (a[i] <= 399)
		{
			mp[0]++;
		}
		else if (a[i] <= 799) {
			mp[1]++;
		}
		else if (a[i] <= 1199) {
			mp[2]++;
		}
		else if (a[i] <= 1599) {
			mp[3]++;
		}
		else if (a[i] <= 1999) {
			mp[4]++;
		}
		else if (a[i] <= 2399) {
			mp[5]++;
		}
		else if (a[i] <= 2799) {
			mp[6]++;
		}
		else if (a[i] <= 3199) {
			mp[7]++;
		}
		else {
			mp[8]++;
		}
	}

	int min = 0;
	for (int i = 0; i < 8; i++)
	{
		if (mp[i] != 0) {
			min++;
		}
	}

	int red = 0;
	if (mp.size() != 8)
	{
		red = mp[8];
	}
	cout << min << " " << min + red << endl;
}

Submission Info

Submission Time
Task C - Colorful Leaderboard
User butanokakuni
Language C++14 (GCC 5.4.1)
Score 0
Code Size 901 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 7
WA × 1
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
in1.txt WA 1 ms 256 KB
in2.txt AC 1 ms 256 KB
in3.txt AC 1 ms 256 KB
in4.txt AC 1 ms 256 KB
in5.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB