結果
問題 | No.1242 高橋君とすごろく |
ユーザー |
![]() |
提出日時 | 2020-10-02 22:47:20 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 28 ms / 2,000 ms |
コード長 | 4,126 bytes |
コンパイル時間 | 12,928 ms |
コンパイル使用メモリ | 304,868 KB |
最終ジャッジ日時 | 2025-01-15 00:55:50 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 24 |
ソースコード
#line 2 "cpplib/util/template.hpp"#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")#pragma GCC target("avx")#include<bits/stdc++.h>using namespace std;struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;typedef long long lint;#define INF (1LL<<60)#define IINF (1<<30)#define EPS (1e-10)#define endl ('\n')typedef vector<lint> vec;typedef vector<vector<lint>> mat;typedef vector<vector<vector<lint>>> mat3;typedef vector<string> svec;typedef vector<vector<string>> smat;template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}template<typename T>inline void output2(T t){for(auto i:t)output(i);}template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}#define loop(n) for(long long _=0;_<(long long)(n);++_)#define rep(i,...) for(auto i:range(__VA_ARGS__))#define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)#define irep(i) for(lint i=0;;++i)inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}#define all(n) begin(n),end(n)template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}const vector<lint> dx={1,0,-1,0,1,1,-1,-1};const vector<lint> dy={0,1,0,-1,1,-1,1,-1};#define SUM(v) accumulate(all(v),0LL)template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else returnvector(arg,make_vector<T>(x,args...));}//#include "../graph_tree/graph_template.hpp"#line 2 "code.cpp"int main(){lint n,k;cin>>n>>k;vec a(k);rep(i,k)cin>>a[i];rep(i,k)a[i]--;vec ans(6);if(n<6){cout<<"Yes"<<endl;return 0;}rrep(i,k){if(n-a[i]<6){ans[a[i]-(n-6)]=1;a.pop_back();}else{break;}}{rep(j,1)if(ans[j+2]&&ans[j+5])ans[j]=1;rep(j,2)if(ans[j+3]&&ans[j+4])ans[j]=1;}lint now=n-6;rrep(i,a.size()){map<vec,lint>m;bool b=0;for(lint& j=now;j>a[i];--j){if(!b&&m.count(ans)){b=1;lint k=max(0LL,j-a[i]-10)/(m[ans]-j);j-=k*(m[ans]-j);}vec ans2(6);if(ans[0]&&ans[5])ans2[0]=1;if(ans[1]&&ans[4])ans2[0]=1;if(ans[2]&&ans[3])ans2[0]=1;rep(s,5)ans2[s+1]=ans[s];m[ans2]=j;ans=ans2;}ans[0]=1;}{map<vec,lint>m;bool b=0;for(lint& j=now;j>0;--j){if(!b&&m.count(ans)){b=1;lint k=max(0LL,j-10)/(m[ans]-j);j-=k*(m[ans]-j);}vec ans2(6);if(ans[0]&&ans[5])ans2[0]=1;if(ans[1]&&ans[4])ans2[0]=1;if(ans[2]&&ans[3])ans2[0]=1;rep(s,5)ans2[s+1]=ans[s];m[ans2]=j;ans=ans2;}}cout<<(ans[0]?"No":"Yes")<<endl;}