Submission #1771791


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define N 1111116

int n,a[N];

int read(){
	int x=0,f=1;char ch=getchar();
	for (;!isdigit(ch);ch=getchar()) if (ch=='-') f=-f;
	for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
	return x*f;
}

int main(){
	n=read();
	for (int i=1;i<=n;i++) a[i]=read();
	sort(a+1,a+n+1);
	if (a[n]-a[1]>=2) printf("No\n");
	if (a[n]-a[1]==1){
		int t=upper_bound(a+1,a+n+1,a[1])-a-1;
		printf((a[n]>=t+1&&a[n]<=t+(n-t)/2)?"Yes\n":"No\n");
	}
	if (a[n]-a[1]==0)
		printf((a[n]<=n/2||a[n]==n-1)?"Yes\n":"No\n");
	return 0;
}

Submission Info

Submission Time
Task B - Colorful Hats
User Kuugo
Language C++14 (GCC 5.4.1)
Score 700
Code Size 575 Byte
Status AC
Exec Time 7 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 4 ms 640 KB
1_03.txt AC 7 ms 640 KB
1_04.txt AC 7 ms 640 KB
1_05.txt AC 7 ms 640 KB
1_06.txt AC 7 ms 640 KB
1_07.txt AC 7 ms 640 KB
1_08.txt AC 4 ms 640 KB
1_09.txt AC 7 ms 640 KB
1_10.txt AC 4 ms 640 KB
1_11.txt AC 7 ms 640 KB
1_12.txt AC 7 ms 640 KB
1_13.txt AC 7 ms 640 KB
1_14.txt AC 7 ms 640 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 1 ms 256 KB
1_17.txt AC 7 ms 640 KB