Submission #1360830
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define sc(a) scanf("%d", &a)
#define sc2(a,b) scanf("%d%d", &a, &b)
#define sc3(a,b,c) scanf("%d%d%d", &a, &b, &c)
#define pri(x) printf("%d\n", x)
#define mp make_pair
#define pb push_back
#define BUFF ios::sync_with_stdio(false);
#define imprime(v) for(int X=0;X<v.size();X++) printf("%d ", v[X]); printf("\n");
#define endl "\n"
const int INF= 0x3f3f3f3f;
const long double pi= acos(-1);
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector< vector< int > > vvi;
const int MOD=1e9+7;
const ll LINF=0x3f3f3f3f3f3f3f3f;
int a[100005];
bool ok;
void check_group(int n, int k)
{
if(k<0 or k>n or n<k*2 or (k==0 and n!=0))
{
ok=false;
}
}
int n;
int main()
{
ok=true;
int maxval=0;
int minval=n+10;
sc(n);
for(int i=0;i<n;i++)
{
sc(a[i]);
maxval=max(maxval,a[i]);
minval=min(minval,a[i]);
}
if(maxval-minval>1)
{
puts("No");
return 0;
}
if(maxval==minval)
{
check_group(n,maxval);
if(maxval!=0 and maxval==n-1) ok=true;
}
else
{
int cont=0;
for(int i=0;i<n;i++)
{
if(a[i]==minval)
{
cont++;
}
}
check_group(n-cont,minval-cont+1);
check_group(cont,minval-cont);
}
if(ok) puts("Yes");
else puts("No");
return 0;
}
Submission Info
Submission Time
2017-06-18 21:42:09+0900
Task
B - Colorful Hats
User
Lucaskywalker
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1417 Byte
Status
WA
Exec Time
10 ms
Memory
640 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:38:8: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
sc(n);
^
./Main.cpp:41:13: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
sc(a[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
WA
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
8 ms
640 KB
1_03.txt
AC
10 ms
640 KB
1_04.txt
WA
10 ms
640 KB
1_05.txt
AC
10 ms
640 KB
1_06.txt
WA
10 ms
640 KB
1_07.txt
AC
10 ms
640 KB
1_08.txt
AC
9 ms
640 KB
1_09.txt
AC
10 ms
640 KB
1_10.txt
AC
9 ms
640 KB
1_11.txt
WA
10 ms
640 KB
1_12.txt
AC
10 ms
640 KB
1_13.txt
WA
10 ms
640 KB
1_14.txt
AC
10 ms
640 KB
1_15.txt
AC
1 ms
256 KB
1_16.txt
AC
1 ms
256 KB
1_17.txt
AC
10 ms
640 KB