結果

問題 No.2371 最大の試練それは起床
ユーザー eQeeQe
提出日時 2023-07-07 23:01:36
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 8,764 bytes
コンパイル時間 7,199 ms
コンパイル使用メモリ 334,656 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-21 19:18:58
合計ジャッジ時間 8,099 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 WA -
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define all(a) begin(a),end(a)
#define eb emplace_back
#define ep emplace
#define ef(...) else if(__VA_ARGS__)
#define wh(...) while(__VA_ARGS__)
#define fin(...) rr pp(__VA_ARGS__)
#define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__)
#define LL(...) RD(ll,__VA_ARGS__)
#define ST(...) RD(str,__VA_ARGS__)
#define UL(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__)
#define UV(n,...) u1 __VA_ARGS__;resize({n},__VA_ARGS__);vi(__VA_ARGS__)
#define SS(n,...) strs __VA_ARGS__;resize({n},__VA_ARGS__);li(__VA_ARGS__)
#define U2(n,m,...) u2 __VA_ARGS__;resize({n,m},__VA_ARGS__);li(__VA_ARGS__)
#define fe(v,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__)__VA_OPT__(]):v)
#define fo(i,...) for(auto[i,i##stop,i##step]=rng_fo(__VA_ARGS__);i<i##stop;i+=i##step)
#define of(i,...) for(auto[i,i##stop,i##step]=rng_of(__VA_ARGS__);i>=i##stop;i-=i##step)
#define debug(...) pp(#__VA_ARGS__,__VA_ARGS__)
#define I(...) template<__VA_ARGS__>
#define J typename
#define O operator
#define ce constexpr
#define cs const
#define rr return
#define uu using
namespace my{uu vo=void;vo main();vo solve();}int main(){my::main();}namespace my{uu namespace std;uu namespace atcoder;
uu is=istream;uu os=ostream;uu bo=bool;uu dd=long double;uu ll=long long;uu i128=__int128_t;uu ul=unsigned long long;uu u128=__uint128_t;
I(J T)uu v1=vector<T>;I(J T)uu v2=v1<v1<T>>;uu u1=v1<ll>;uu u2=v2<ll>;uu str=string;uu strs=v1<str>;str sp=" ",nc="",nl="\n";
uu ml=modint998244353;is&O>>(is&i,ml&x){ll t;i>>t;x=t;rr i;}os&O<<(os&o,cs ml&x){rr o<<x.val();}uu m1=v1<ml>;uu m2=v2<ml>;
I(J A,J B=A)struct cp{A a={};B b={};cp(){}cp(A a,B b):a(a),b(b){}cp(pair<A,B>p):a(p.first),b(p.second){}
  cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;}bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;}
  cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}bo O!=(cs cp&c)cs{rr a!=c.a||b!=c.b;}cp O-()cs{rr cp(-a,-b);}
  bo O<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}bo O>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}friend os&O<<(os&o,cs cp&c){rr o<<c.a<<sp<<c.b;}
};uu cl=cp<ll>;uu cls=v1<cl>;I(J T)uu qmax=priority_queue<T>;I(J T)uu qmin=priority_queue<T,v1<T>,greater<T>>;
I(J T)struct set:std::set<T>{set(v1<T>a={}){fe(a,e)this->ep(e);}};I(J T)struct uset:unordered_set<T>{uset(v1<T>a={}){fe(a,e)this->ep(e);}};
I(J T)struct mset:multiset<T>{mset(v1<T>a={}){fe(a,e)this->ep(e);}
  vo erase(cs T&x){if(auto p=this->find(x);p!=this->end())multiset<T>::erase(p);}};
I(J T,J U=T)uu map=std::map<T,U>;I(J T,J U=T)uu umap=unordered_map<T,U>;ll ppc(ll x){rr __builtin_popcountll(x);}
ce ll oo=3e18;dd ee=1e-12,pi=acosl(-1);u1 dx{-1,0,1,0,-1,1,1,-1},dy{0,-1,0,1,-1,-1,1,1};str Yes(bo y=1){rr y?"Yes":"No";}str No(){rr"No";}
ll rnd(ll l,ll r=oo){static ul x=76,y=53,z=20,w=41;ul t=x^(x<<11);x=y,y=z,z=w,w=(w^(w>>19))^(t^(t>>8));if(r==oo)r=l,l=0;rr w%(r-l)+l;}
ll l2(u128 x){x|=1;ll r=0;wh(x)x>>=1,++r;rr r;}bo odd(ll x){rr x&1;}ll pwm1(ll x){rr 1-2*(x&1);}I(J T)bo at(T x,ll i){rr x>>i&1;}
ll l10(u128 x){x|=1;ll r=0;wh(x)x/=10,++r;rr r;}bo eve(ll x){rr~x&1;}ll pw2(ll n){rr 1LL<<n;}I(J T,J U,J V)bo in(T l,U m,V r){rr l<=m&&m<r;}
I(J T)T flo(T x,T y){rr y<0?x=-x,y=-y:x>=0?x/y:(x+1)/y-1;}array<ll,3>rng_fo(ll a,ll b=oo,ll c=1){if(b==oo)b=a,a=0;rr{a,b,c};}
I(J T)T cei(T x,T y){rr y<0?x=-x,y=-y:x<=0?x/y:(x-1)/y+1;}array<ll,3>rng_of(ll a,ll b=0,ll c=1){rr{a-1,b,c};}I(J T)T abs(T x){rr x<0?-x:x;}

I(J T)auto&O++(v1<T>&v){fe(v,e)++e;rr v;}I(J T)auto&O^=(v1<T>&v,cs v1<T>&u){copy(all(u),back_inserter(v));rr v;}
I(J T)auto&O--(v1<T>&v){fe(v,e)--e;rr v;}I(J T)auto O^(v1<T>v,cs v1<T>&u){rr v^=u;}u1 io(ll n,ll x=0){u1 a(n);fo(i,n)a[i]=i+x;rr a;}
I(J T)T&srt(T&a){sort(all(a));rr a;}I(J T)T&rv(T&a){reverse(all(a));rr a;}I(J T)T slice(cs T&a,ll l,ll r){rr T(begin(a)+l,begin(a)+r);}
I(J T)T&rsr(T&a){srt(a),rv(a);rr a;}I(J T)T&uq(T&a){srt(a),a.erase(unique(all(a)),end(a));rr a;}I(J T)ll len(cs T&a){rr a.size();}
I(J T)decltype(auto)bg(T&a){assert(len(a));rr*begin(a);}I(J T)T pof(deque<T>&q){T r=bg(q);q.pop_front();rr r;}I(J T)ce bo is_vec=0;
I(J T)decltype(auto)rb(T&a){assert(len(a));rr*rbegin(a);}I(J T)T pob(deque<T>&q){T r=rb(q);q.pop_back();rr r;}I(J T)ce bo is_vec<v1<T>> =1;
I(J T)auto pop(T&a){if ce(is_vec<T>||is_same_v<T,str>){auto r=rb(a);a.pop_back();rr r;}else{auto r=a.top();a.pop();rr r;}}
I(J...A)auto max(cs A&...a){rr max(initializer_list<common_type_t<A...>>{a...});}I(J T,J U=T)vo af(v1<T>&a,U e={}){a.ep(begin(a),e);}
I(J...A)auto min(cs A&...a){rr min(initializer_list<common_type_t<A...>>{a...});}I(J T)vo df(T&a){a.erase(begin(a));}
I(J T,J U)ll arglb(cs v1<T>&a,cs U&b){rr lower_bound(all(a),b)-begin(a);}I(J T,J U)bo amax(T&a,cs U&b){rr a<b?a=b,1:0;}
I(J T,J U)ll argub(cs v1<T>&a,cs U&b){rr upper_bound(all(a),b)-begin(a);}I(J T,J U)bo amin(T&a,cs U&b){rr a>b?a=b,1:0;}
I(J V)auto recval(cs V&){if ce(is_vec<V>)rr recval(J V::value_type());else rr V();}I(J T)bo add(T&a,cs T&b){rr a+=b,0;}
I(J S,bo f(S&,cs S&),J V)cp<S,bo>scan(cs v1<V>&v){
  S r{};bo b=0;fe(v,x)if ce(is_same_v<V,S>)b?f(r,x):(r=x,b=1);ef(auto[y,c]=scan<S,f>(x);c)b?f(r,y):(r=y,b=1);rr{r,b};}
I(J V,J T=decltype(recval(V())))T max(cs v1<V>&v){rr scan<T,amax<T>>(v).a;}
I(J V,J T=decltype(recval(V())))T min(cs v1<V>&v){rr scan<T,amin<T>>(v).a;}
I(J V,J T=decltype(recval(V())))T sum(cs v1<V>&v){rr scan<T,add<T>>(v).a;}
I(J T=ll,ll n,ll i=0)auto vec(cs ll(&l)[n],T x={}){if ce(i==n-1)rr vector(l[i],x);else rr vector(l[i],vec<T,n,i+1>(l,x));}
I(ll n,J...A)vo resize(cs ll(&l)[n],A&...a){((a=vec(l,recval(a))),...);}
I(J V,J T=decltype(recval(V())))vo fill(v1<V>&v,T x={}){if ce(is_vec<V>)fe(v,e)fill(e,x);else fe(v,e)e=x;}

struct fio{fio(){ios::sync_with_stdio(0);cin.tie(0);cout<<fixed<<setprecision(l10(1/ee)+1);}}fio;
os&O<<(os&o,cs u128&x){if(x<10)rr o<<char(x+'0');rr o<<x/10<<char(x%10+'0');}os&O<<(os&o,cs i128&x){rr o<<str(x<0,'-')<<u128(abs(x));}
I(J V)os&O<<(os&o,cs v1<V>&v){str s=nl;if ce(is_vec<V>){if ce(is_vec<J V::value_type>)s+=nl;}else s=sp;fe(v,e)o<<e<<(&e==&rb(v)?nc:s);rr o;}
I(J T)os&O<<(os&o,cs set<T>&v){fe(v,e)o<<e<<sp;rr o;}I(J T,J U)os&O<<(os&o,cs map<T,U>&m){fe(m,e)o<<cp(e)<<nl;rr o;}
I(J T)os&O<<(os&o,cs mset<T>&v){fe(v,e)o<<e<<sp;rr o;}I(J T)is&O>>(is&i,v1<T>&v){fe(v,e)i>>e;rr i;}
I(J...A)vo li(A&...a){(cin>>...>>a);}I(J...A)vo vi(A&...a){fo(i,(len(a)&...))(cin>>...>>a[i]);}
I(J...A)vo pp(cs A&...a){ll i=0;((cout<<a<<(++i==sizeof...(a)?nc:sp)),...);cout<<nl;}

struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};uu graph=v2<edg>;
graph tog(cs u2&a){graph g;fe(a,e){g.eb();fe(e,v)rb(g).eb(v);}rr g;}u2 tou(cs graph&g){u2 a;fe(g,e){a.eb();fe(e,v,w)rb(a).eb(v);}rr a;}
I(J G)auto ygi(G&g,ll m,bo f=1){if ce(is_same_v<G,graph>){UV(m,a,b,c);if(f)--a,--b;fo(i,m)g[a[i]].eb(b[i],c[i]);rr tuple{a,b,c};}
  else{UV(m,a,b);if(f)--a,--b;fo(i,m)g[a[i]].eb(b[i]);rr tuple{a,b};}}
I(J G)auto mgi(G&g,ll m,bo f=1){if ce(is_same_v<G,graph>){auto[a,b,c]=ygi(g,m,f);fo(i,m)g[b[i]].eb(a[i],c[i]);rr tuple{a,b,c};}
  else{auto[a,b]=ygi(g,m,f);fo(i,m)g[b[i]].eb(a[i]);rr tuple{a,b};}}I(J G)auto ti(G&g,bo f=1){rr mgi(g,len(g)-1,f);}
u1 en(cs str&s,cs str&b="a"){ll n=len(s);u1 r(n,-1);fo(i,n)if(len(b)==1)r[i]=s[i]-b[0];else fo(j,len(b))if(s[i]==b[j])r[i]=j;rr r;}
str de(cs u1&a,cs str&b="a"){ll n=len(a);str r(n,'|');fo(i,n)if(len(b)==1)r[i]=a[i]+b[0];else fo(j,len(b))if(a[i]==j)r[i]=b[j];rr r;}
u2 en(cs strs&s,cs str&b="a"){u2 r;fe(s,e)r.eb(en(e,b));rr r;}str ins(){ST(s);rr s;}strs inss(ll n){SS(n,s);rr s;}
strs de(cs u2&a,cs str&b="a"){strs r;fe(a,e)r.eb(de(e,b));rr r;}u1 abc(){rr en(ins());}u2 abcs(ll n){rr en(inss(n));}

I(J...A)u1 zp(A&...a){u1 v=(a^...);uq(v);([&](u1&u){fe(u,e)e=arglb(v,e);}(a),...);rr v;}I(J...A)vo dec(A&...a){((--a),...);}
I(J F,J...A)u1 vs(cs F&f,A&...a){u1 o=io((len(a)&...));sort(all(o),f);([&](auto&e){auto c=e;fo(i,len(e))e[i]=c[o[i]];}(a),...);rr o;}
I(J F)ll bsl(cs F&f,ll o,ll n){wh(abs(o-n)>1)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}ll sqr(ll x){ll r=max(sqrtl(x)-1,0.);wh(r+1<=x/(r+1))++r;rr r;}
I(J F)dd bsd(cs F&f,dd o,dd n){fo(t,l2(abs(o-n)/ee)+5)(f((o+n)/2)?o:n)=(o+n)/2;rr o;}I(J T)auto zt(v1<T>a){fo(i,1,len(a))a[i]+=a[i-1];rr a;}
cls rle(cs u1&a){cls r;fe(a,e)len(r)&&e==rb(r).a?++rb(r).b:r.eb(e,1).b;rr r;}cls rce(u1 a){rr rle(srt(a));}
i128 pow(i128 x,u128 n,u128 m=0){i128 r=1;wh(n){if(n&1)r*=x;x*=x;if(m)r%=m,x%=m;n>>=1;}rr r;}I(J T)T sq(cs T&a){rr a*a;}
u1 divs(ll n){u1 r;for(ll i=1;i*i<=n;++i)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r);}I(J T)T cb(cs T&a){rr a*a*a;}
cls fact(ll n){umap<ll>m;for(ll i=2;i*i<=n;++i)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];cls r;fe(m,e)r.eb(e);rr srt(r);}

vo main(){ll T=1;fo(t,T)solve();}
vo solve(){
  LL(H,W);
  if(H<7){
    pp(Yes());
  }ef(H==7){
    pp(W<30?"Yes":"Late");
  }ef(H==8){
    pp(W<=30?"Late":"No");
  }else{
    pp(No());
  }
}}
0