#1009909 (C++17) No.2890 Chiffon

• 問題: No.2890 Chiffon
• ユーザー: TKTYI
• 提出日時: 2024-09-13 21:43:26
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 392 ms / 2,000 ms
• コード長: 3,330 bytes
• コンパイル時間: 4,936 ms
• コンパイル使用メモリ: 272,420 KB
• 実行使用メモリ: 46,188 KB
• 最終ジャッジ日時: 2024-09-26 14:33:14
• 合計ジャッジ時間: 14,919 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 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	1 ms; 5,376 KB
testcase_08	AC	288 ms; 41,600 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	AC	2 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	1 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	366 ms; 46,188 KB
testcase_24	AC	152 ms; 25,728 KB
testcase_25	AC	123 ms; 20,864 KB
testcase_26	AC	269 ms; 37,888 KB
testcase_27	AC	265 ms; 40,064 KB
testcase_28	AC	9 ms; 5,376 KB
testcase_29	AC	23 ms; 7,296 KB
testcase_30	AC	130 ms; 22,656 KB
testcase_31	AC	277 ms; 42,880 KB
testcase_32	AC	249 ms; 37,888 KB
testcase_33	AC	12 ms; 5,504 KB
testcase_34	AC	272 ms; 45,016 KB
testcase_35	AC	270 ms; 45,144 KB
testcase_36	AC	272 ms; 45,148 KB
testcase_37	AC	272 ms; 45,012 KB
testcase_38	AC	278 ms; 45,016 KB
testcase_39	AC	266 ms; 45,020 KB
testcase_40	AC	276 ms; 45,020 KB
testcase_41	AC	268 ms; 45,020 KB
testcase_42	AC	269 ms; 45,016 KB
testcase_43	AC	271 ms; 45,016 KB
testcase_44	AC	352 ms; 45,144 KB
testcase_45	AC	350 ms; 45,140 KB
testcase_46	AC	352 ms; 45,144 KB
testcase_47	AC	392 ms; 45,140 KB
testcase_48	AC	347 ms; 45,140 KB
testcase_49	AC	287 ms; 45,140 KB
testcase_50	AC	284 ms; 45,016 KB
testcase_51	AC	285 ms; 45,016 KB
testcase_52	AC	288 ms; 45,140 KB
testcase_53	AC	294 ms; 45,140 KB
testcase_54	AC	318 ms; 44,416 KB
testcase_55	AC	288 ms; 44,868 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
vi fast_mod_convolution(vi&a,vi&b,ll mod){
  const ll m1=167772161,m2=469762049,m3=1224736769;
  const ll m1_inv_m2=inv_mod(m1,m2);
  const ll m12_inv_m3=inv_mod(m1*m2,m3);
  const ll m12_mod=m1*m2%mod;
  auto x=convolution<m1>(a,b);
  auto y=convolution<m2>(a,b);
  auto z=convolution<m3>(a,b);
  vector<ll>ret(sz(a)+sz(b)-1);
  REP(i,sz(ret)){
    ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
    ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
  	ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
  }
  return ret;
}
const ld EPS=1e-8;
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
int main(){
  int N,K;cin>>N>>K;
  vector<int>A(K);cin>>A;
  REP(i,K)A[i]/=2;
  FOR(i,1,K)A[i]-=A[0];
  A[0]=0;
  A.emplace_back(N);
  A.emplace_back(N+A[1]);
  vector<vector<int>>D(20,vector<int>(N));
  int l=1,r=N/2+5;
  while(r-l>1){
  	int m=(l+r)/2;
  	REP(i,K)for(int j=A[i];j<A[i+1];j++){
  		if(j+m<A[i+2])D[0][j]=max(j+m,A[i+1]);
  		else D[0][j]=N+j+1;
  	}
  	FOR(i,1,20)REP(v,N){
  		if(D[i-1][v]>v+N)D[i][v]=D[i-1][v];
  		else D[i][v]=D[i-1][v]/N*N+D[i-1][D[i-1][v]%N];
  	}
  	bool ok=0;
  	REP(i,A[1]){
  		ll v=i;
  		REP(j,20)if((K>>j)%2){
  			v=D[j][v%N]+v/N*N;
  			if(v>i+N)break;
  		}
  		if(v<=i+N)ok=1;
  	}
  	if(ok)l=m;
  	else r=m;
  }
  cout<<2*l<<endl;
  return 0;
}