結果

問題 No.1395 Less Sweet Alchemy
ユーザー LayCurse
提出日時 2021-02-14 21:23:38
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 2,410 bytes
コンパイル時間 2,216 ms
コンパイル使用メモリ 212,484 KB
最終ジャッジ日時 2025-01-18 20:33:21
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 12
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
return a<=b?a:b;
}
template<class S, class T> inline S max_L(S a,T b){
return a>=b?a:b;
}
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
inline void rd(int &x){
int k;
int m=0;
x=0;
for(;;){
k = my_getchar_unlocked();
if(k=='-'){
m=1;
break;
}
if('0'<=k&&k<='9'){
x=k-'0';
break;
}
}
for(;;){
k = my_getchar_unlocked();
if(k<'0'||k>'9'){
break;
}
x=x*10+k-'0';
}
if(m){
x=-x;
}
}
struct MY_WRITER{
char buf[1048576];
int s;
int e;
MY_WRITER(){
s = 0;
e = 1048576;
}
~MY_WRITER(){
if(s){
fwrite_unlocked(buf, 1, s, stdout);
}
}
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
MY_WRITER_VAR.s = 0;
}
MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
my_putchar_unlocked(a);
}
inline void wt_L(const char c[]){
int i=0;
for(i=0;c[i]!='\0';i++){
my_putchar_unlocked(c[i]);
}
}
int N;
int X;
int C[100];
int main(){
int mn;
int mx;
rd(N);
rd(X);
{
int Lj4PdHRW;
for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
rd(C[Lj4PdHRW]);
}
}
{
int e98WHCEY;
int cTE1_r3A;
if(N==0){
cTE1_r3A = 0;
}
else{
cTE1_r3A = C[0];
for(e98WHCEY=(1);e98WHCEY<(N);e98WHCEY++){
cTE1_r3A = min_L(cTE1_r3A, C[e98WHCEY]);
}
}
mn =cTE1_r3A;
}
{
int xr20shxY;
int WYIGIcGE;
if(N==0){
WYIGIcGE = 0;
}
else{
WYIGIcGE = C[0];
for(xr20shxY=(1);xr20shxY<(N);xr20shxY++){
WYIGIcGE = max_L(WYIGIcGE, C[xr20shxY]);
}
}
mx =WYIGIcGE;
}
if(mn<=X && X<=mx){
wt_L("Yes");
wt_L('\n');
}
else{
wt_L("No");
wt_L('\n');
}
return 0;
}
// cLay version 20210103-1 [bug fixed 2]
// --- original code ---
// int N, X, C[100];
// {
// int mn, mx;
// rd(N,X,C(N));
// mn = min(C(N));
// mx = max(C(N));
// wt(if[mn<=X<=mx, "Yes", "No"]);
// }
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0