Submission #1360304


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int main() {
	int N;
	cin >> N;
	vector<int> a(N);
	int mina = 1000000;
	int maxa = -1;
	for (int i = 0; i < N; i++) {
		cin >> a[i];
		mina = min(mina, a[i]);
		maxa = max(maxa, a[i]);
	}
	int minc = 0;
	int maxc = 0;
	if ((mina + 1 == maxa) || (mina == maxa)) {
		for (int i = 0; i < N; i++) {
			if (a[i] == mina) {
				minc++;
			}
			else if (a[i] == maxa) {
				maxc++;
			}
		}
		if (mina == maxa) {
			minc = 0;
		}
		if ((maxa - minc) * 2 <= maxc && (maxa - minc > 0)) {
			cout << "Yes" << endl;
		}
		else {
			if (mina == maxa && (mina == N - 1 || mina * 2 <= N)) {
				cout << "Yes" << endl;
			}
			else {
				cout << "No" << endl;
			}
		}
	}
	else {
		cout << "No" << endl;
	}
	return 0;
}

Submission Info

Submission Time
Task B - Colorful Hats
User ats5515
Language C++14 (GCC 5.4.1)
Score 700
Code Size 794 Byte
Status AC
Exec Time 30 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 6
AC × 24
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 0_05.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 1 ms 256 KB
0_05.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 17 ms 640 KB
1_03.txt AC 29 ms 640 KB
1_04.txt AC 29 ms 640 KB
1_05.txt AC 29 ms 640 KB
1_06.txt AC 30 ms 640 KB
1_07.txt AC 29 ms 640 KB
1_08.txt AC 17 ms 640 KB
1_09.txt AC 29 ms 640 KB
1_10.txt AC 17 ms 640 KB
1_11.txt AC 29 ms 640 KB
1_12.txt AC 29 ms 640 KB
1_13.txt AC 30 ms 640 KB
1_14.txt AC 29 ms 640 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 1 ms 256 KB
1_17.txt AC 29 ms 640 KB