Submission #1359973
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))
// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;
int n;
int a[125252];
int main(){
scanf("%d",&n);
REP(i,n)scanf("%d",a+i);
sort(a,a+n);
if(a[n-1]-a[0]>1){
puts("No");
}else if(a[n-1]==a[0]){
// all same
int x = a[0];
if(x==n-1 || n>=2*x){
puts("Yes");
}else{
puts("No");
}
}else{
int x = a[0];
int xcnt = count(a,a+n,x);
int ycnt = n-xcnt;
if(x+1-xcnt > 0 && ycnt>=2*(x+1-xcnt)){
puts("Yes");
}else{
puts("No");
}
}
return 0;
}
Submission Info
Submission Time
2017-06-18 21:19:48+0900
Task
B - Colorful Hats
User
rickytheta
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1367 Byte
Status
AC
Exec Time
12 ms
Memory
640 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:38:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:39:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n)scanf("%d",a+i);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
700 / 700
Status
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
9 ms
640 KB
1_03.txt
AC
11 ms
640 KB
1_04.txt
AC
11 ms
640 KB
1_05.txt
AC
11 ms
640 KB
1_06.txt
AC
11 ms
640 KB
1_07.txt
AC
11 ms
640 KB
1_08.txt
AC
10 ms
640 KB
1_09.txt
AC
11 ms
640 KB
1_10.txt
AC
9 ms
640 KB
1_11.txt
AC
11 ms
640 KB
1_12.txt
AC
11 ms
640 KB
1_13.txt
AC
11 ms
640 KB
1_14.txt
AC
11 ms
640 KB
1_15.txt
AC
1 ms
256 KB
1_16.txt
AC
1 ms
256 KB
1_17.txt
AC
12 ms
640 KB