結果
問題 | No.1242 高橋君とすごろく |
ユーザー |
![]() |
提出日時 | 2020-10-02 22:42:23 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,918 bytes |
コンパイル時間 | 2,544 ms |
コンパイル使用メモリ | 187,548 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-20 02:48:43 |
合計ジャッジ時間 | 3,355 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 24 |
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>// #include<ext/pb_ds/assoc_container.hpp>// #include<ext/pb_ds/tree_policy.hpp>// #include<ext/pb_ds/tag_and_trait.hpp>// using namespace __gnu_pbds;// #include<boost/multiprecision/cpp_int.hpp>// namespace multiprecisioninteger = boost::multiprecision;// using cint=multiprecisioninteger::cpp_int;using namespace std;using ll=long long;#define double long doubleusing datas=pair<ll,ll>;using ddatas=pair<double,double>;using tdata=pair<ll,datas>;using vec=vector<ll>;using mat=vector<vec>;using pvec=vector<datas>;using pmat=vector<pvec>;// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;#define For(i,a,b) for(i=a;i<(ll)b;++i)#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)#define rep(i,N) For(i,0,N)#define rep1(i,N) For(i,1,N)#define brep(i,N) bFor(i,N,0)#define brep1(i,N) bFor(i,N,1)#define all(v) (v).begin(),(v).end()#define allr(v) (v).rbegin(),(v).rend()#define vsort(v) sort(all(v))#define vrsort(v) sort(allr(v))#define endl "\n"#define eb emplace_back#define print(x) cout<<x<<endl#define printyes print("Yes")#define printno print("No")#define printYES print("YES")#define printNO print("NO")#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)const ll mod=1000000007;// const ll mod=998244353;const ll inf=1LL<<60;const double PI=acos(-1);const double eps=1e-9;template<class T,class E> ostream& operator<<(ostream& os,pair<T,E>& p){return os<<"{"<<p.first<<","<<p.second<<"}";}template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}void startupcpp(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}double distance(ddatas x,ddatas y){double a=x.first-y.first,b=x.second-y.second;return sqrt(a*a+b*b);}ll modinv(ll a,ll m=mod) {ll b=m,u=1,v=0,t;while(b){t=a/b;a-=t*b; swap(a,b);u-=t*v; swap(u,v);}return (u+m)%m;}ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}vec modncrlistp,modncrlistm;ll modncr(ll n,ll r){if(n<r)return 0;ll i,size=modncrlistp.size();if(size<=n){modncrlistp.resize(n+1);modncrlistm.resize(n+1);if(!size){modncrlistp[0]=modncrlistm[0]=1;size++;}For(i,size,n+1){modncrlistp[i]=modncrlistp[i-1]*i%mod;modncrlistm[i]=modinv(modncrlistp[i]);}}return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;}ll modpow(ll a,ll n,ll m=mod){ll res=1;while(n>0){if(n&1)res=res*a%m;a=a*a%m;n>>=1;}return res;}ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}ll lcm(ll a,ll b){return a/gcd(a,b)*b;}ll countdigits(ll n){ll ans=0;while(n){n/=10;ans++;}return ans;}ll sumdigits(ll n){ll ans=0;while(n){ans+=n%10;n/=10;}return ans;}ll N,M,K,H,W,A,B,C,D;string s,t;ll ans;int main(){startupcpp();ll i,j,k;cin>>N>>K;vec a(K);vec lis(20,0);rep(i,K){cin>>a[i];--a[i];}brep(i,K-1){j=a[i+1]-a[i];if(j==3){if(a[i]!=1&&a[i]!=4){printno;return 0;}else{lis[a[i]]=lis[a[i+1]]=1;}}else if(j==1){if(a[i]!=1&&a[i]!=4&&a[i]!=7&&a[i]!=2){printno;return 0;}else{lis[a[i]]=lis[a[i+1]]=1;}}else if(j==5){if(a[i]!=2&&a[i]!=3&&a[i]!=5&&a[i]!=8){printno;return 0;}else{lis[a[i]]=lis[a[i+1]]=1;}}}brep(i,14){if(lis[i+1]&lis[i+6])lis[i]=1;if(lis[i+2]&lis[i+5])lis[i]=1;if(lis[i+3]&lis[i+4])lis[i]=1;}// output(lis);if(lis[0])printno;else printyes;}