Submission #3234935
Source Code Expand
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("sse3","sse2","sse")
#pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
#pragma GCC target("f16c")
#pragma GCC optimize("inline","fast-math","unroll-loops","no-stack-protector")
#pragma GCC diagnostic error "-fwhole-program"
#pragma GCC diagnostic error "-fcse-skip-blocks"
#pragma GCC diagnostic error "-funsafe-loop-optimizations"
#pragma GCC diagnostic error "-std=c++14"
#include "bits/stdc++.h"
//#include "ext/pb_ds/tree_policy.hpp"
//#include "ext/pb_ds/assoc_container.hpp"
#define PB push_back
#define PF push_front
#define LB lower_bound
#define UB upper_bound
#define fr(x) freopen(x,"r",stdin)
#define fw(x) freopen(x,"w",stdout)
#define iout(x) printf("%d\n",x)
#define lout(x) printf("%lld\n",x)
#define REP(x,l,u) for(ll x = l;x<u;x++)
#define RREP(x,l,u) for(ll x = l;x>=u;x--)
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) a.begin(),a.end()
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define MP make_pair
#define sqr(x) ((x)*(x))
#define lowbit(x) (x&(-x))
#define lson (ind<<1)
#define rson (ind<<1|1)
#define se second
#define fi first
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl;
#define sz(x) ((int)x.size())
#define EX0 exit(0);
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
using namespace std;
typedef vector<ll> VLL;
typedef vector<int> VI;
const int block_size = 320;
typedef complex<ll> point;
const ll mod = 1e9+7;
const ll inf = 1e9+7;
const ld eps = 1e-9;
const db PI = atan(1)*4;
template<typename T>
inline int sign(const T&a) {
if(a<0)return -1;
if(a>0)return 1;
return 0;
}
template<typename T,typename S>inline bool upmin(T&a,const S&b){return a>b?a=b,1:0;}
template<typename T,typename S>inline bool upmax(T&a,const S&b){return a<b?a=b,1:0;}
template<typename T> inline void in(T &x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
ll twop(int x) {
return 1LL<<x;
}
template<typename A,typename B > inline void in(A&x,B&y) {
in(x);
in(y);
}
template<typename A,typename B,typename C>inline void in(A&x,B&y,C&z) {
in(x);
in(y);
in(z);
}
template<typename A,typename B,typename C,typename D> inline void in(A&x,B&y,C&z,D&d) {
in(x);
in(y);
in(z);
in(d);
}
namespace SOLVE {
void main(){
}
}
int ans[100000];
int main() {
int n;cin>>n;
VI v(n);
for(auto&i:v)in(i);
sort(all(v));
int cnt = 0;
REP(i,0,sz(v))if(v[i]==v[0])cnt++;
if(v.back() == 0 || v.front() == n-1){
cout<<"YES";
EX0;
}
if(v.back() == v.front()){
cout<<"NO";
EX0;
}
if(v.back() == v.front()+1){
if(n-cnt == v.back() && cnt-1 == v.front()){
cout<<"YES";
EX0;
}else{
cout<<"NO";
EX0;
}
}
cout<<"NO";
EX0;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Colorful Hats |
User |
samzhang |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3531 Byte |
Status |
WA |
Exec Time |
9 ms |
Memory |
640 KB |
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 |
WA |
1 ms |
256 KB |
0_02.txt |
WA |
1 ms |
256 KB |
0_03.txt |
WA |
1 ms |
256 KB |
0_04.txt |
WA |
1 ms |
256 KB |
0_05.txt |
WA |
1 ms |
256 KB |
1_00.txt |
WA |
1 ms |
256 KB |
1_01.txt |
WA |
1 ms |
256 KB |
1_02.txt |
WA |
4 ms |
640 KB |
1_03.txt |
WA |
8 ms |
640 KB |
1_04.txt |
WA |
8 ms |
640 KB |
1_05.txt |
WA |
8 ms |
640 KB |
1_06.txt |
WA |
8 ms |
640 KB |
1_07.txt |
WA |
8 ms |
640 KB |
1_08.txt |
WA |
4 ms |
640 KB |
1_09.txt |
WA |
8 ms |
640 KB |
1_10.txt |
WA |
4 ms |
640 KB |
1_11.txt |
WA |
8 ms |
640 KB |
1_12.txt |
WA |
8 ms |
640 KB |
1_13.txt |
WA |
8 ms |
640 KB |
1_14.txt |
WA |
9 ms |
640 KB |
1_15.txt |
WA |
1 ms |
256 KB |
1_16.txt |
WA |
1 ms |
256 KB |
1_17.txt |
WA |
9 ms |
640 KB |