#if !defined(MYLOCAL)//提出時用テンプレート //# pragma GCC target("avx2")//yukiではNG # pragma GCC optimize("O3") # pragma GCC optimize("unroll-loops") #if defined(NDEBUG) #undef NDEBUG #endif #include "bits/stdc++.h" #if __has_include() #include using namespace atcoder; #endif using namespace std; using ll=long long; using dd=long double; using pll=pair; using tll=tuple; using qll=tuple; using ll2=array; using ll3=array; using ll4=array; using namespace chrono; constexpr ll INF = 1201001001001001001; struct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<::max_digits10); } } fast; #define EXPAND( x ) x//VS用おまじない #define overload3(_1,_2,_3,name,...) name #define overload4(_1,_2,_3,_4,name,...) name #define overload5(_1,_2,_3,_4,_5,name,...) name #define rep1(N) for (ll dmyi = 0; dmyi < (N); dmyi++) #define rep2(i, N) for (ll i = 0; i < (N); i++) #define rep3(i, S, E) for (ll i = (S); i <= (E); i++) #define rep4(i, S, E, t) for (ll i = (S); i <= (E); i+=(t)) #define rep(...) EXPAND(overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)) #define dep3(i, E, S) for (ll i = (E); i >= (S); i--) #define dep4(i, E, S, t) for (ll i = (E); i >= (S); i-=(t)) #define dep(...) EXPAND(overload4(__VA_ARGS__, dep4, dep3,_,_)(__VA_ARGS__)) #define ALL1(v) (v).begin(), (v).end() #define ALL2(v,E) (v).begin(), (v).begin()+((E)+1) #define ALL3(v,S,E) (v).begin()+(S), (v).begin()+((E)+1) #define all(...) EXPAND(overload3(__VA_ARGS__, ALL3, ALL2, ALL1)(__VA_ARGS__)) #define RALL1(v) (v).rbegin(), (v).rend() #define RALL2(v,E) (v).rbegin(), (v).rbegin()+((E)+1) #define RALL3(v,S,E) (v).rbegin()+(S), (v).rbegin()+((E)+1) #define rall(...) EXPAND(overload3(__VA_ARGS__, RALL3, RALL2, RALL1)(__VA_ARGS__)) template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; } template inline T limithi(T a,T b){ return min(a,b); } template inline T limitlo(T a,T b){ return max(a,b); } template inline bool chlimithi(T &a,T b){ return chmin(a,b); } template inline bool chlimitlo(T &a,T b){ return chmax(a,b); } template inline auto maxe(T &&v,ll S,ll E){ return *max_element(all(v,S,E)); } template inline auto maxe(T &&v){ return *max_element(all(v)); } template inline auto mine(T &&v,ll S,ll E){ return *min_element(all(v,S,E)); } template inline auto mine(T &&v){ return *min_element(all(v)); } template::type::value_type> inline U sum(T &&v,ll S,ll E) {return accumulate(all(v,S,E),U());} template inline auto sum(T &&v) {return sum(v,0,v.end()-v.begin()-1);} template inline ll sz(T &&v){ return (ll)v.size(); } inline ll Ceil(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; } //負もOK inline ll Floor(ll a,ll b){ return -Ceil(-a,b); } //負もOK inline ll Floormod(ll a,ll m){ return Floor(a,m)*m; } //負もOK inline ll Ceilmod(ll a,ll m){ return Ceil(a,m)*m; } //負もOK inline ll Mod(ll a,ll m){ ll r=a%m; if(r<0)r+=m; return r; } //負もOK template inline T Pow(T a,ll n){ T r=1; for(; n>0; n>>=1,a*=a){ if(n&1)r*=a; } return r; } inline ll Pow(int a,ll n){ return Pow((ll)a,n); } inline ll limitmul(ll a,ll b,ll u){ return b==0||a<=u/b ? a*b : u; }//min(a*b,u) a,b,u≧0 //pair用テンプレート template inline pair& operator+=(pair &a,const pair &b){ a.first+=b.first; a.second+=b.second; return a; } template inline pair& operator-=(pair &a,const pair &b){ a.first-=b.first; a.second-=b.second; return a; } template inline pair& operator*=(pair &a,const pair &b){ a.first*=b.first; a.second*=b.second; return a; } template inline pair& operator/=(pair &a,const pair &b){ a.first/=b.first; a.second/=b.second; return a; } template inline pair& operator%=(pair &a,const pair &b){ a.first%=b.first; a.second%=b.second; return a; } template inline pair& operator+=(pair &a,R b){ a.first+=b; a.second+=b; return a; } template inline pair& operator-=(pair &a,R b){ a.first-=b; a.second-=b; return a; } template inline pair& operator*=(pair &a,R b){ a.first*=b; a.second*=b; return a; } template inline pair& operator/=(pair &a,R b){ a.first/=b; a.second/=b; return a; } template inline pair& operator%=(pair &a,R b){ a.first%=b; a.second%=b; return a; } template inline pair operator+(const pair &a,R b){ pair c=a; return c+=b; } template inline pair operator-(const pair &a,R b){ pair c=a; return c-=b; } template inline pair operator*(const pair &a,R b){ pair c=a; return c*=b; } template inline pair operator/(const pair &a,R b){ pair c=a; return c/=b; } template inline pair operator%(const pair &a,R b){ pair c=a; return c%=b; } template inline pair operator-(R b,const pair &a){ pair c=-a; return c+=b; } template inline pair operator-(const pair &a,const pair &b){ pair c=a; return c-=b; } template inline pair operator-(const pair &a){ pair c=a; return c*=(-1); } template inline ostream &operator<<(ostream &os,const pair &a){ return os << a.first << ' ' << a.second; } //tuple用テンプレート出力用のみ template inline ostream &operator<<(ostream &os,const tuple &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a); } template inline ostream &operator<<(ostream &os,const tuple &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a) << ' ' << get<3>(a); } //vector用テンプレート template inline ostream &operator<<(ostream &os,const vector &a){ for (ll i=0; i<(ll)a.size(); i++) os<<(i>0?" ":"")< inline array& operator+=(array &a,const array &b){ for (ll i=0; i<(ll)S; i++) a[i]+=b[i]; return a; } template inline array& operator-=(array &a,const array &b){ for (ll i=0; i<(ll)S; i++) a[i]-=b[i]; return a; } template inline array& operator*=(array &a,const array &b){ for (ll i=0; i<(ll)S; i++) a[i]*=b[i]; return a; } template inline array& operator/=(array &a,const array &b){ for (ll i=0; i<(ll)S; i++) a[i]/=b[i]; return a; } template inline array& operator%=(array &a,const array &b){ for (ll i=0; i<(ll)S; i++) a[i]%=b[i]; return a; } template inline array& operator+=(array &a,R b){ for (T &e: a) e+=b; return a; } template inline array& operator-=(array &a,R b){ for (T &e: a) e-=b; return a; } template inline array& operator*=(array &a,R b){ for (T &e: a) e*=b; return a; } template inline array& operator/=(array &a,R b){ for (T &e: a) e/=b; return a; } template inline array& operator%=(array &a,R b){ for (T &e: a) e%=b; return a; } template inline array operator+(const array &a,R b){ array c=a; return c+=b; } template inline array operator-(const array &a,R b){ array c=a; return c-=b; } template inline array operator*(const array &a,R b){ array c=a; return c*=b; } template inline array operator/(const array &a,R b){ array c=a; return c/=b; } template inline array operator%(const array &a,R b){ array c=a; return c%=b; } template inline array operator-(R b,const array &a){ array c=-a; return c+=b; } template inline array operator-(const array &a,const array &b){ array c=a; return c-=b; } template inline array operator-(const array &a){ array c=a; return c*=(-1); } template inline ostream &operator<<(ostream &os,const array &a){ for (ll i=0; i<(ll)S; i++) os<<(i>0?" ":"")<(system_clock::now()-st).count()/1000;} } timeget; struct cinutil{ template static void cin1core(T &a){ cin>>a; } template static void cin1core(pair &a){ cin1core(a.first), cin1core(a.second); } template static void cin1core(tuple &a){ cinTplRec,sizeof...(Args)-1>()(a); } template static void cin1core(array &a){for(int i=0;i<(int)N;++i) cin>>a[i];} private: template struct cinTplRec{ void operator()(Tpl &a){ cinTplRec()(a); cin1core(get(a)); } }; template struct cinTplRec{ void operator()(Tpl &a){ cin1core(get<0>(a)); } }; }; template T cin1(){ T a; cinutil::cin1core(a); return a; } template tuple cins(){ return cin1>(); } template struct mll_{ using Int = long long; using ll = long long; ll val_=0; /*---- utility ----*/ mll_ &norm(){ return normR().normS(); }//正規化 mll_ &normR(){ val_%=MOD; return *this; }//剰余正規化のみ mll_ &normS(){ if (val_<0) val_+=MOD; return *this; }//正負正規化のみ mll_ &normP(){ if (val_>=MOD) val_-=MOD; return *this; }//加算時正規化 mll_ &invsg(){ val_=-val_; return normS(); }//正負反転 ll modinv(int a){//a^-1 mod MOD int ypre=0,y=1,apre=MOD; while (a>1){ int t=apre/a; apre-=a*t,swap(a,apre); ypre-=y*t,swap(y,ypre); } return y<0 ? y+MOD: y; } /*---- I/F ----*/ constexpr mll_(){} mll_(ll v): val_(v){ norm(); } constexpr mll_(ll v,bool b): val_(v){} //正規化無のコンストラクタ Int val()const{ return (Int)val_; } bool isnone() const { return val_==-1; } //true:値なし mll_ &none() { val_=-1; return *this; } //値なしにする mll_ &inv(){ val_=modinv((int)val_); return *this; } mll_ &operator+=(mll_ b){ val_+=b.val_; return normP(); } mll_ &operator-=(mll_ b){ val_-=b.val_; return normS(); } mll_ &operator*=(mll_ b){ val_*=b.val_; return normR(); } mll_ &operator/=(mll_ b){ return *this*=b.inv(); } mll_ &operator+=(ll b){ return *this+=mll_(b); } mll_ &operator-=(ll b){ return *this-=mll_(b); } mll_ &operator*=(ll b){ return *this*=mll_(b); } mll_ &operator/=(ll b){ return *this/=mll_(b); } mll_ &operator--(int){ return *this-=1; } mll_ &operator++(int){ return *this+=1; } mll_ operator-()const{ return mll_(*this).invsg(); } mll_ operator+(mll_ b)const{ return mll_(*this)+=b; } mll_ operator-(mll_ b)const{ return mll_(*this)-=b; } mll_ operator*(mll_ b)const{ return mll_(*this)*=b; } mll_ operator/(mll_ b)const{ return mll_(*this)/=b; } mll_ operator+(ll b)const{ return mll_(*this)+=b; } mll_ operator-(ll b)const{ return mll_(*this)-=b; } mll_ operator*(ll b)const{ return mll_(*this)*=b; } mll_ operator/(ll b)const{ return mll_(*this)/=b; } friend mll_ operator+(ll a,mll_ b){ return b+a; } friend mll_ operator-(ll a,mll_ b){ return -b+a; } friend mll_ operator*(ll a,mll_ b){ return b*a; } friend mll_ operator/(ll a,mll_ b){ return mll_(a)/b; } auto operator<=>(const mll_& b) const = default; friend ostream &operator<<(ostream &os,mll_ a){ return os << a.val_; } friend istream &operator>>(istream &is,mll_ &a){ return is >> a.val_; } mll_ pow(ll k)const{ mll_ ret(1,false),a(*this); for (; k>0; k>>=1,a*=a) if (k&1)ret*=a; return ret; } static constexpr int mod() { return MOD; } //enum{ modll=MOD }; }; struct bll{ ll s=0; bll(ll s_=0): s(s_){} bll(int s_): s(s_){} bll(const string &bitstr): s(str2val(bitstr)){} bll(const char *bitstr): s(str2val(bitstr)){} struct ref { bll &b; const ll msk; ref(bll &b_,ll pos):b(b_),msk(1LL<>pos)&1; } bll &operator=(int b){ s=b; return *this; } bll &operator=(ll b){ s=b; return *this; } bll &operator=(const string &bitstr){ s=str2val(bitstr); return *this; } bll &operator=(const char *bitstr){ s=str2val(bitstr); return *this; } bll operator++(int){ bll b(*this); s++; return b; } bll operator--(int){ bll b(*this); s--; return b; } operator ll() const noexcept { return s; } bll &operator&=(ll b){ s&=b; return *this; } bll &operator|=(ll b){ s|=b; return *this; } bll &operator^=(ll b){ s^=b; return *this; } bll &operator+=(ll b){ s+=b; return *this; } bll &operator-=(ll b){ s-=b; return *this; } bll &operator<<=(ll i){ s<<=i; return *this; } bll &operator>>=(ll i){ s>>=i; return *this; } bll operator&(ll b)const{ return s&b; } bll operator|(ll b)const{ return s|b; } bll operator^(ll b)const{ return s^b; } bll operator+(ll b)const{ return s+b; } bll operator-(ll b)const{ return s-b; } bll operator<<(ll i)const{ return s<>(ll i)const{ return s>>i; } bll operator&(int b)const{ return s&b; } bll operator|(int b)const{ return s|b; } bll operator^(int b)const{ return s^b; } bll operator+(int b)const{ return s+b; } bll operator-(int b)const{ return s-b; } bll operator<<(int i)const{ return s<>(int i)const{ return s>>i; } bll operator~()const{ return ~s; } bll &oneq (bll msk){ s|= msk.s; return *this; } bll &offeq (bll msk){ s&=~msk.s; return *this; } bll &flipeq(bll msk){ s^= msk.s; return *this; } bll on (bll msk)const{ return bll(s).oneq (msk); } bll off (bll msk)const{ return bll(s).offeq (msk); } bll flip (bll msk)const{ return bll(s).flipeq(msk); } bool any0(bll msk)const{ return ~s&msk.s; } bool any1(bll msk)const{ return s&msk.s; } bool all0(bll msk)const{ return !any1(msk); } bool all1(bll msk)const{ return !any0(msk); } bll &oneq (ll l,ll r){ return oneq (rngmsk(l,r)); } bll &offeq (ll l,ll r){ return offeq (rngmsk(l,r)); } bll &flipeq(ll l,ll r){ return flipeq(rngmsk(l,r)); } bll on (ll l,ll r)const{ return on (rngmsk(l,r)); } bll off (ll l,ll r)const{ return off (rngmsk(l,r)); } bll flip (ll l,ll r)const{ return flip(rngmsk(l,r)); } bool any0(ll l,ll r)const{ return any0(rngmsk(l,r)); } bool any1(ll l,ll r)const{ return any1(rngmsk(l,r)); } bool all0(ll l,ll r)const{ return all0(rngmsk(l,r)); } bool all1(ll l,ll r)const{ return all1(rngmsk(l,r)); } bll &maskeq(ll l,ll r){ s&=rngmsk(l,r); return *this; } bll mask(ll l,ll r)const{ return bll(s).maskeq(l,r); } bll &oneq (ll i){ s|= (1LL<>r; } static bll rngmsk(ll l,ll r){ return (1LL<<(l+1))-(1LL<(s).count(); } ll count(bll msk)const{ return (msk&s).count(); } ll count(ll l,ll r)const{ return mask(l,r).count(); } vector idxes()const{ vector v; for(ll i=0,t=s; t; t>>=1,i++) if(t&1)v.push_back(i); return v; } string to_string(ll wd=-1)const{ wd=max({wd,msbit()+1,1LL}); string ret; for(ll i=wd-1;i>=0;--i) ret += '0'+char((s>>i)&1); return ret; } private: ll str2val(const string &bitstr){ ll val=0, len=(ll)bitstr.size(); for(ll i=0;i struct SET: set{ using P=set; typename P::iterator it=P::end(); template SET(Args...args): P(args...){} SET(initializer_list a): P(a.begin(),a.end()){} ll size() const { return (ll)P::size(); } bool insert(const T &x){ bool r; tie(it,r)=P::insert(x); return r; } template void insert(It st,It en){ P::insert(st,en); } void insert(initializer_list a){ P::insert(a.begin(),a.end()); } template bool emplace(A&&...a){ bool r; tie(it,r)=P::emplace(a...); return r; } void eraseit(){ it=P::erase(it); } void find(const T &x){ it=P::find(x); } bool contains(const T &x){ return P::count(x)==1; } void lower_bound(const T &x){ it=P::lower_bound(x); } void upper_bound(const T &x){ it=P::upper_bound(x); } T floor(const T &x){ return *(it=--P::upper_bound(x)); } T ceil (const T &x){ return *(it=P::lower_bound(x)); } bool isend() { return it==P::end(); } T getit() { return *it; } T next() { return *(++it); } T prev() { return *(--it); } bool nextok() { return !isend() && it!=--P::end(); } bool prevok() { return it!=P::begin(); } T front() { return *(it=P::begin()); } T back() { return *(it=--P::end()); } void pop_front(){ front(); eraseit(); } void pop_back(){ back(); eraseit(); } void push_front(const T &x){ it=P::insert(P::begin(),x); } void push_back (const T &x){ it=P::insert(P::end(),x); } void push_out(SET &b){ b.push_front(back()); pop_back(); } void pull_in(SET &b){ push_back(b.front()); b.pop_front(); } }; template struct cumulativesum{ using Int = long long; using ll = long long; using pIT = pair; ll n=0; vector c; cumulativesum():c(1){} template cumulativesum(S &&v) : n((ll)v.size()),c(n+1) { Ini(v); } template void init(S &&v){ n=(ll)v.size(); c.resize(n+1); Ini(v); } void add(T x) { n++; c.push_back(c.back()+x); } T operator()(Int l,Int r){ return c[max(min(n,r+1),0LL)]-c[min(max(0LL,l),n)]; } pIT floorGroup(ll l,T x){ l=clamp(l,0LL,(ll)c.size()-1); T th=x+c[l]; ll r=upper_bound(c.begin(),c.end(),th)-c.begin()-2; T rem = r==-2 ? T() : th-c[r+1]; return {r,rem}; } pIT ceilGroup(ll l,T x){ l=clamp(l,0LL,(ll)c.size()-1); T th=x+c[l]; ll r=lower_bound(c.begin(),c.end(),th)-c.begin()-1; T rem = r==(ll)c.size()-1 ? T() : c[r+1]-th; return {r,rem}; } pIT floorGroupRev(ll r,T x){ // A0+…+A_{l-1} が (A0+…+Ar)-x以上に初めてなったときが答 r=clamp(r,-1LL,(ll)c.size()-2); ll th=c[r+1]-x; //(A0+…+Ar)-x ll l=lower_bound(c.begin(),c.end(),th)-c.begin(); T rem = l==(ll)c.size() ? T() : c[l]-th; return {l,rem}; } pIT ceilGroupRev(ll r,T x){ // A0+…+A_{l-1} が (A0+…+Ar)-x以下な最大のlが答 r=clamp(r,-1LL,(ll)c.size()-2); ll th=c[r+1]-x; //(A0+…+Ar)-x ll l=upper_bound(c.begin(),c.end(),th)-c.begin()-1; T rem = l==-1 ? T() : th-c[l]; return {l,rem}; } pIT groupIdx(ll l,T x){ auto [r,rem]=floorGroup(l,x); return (r+1==-1 || r+1==n) ? pIT{r+1,T()} : pIT{r+1,rem}; } pIT groupIdxRev(ll r,T x){ auto [l,rem]=floorGroupRev(r,x); return (l-1==-1 || l-1==n) ? pIT{l-1,T()} : pIT{l-1,c[l]-c[l-1]-1-rem}; } T mx(){//区間和max T mn=T(),samx=0; for (ll i=1; i<=n; ++i){ chmax(samx,c[i]-mn); chmin(mn,c[i]); } return samx; } template void Ini(S &&v) { for (ll i=0; i cumulativesum(S) -> cumulativesum::type::value_type>; template vector powers(T m,ll n){ vector ret(n+1,1); for(ll i=1;i<=n;++i) ret[i]=ret[i-1]*m; return ret; } template auto runlength(T &&v){ vector::type::value_type,ll>> ret; for(auto&&e:v){ if(ret.empty() or ret.back().first!=e) ret.emplace_back(e,1); else ret.back().second++; } return ret; } inline vector str2num(string &s,char base,const string &etc){ vector v(s.size()); for(ll i=0;i<(ll)s.size();++i){ size_t pos=etc.find(s[i]); if(pos==etc.npos) v[i]=s[i]-(ll)base; else v[i]=-((ll)pos+1); } return v; } template struct combination{ vector f,g; ll mxN=0; combination(){} combination(ll maxN): f(maxN+1,1),g(maxN+1),mxN(maxN) { for (ll i=1;i<=mxN;++i) { f[i]=f[i-1]*i; } g[mxN]=1/f[mxN]; for (ll i=mxN;i>=1;--i) { g[i-1]=g[i]*i; } } T P(ll n,ll r){ return (n<0 || r<0 || n vector CnLnR(long long nL,long long nR,long long r,SP sp){ if (nR-nL+1<=0) return vector(); if (r<0) return vector(nR-nL+1,0); vector v=sp(nL-r+1,nR-r+1,r); for (T& e: v) e*=finv(r); return v; } template vector HrLrR(long long n,long long rL,long long rR,SP sp){//r<0不可 return CnLnR(n-1+rL,n-1+rR,n-1,sp); } }; template struct wrapVector1d{ using S=typename T::value_type; using Int = long long; const T *v; S Ini; wrapVector1d(const T &v_,S ini_=S()):v(&v_),Ini(ini_){} S operator[](Int i)const{ return (i<0 || (Int)v->size()<=i) ? Ini : (*v)[i]; } }; template struct wrapVector2d{ using S=typename T::value_type; using Int = long long; const vector *v; S Ini; T dmy; wrapVector2d(const vector &v_,S ini_=S()):v(&v_),Ini(ini_){} wrapVector1d operator[](ll i)const{ return (i<0 || (Int)v->size()<=i) ? wrapVector1d(dmy,Ini) : wrapVector1d((*v)[i],Ini); } }; namespace dumpstring{//dummy inline string stringf(const char *format,...){ char bf[1000]; va_list ap; va_start(ap,format); vsprintf(bf,format,ap); va_end(ap); return string(bf); } template string stringfx(T x,int wd=1){ return ""; } struct args{ using Int = long long; args(){} args &wd(Int wd__){ (void)wd__; return *this; } args &sx(Int s){ (void)s; return *this; } template args &rngs(array,2> rngs){ return *this; } args &tr(vector tr__){ (void)tr__; return *this; } args &tr(){ return *this; } args &labels(vector labels__){ (void)labels__; return *this; } args &xrev(){ return *this; } args &yrev(){ return *this; } args &zrev(){ return *this; } args &wrev(){ return *this; } }; template void dumpNd(const string &h,const NdT &fd,const args &p=args(),ostream &os=cerr){} }; using dumpstring::stringf; using dumpstring::stringfx; using dumpstring::args; using dumpstring::dumpNd; #endif//テンプレートend template struct Vector: vector{ using Int = long long; using vT=vector; using cvT=const vector; using cT=const T; using vT::vT; //親クラスのコンストラクタの隠蔽を回避 using vT::begin,vT::end,vT::insert,vT::erase; auto it(Int i){ return begin()+i; } auto it(Int i)const{ return begin()+i; } Vector(cvT& b):vT(b){} Vector(vT&& b):vT(move(b)){} Vector(int n,cT& x):vT(n,x){}// ┬ 型推論のためラッパー Vector(long long n,cT& x):vT(n,x){} template Vector(const Vector& b):vT(b.begin(),b.end()){} template Vector(const vector& b):vT(b.begin(),b.end()){} Vector(Int n,T s,T d){ iota(n,s,d); } Vector(Int n,function g):vT(n){ for(Int i=0;i &b){ return *this+=(cvT&)b; } Vector &operator-=(const Vector &b){ return *this-=(cvT&)b; } Vector &operator*=(const Vector &b){ return *this*=(cvT&)b; } Vector &operator/=(const Vector &b){ return *this/=(cvT&)b; } Vector &operator%=(const Vector &b){ return *this%=(cvT&)b; } Vector operator+(cvT &b){ return Vector(*this)+=b; } Vector operator-(cvT &b){ return Vector(*this)-=b; } Vector operator*(cvT &b){ return Vector(*this)*=b; } Vector operator/(cvT &b){ return Vector(*this)/=b; } Vector operator%(cvT &b){ return Vector(*this)%=b; } Vector operator+(const Vector &b){ return Vector(*this)+=b; } Vector operator-(const Vector &b){ return Vector(*this)-=b; } Vector operator*(const Vector &b){ return Vector(*this)*=b; } Vector operator/(const Vector &b){ return Vector(*this)/=b; } Vector operator%(const Vector &b){ return Vector(*this)%=b; } template Vector &operator+=(S x){ for(T &e: *this) e+=x; return *this; } template Vector &operator-=(S x){ for(T &e: *this) e-=x; return *this; } template Vector &operator*=(S x){ for(T &e: *this) e*=x; return *this; } template Vector &operator/=(S x){ for(T &e: *this) e/=x; return *this; } template Vector &operator%=(S x){ for(T &e: *this) e%=x; return *this; } template Vector operator+(S x)const{ return Vector(*this)+=x; } template Vector operator-(S x)const{ return Vector(*this)-=x; } template Vector operator*(S x)const{ return Vector(*this)*=x; } template Vector operator/(S x)const{ return Vector(*this)/=x; } template Vector operator%(S x)const{ return Vector(*this)%=x; } Vector &operator--(int){ return *this-=1; } Vector &operator++(int){ return *this+=1; } Vector operator-()const{ return Vector(*this)*=-1; } template friend Vector operator-(S x,const Vector &a){ return -a+=x; } T& at(Int i){ assert(i>=0); if(n()<=i)vT::resize(i+1); return vT::operator[](i); } Vector slice(Int l,Int r,Int d=1)const{ Vector ret; for(Int i=l;(d>0&&i<=r)||(d<0&&r<=i);i+=d) ret.push_back((*this)[i]); return ret; } Int size()const{ return (Int)vT::size(); } Int n()const{ return size(); } Vector &push_back(cT& x,Int n=1){ for(Int i=0;iinsert(0,x,n); return *this; } Vector &pop_front(Int n=1){ erase(0,n-1); return *this; } T pull_back(){ T x=move(vT::back()); vT::pop_back(); return x; } T pull_front(){ T x=move(vT::front()); erase(0); return x; } Vector &insert(Int i,cT& x,Int n=1){ insert(it(i),n,x); return *this; } Vector &insert(Int i,cvT& b){ insert(it(i),b.begin(),b.end()); return *this; } Vector &erase(Int i){ erase(it(i)); return *this; } Vector &erase(Int l,Int r){ erase(it(l),it(r+1)); return *this; } Vector &erase(const Vector &idxs){ for (Int I=0; In(); copy(it(l),it(r),it(l-I-1));//[l,r)を前にI+1個ずらす } vT::resize(this->n()-idxs.n()); return *this; } Vector &eraseall(cT& x){ return eraseall(0,size()-1,x); } Vector &eraseall(Int l,Int r,cT& x){ erase(remove(it(l),it(r+1),x),it(r+1)); return *this; } template Vector &eraseif(Pr pr){ return eraseif(0,size()-1,pr); } template Vector &eraseif(Int l,Int r,Pr pr){ erase(remove_if(it(l),it(r+1),pr),it(r+1)); return *this; } Vector &concat(cvT &b,Int n=1){ cvT B = (&b==this) ? *this : vT{}; for(int i=0;iinsert(size(),(&b==this)?B:b); return *this; } Vector repeat(Int n){ return Vector{}.concat(*this,n); } Vector &reverse(Int l=0,Int r=-1){ r+=r<0?size():0; std::reverse(it(l),it(r+1)); return *this; } Vector &rotate(Int m){ return rotate(0,size()-1,m); } Vector &rotate(Int l,Int r,Int m){ std::rotate(it(l),it(m),it(r+1)); return *this; } Vector &sort(Int l=0,Int r=-1){ r+=r<0?size():0; std::sort(it(l),it(r+1)); return *this; } Vector &rsort(Int l=0,Int r=-1){ return sort(l,r).reverse(l,r); } template Vector &sort(Pr pr){ return sort(0,size()-1,pr); } template Vector &sort(Int l,Int r,Pr pr){ std::sort(it(l),it(r+1),pr); return *this; } template Vector &sortbykey(Int l=0,Int r=-1){ r+=r<0?size():0; sort(l,r,[](cT &x,cT &y){return get(x)(y);}); return *this; } Vector &uniq(){ erase(unique(begin(),end()),end()); return *this; } Vector &sortq(){ return sort().uniq(); } Vector &fill(cT& x){ return fill(0,size()-1,x); } Vector &fill(Int l,Int r,cT& x){ std::fill(it(l),it(r+1),x); return *this; } template Vector &iota(Int n,T s=0,S d=1){ vT::resize(n); if(n==0) return *this; (*this)[0]=s; for(int i=1;i Int countif(Pr pr)const{ return countif(0,size()-1,pr); } template Int countif(Int l,Int r,Pr pr)const{ return Int(count_if(it(l),it(r+1),pr)); } Int find(cT& x)const{ return find(0,size()-1,x); } Int find(Int l,Int r,cT& x)const{ return Int(std::find(it(l),it(r+1),x)-begin()); } Int rfind(cT& x)const{ return rfind(0,size()-1,x); } Int rfind(Int l,Int r,cT& x)const{ for (int i=r;i>=l;--i) if ((*this)[i]==x) return i; return l-1; } template Int findif(Pr pr)const{ return findif(0,size()-1,pr); } template Int findif(Int l,Int r,Pr pr)const{ return Int(find_if(it(l),it(r+1),pr)-begin()); } Vector findall(cT& x)const{ return findall(0,size()-1,x); } Vector findall(Int l,Int r,cT& x)const{ return findallif(l,r,[&](cT& y){return y==x;}); } template Vector findallif(Pr pr)const{ return findallif(0,size()-1,pr); } template Vector findallif(Int l,Int r,Pr pr)const{ Vector ret; for(Int i=l;i<=r;++i) if(pr((*this)[i])) ret.push_back(i); return ret; } Int flooridx(cT& x)const{ return Int(upper_bound(begin(),end(),x)-begin()-1); } Int ceilidx(cT& x)const{ return Int(lower_bound(begin(),end(),x)-begin()); } Int leftnmof(cT& x)const{ return flooridx(x)+1; } Int rightnmof(cT& x)const{ return size()-ceilidx(x); } bool contains(cT& x)const{ Int i=flooridx(x); return i>=0 && (*this)[i]==x; } template Int flooridx(cT& x,Pr pr)const{ return Int(upper_bound(begin(),end(),x,pr)-begin()-1); } template Int ceilidx(cT& x,Pr pr)const{ return Int(lower_bound(begin(),end(),x,pr)-begin()); } template Int leftnmof(cT& x,Pr pr)const{ return flooridx(x,pr)+1; } template Int rightnmof(cT& x,Pr pr)const{ return size()-ceilidx(x,pr); } template bool contains(cT& x,Pr pr)const{ Int i=flooridx(x,pr); return i>=0 && (*this)[i]==x; } template using VV = Vector>; template using sVV = vector>; template using VVV = Vector>; template using sVVV = vector>; template using VVVV = Vector>; template using sVVVV = vector>; template using VVVVV = Vector>; template using sVVVVV = vector>; auto tostd()const{ return tov(*this); } template static vector tov(const Vector&v){ return v; } template static sVV tov(const VV &v){ sVV ret; for(auto&& e:v) ret.push_back(e); return ret; } template static sVVV tov(const VVV &v){ sVVV ret; for(auto&& e:v) ret.push_back(e.tostd()); return ret; } template static sVVVV tov(const VVVV &v){ sVVVV ret; for(auto&& e:v) ret.push_back(e.tostd()); return ret; } template static sVVVVV tov(const VVVVV &v){ sVVVVV ret; for(auto&& e:v) ret.push_back(e.tostd()); return ret; } }; /* vll a={9,8,7},b={1,2,3}; vpll p={{5,3},{7,8},{0,2},}; - -------- 操作系 -------- a+=x a-=x a*=x a/=x a%=x a+x a-x a*x a/x a%x -a x-a a++ a-- //∀i a[i]にxを演算 a+=b a-=b a*=b a/=b a%=b a+b a-b a*b a/b a%b //要素毎演算(同サイズ時) a.at(i)=x; //a[i]=x,未確保ならresize a.push_front(x,n); //n個先頭追加省略時1 a.push_back(x,n); //n個末尾追加省略時1 a.pop_front(n); //n個先頭削除省略時1 a.pop_back(n); //n個末尾削除省略時1 ll x=a.pull_front(); //pop_front()と同時に値取得 ll x=a.pull_back(); //pop_back()と同時に値取得 a.insert(i,x,n); //a[i]にn個x挿入 n省略時1 a.insert(i,b); //a[i]にvll b挿入 a.erase(i); //a[i]削除 a.erase(l,r); //区間[l,r]削除 a.erase(idxs.sortq()); //a[i0],a[i1],…を削除 idxsはソート&ユニーク必要 a.eraseall(x); //xを全て削除 a.eraseall(l,r,x); //区間[l,r]のxを全て削除 a.eraseif(pr); //条件prを満たす要素を全て削除 a.eraseif(l,r,pr); //区間[l,r]の条件prを満たす要素を全て削除 a.concat(b); //aにbを結合 b=a可 a.concat(b,n); //aにbをn回結合 b=a可 a.reverse(l,r); //[l,r]を反転 l,r省略可 a.rotate(m); //a[m]を先頭にするrotate a.rotate(l,r,m); //a[m]を先頭にするrotate 範囲[l,r] a.sort(l,r); //[l,r]をソート l,r省略可 a.rsort(l,r); //[l,r]を逆順ソート l,r省略可 p.sort(l,r,[&](pll x,pll y){return x.second0; }; //検索条件 ll m=a.count(x); //xの個数 ll m=a.count(l,r,x); //xの個数in[l,r] ll m=a.countif(pr); //条件満たす個数 ll m=a.countif(l,r,pr); //条件満たす個数in[l,r] ll i=a.find(x); //xの最左位置i ない時N(配列長) ll i=a.find(l,r,x); //xの最左位置i in[l,r] ない時r+1 ll i=a.findif(pr); //条件満たす最左位置i ない時N(配列長) ll i=a.findif(l,r,pr); //条件満たす最左位置i in[l,r] ない時r+1 vll is=a.findall(x); //xの位置i列挙 vll is=a.findall(l,r,x); //xの位置i列挙in[l,r] vll is=a.findallif(pr); //条件満たす位置i列挙 vll is=a.findallif(l,r,pr); //条件満たす位置i列挙in[l,r] - -------- 昇順sort済み配列用 -------- ll i=a.flooridx(x); //x以下の最近傍位置i ない時-1 ll i=a.ceilidx(x); //x以上の最近傍位置i ない時N(配列長) ll m=a.leftnmof(x); //x以下の個数 ll m=a.rightnmof(x); //x以上の個数 bool b=a.contains(x); //xを含む - -------- 比較関数prでsort済みの配列用 -------- auto pr=[&](auto &x,auto &y){ return x>y; }; //降順ソート時 ll i=a.flooridx(x,pr); //x以左の最近傍位置i ない時-1 ll i=a.ceilidx(x,pr); //x以右の最近傍位置i ない時N(配列長) ll m=a.leftnmof(x,pr); //x以左の個数 ll m=a.rightnmof(x,pr); //x以右の個数 bool b=a.contains(x,pr); //xを含む a.concat(b,n).pop_back().rsort().uniq(); //連続適用できる auto aa=a.tostd(); //N次元VectorをN次元vectorに変換(N≦5) */ template struct wrapv: Vector{ using Int = long long; T def=T(); T defIF=T(); wrapv(const Vector &b):Vector(b){} wrapv(Vector &&b):Vector(move(b)){} wrapv(const std::vector &b):Vector(b){} wrapv(std::vector &&b):Vector(move(b)){} T &operator[](Int i){ return (i<0 || this->size()<=i) ? (defIF=def) : Vector::operator[](i); } void setdef(const T& x){ def=x; } }; /* wrapv v=vll(N,0,1); //vllなどでコンストラクトしてから代入する v.setdef(INF); //範囲外での値セット */ #if 0 #define MODLL (1000000007LL) #else #define MODLL (998244353LL) #endif using mll = mll_; //using mll = fraction; //　１ //０┼２ //　３左上右下 const vector dxys={{0,-1},{-1,0},{0,1},{1,0},}; const string lurd="LURD"; namespace SolvingSpace{ template using vector = Vector; using vll=vector< ll>; using vmll=vector< mll>; using vdd=vector< dd>; using vvll=vector< vll>; using vvmll=vector< vmll>; using vvdd=vector< vdd>; using vvvll=vector< vvll>; using vvvmll=vector< vvmll>; using vvvdd=vector< vvdd>; using vvvvll=vector; using vvvvmll=vector; using vvvvdd=vector; using vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>; using vvpll=vector< vpll>; using vvtll=vector< vtll>; using vvqll=vector< vqll>; using vll2=vector< ll2>; using vll3=vector< ll3>; using vll4=vector< ll4>; using vvll2=vector< vll2>; using vvll3=vector< vll3>; using vvll4=vector< vll4>; using vvvll2=vector; using vvvll3=vector< vvll3>; using vvvll4=vector; using vss=vector; template vector cinv(ll nm){ return vector(nm,[](ll i){ (void)i; return cin1(); }); } template vector> cinvv(ll H,ll W){ return vector>(H,[&](ll i){ (void)i; return cinv(W); }); } /*■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■ ■■■■■■■■■■■■■■■*/ namespace V2Dspace{ using ll = long long; template //vector,vector>等を許すconcept concept VEC2Dconcept = requires{ typename T::value_type; typename T::value_type::value_type; }; template pair GetHW(VEC2D &fd){ ll H = (ll)fd.size(); ll W = H==0 ? 0LL : (ll)fd[0].size(); return {H,W}; } template VEC2D Core( VEC2D &fd, const ll mode, //!<[in] 0:そのまま 1:90度回転 2:180度 3:270度 //!< 4:transpose 5:上下反転 6:左右反転 bool inplace, //!<[in] true:inplace, false:新規作成 ll sx=-1,ll ex=-1,ll sy=-1,ll ey=-1//!<[in]範囲指定省略時全体 ){ using VEC1D = typename VEC2D::value_type; //string or vector auto is90=[](ll mode){ return mode==1 || mode==3 || mode==4; }; //if (fd.empty()) return VEC2D{}; //ll H=(ll)fd.size(),W=(ll)fd[0].size(); auto [H,W]=GetHW(fd); if (sx==-1) sx=0,ex=H-1,sy=0,ey=W-1; //デフォルトの指定範囲=全体 ll h=ex-sx+1,w=ey-sy+1;//指定範囲の高さと幅 ll nh=is90(mode) ? w : h,nw=is90(mode) ? h : w; //新しい高さと幅 //-- まず新規作成 VEC2D ret(nh,VEC1D(nw,0)); for (ll i=sx; i<=ex; ++i) for (ll j=sy; j<=ey; ++j){ if (mode==0) ret[i-sx][j-sy]=fd[i][j]; else if (mode==1) ret[nh-1-j+sy][i-sx]=fd[i][j]; else if (mode==2) ret[nh-1-i+sx][nw-1-j+sy]=fd[i][j]; else if (mode==3) ret[j-sy][nw-1-i+sx]=fd[i][j]; else if (mode==4) ret[j-sy][i-sx]=fd[i][j]; else if (mode==5) ret[nh-1-i+sx][j-sy]=fd[i][j]; else if (mode==6) ret[i-sx][nw-1-j+sy]=fd[i][j]; else assert(false); } //-- inplaceならfdにコピー if (inplace){ assert(h==w || mode==0 || mode==2 || mode==5 || mode==6); for (ll i=0; i VEC2D clip(VEC2D &fd,ll sx,ll ex,ll sy,ll ey){ return Core(fd,0,false,sx,ex,sy,ey); } template VEC2D rot90 (VEC2D &fd){ return Core(fd,1,false); } template VEC2D rot180 (VEC2D &fd){ return Core(fd,2,false); } template VEC2D rot270 (VEC2D &fd){ return Core(fd,3,false); } template VEC2D transpose(VEC2D &fd){ return Core(fd,4,false); } template VEC2D flipTB (VEC2D &fd){ return Core(fd,5,false); } template VEC2D flipLR (VEC2D &fd){ return Core(fd,6,false); } template void inplaceRot90 (VEC2D &fd,ll sx,ll ex,ll sy,ll ey){ Core(fd,1,true,sx,ex,sy,ey); } template void inplaceRot180 (VEC2D &fd,ll sx,ll ex,ll sy,ll ey){ Core(fd,2,true,sx,ex,sy,ey); } template void inplaceRot270 (VEC2D &fd,ll sx,ll ex,ll sy,ll ey){ Core(fd,3,true,sx,ex,sy,ey); } template void inplaceTranspose(VEC2D &fd,ll sx,ll ex,ll sy,ll ey){ Core(fd,4,true,sx,ex,sy,ey); } template void inplaceFlipTB (VEC2D &fd,ll sx,ll ex,ll sy,ll ey){ Core(fd,5,true,sx,ex,sy,ey); } template void inplaceFlipLR (VEC2D &fd,ll sx,ll ex,ll sy,ll ey){ Core(fd,6,true,sx,ex,sy,ey); } template void paste2d(VEC2D &fd,VEC2D &gd,ll sx,ll sy){ auto [H,W]=GetHW(fd); for (ll i=0; i<(ll)gd.size(); ++i){ for (ll j=0; j<(ll)gd[i].size(); ++j){ ll x=sx+i,y=sy+j; if (0<=x && x void assign2d(VEC2D &fd,ll sx,ll ex,ll sy,ll ey,T val){ auto [H,W]=GetHW(fd); for (ll x=max(sx,0LL); x<=min(ex,H-1); ++x){ for (ll y=max(sy,0LL); y<=min(ey,W-1); ++y){ fd[x][y]=val; } } } }//namespace V2Dspace using V2Dspace::clip; using V2Dspace::rot90; using V2Dspace::inplaceRot90; using V2Dspace::rot180; using V2Dspace::inplaceRot180; using V2Dspace::rot270; using V2Dspace::inplaceRot270; using V2Dspace::transpose; using V2Dspace::inplaceTranspose; using V2Dspace::flipTB; using V2Dspace::inplaceFlipTB; using V2Dspace::flipLR; using V2Dspace::inplaceFlipLR; using V2Dspace::paste2d; using V2Dspace::assign2d; /* - vss,vvll等使用可能 - ---- 新規作成系 ---- auto gd=clip(fd,sx,ex,sy,ey); auto gd=rot90 (fd); auto gd=rot180 (fd); auto gd=rot270 (fd); auto gd=transpose(fd); auto gd=flipTB (fd); auto gd=flipLR (fd); - ---- inplace系 ---- 変換後も同じ縦横サイズなら可(正方形 or Rot180,flip) inplaceRot90 (fd,sx,ex,sy,ey); inplaceRot180 (fd,sx,ex,sy,ey); inplaceRot270 (fd,sx,ex,sy,ey); inplaceTranspose(fd,sx,ex,sy,ey); inplaceFlipTB (fd,sx,ex,sy,ey); inplaceFlipLR (fd,sx,ex,sy,ey); paste2d (fd,gd,sx,sy); //fdのsx,syにgdを貼り付けはみ出し可,gdは非長方形可 assign2d(fd,sx,ex,sy,ey,val); //fdの範囲[sx,ex][sy,ey]にvalを代入はみ出し可 - ---- 90度回転の向き ---- ★・・・● ★・ → ★★◇ ◇● */ void cin2solve() { auto [H,W]=cins(); bool rev=false; if (Hvoid{ /* srcをtranspose srcの番号を+Kする dstの下に追加結合 */ if (src.empty()) return; vvll fd=transpose(src); for (auto&& v: fd) for (auto&& va: v) va+=K; for (auto&& v: fd) dst.push_back(move(v)); K+=KK; }; auto makeCC3H=[&](ll H)->pair{ if (H%2==1) return {vvll(),0ll}; vvll fd(H,vll(3)); fd[0]={1,1,1}; rep(x,1,H-3,2){ ll z=x/2+1; fd[x ]={z,z+1,z+1}; fd[x+1]={z,z, z+1}; if ((x/2)%2==1){ fd[x ].reverse(); fd[x+1].reverse(); } } fd[H-1]={H/2,H/2,H/2}; return {move(fd),H/2}; }; auto makeCC4H=[&](ll H)->pair{ vvll fd(H,vll(4)); fd[0]={1,2,2,2}; rep(x,1,H-2) fd[x]={1,2,1,2}; fd[H-1]={1,1,1,2}; return {move(fd),2}; }; auto makeCC5H=[&](ll H)->pair{ vvll fd(H,vll(5)); fd[0]={1,1,1,1,1}; fd[1]={1,2,2,2,1}; rep(x,2,H-2) fd[x]={1,2,3,2,3}; fd[H-1]={1,2,3,3,3}; return {move(fd),3}; }; auto makeCC6H=[&](ll H)->pair{ vvll fd(H,vll(6)); fd[0]={1,2,2,2,2,3}; rep(x,1,H-2) fd[x]={1,2,1,3,2,3}; fd[H-1]={1,1,1,3,3,3}; return {move(fd),3}; }; auto makeCC7H=[&](ll H)->pair{ vvll fd(H,vll(7)); fd[0]={1,1,1,1,1,1,1}; fd[1]={1,2,2,2,2,2,1}; fd[2]={4,2,3,3,3,2,1}; rep(x,3,H-2) fd[x]={4,2,3,4,3,2,1}; fd[H-1] ={4,4,4,4,3,2,1}; return {move(fd),4}; }; auto makeTT3H=[&](ll H)->pair{ if (H<6) return {vvll(),0ll}; vvll fd(H,vll(3)); fd[0]={1,1,1}; fd[1]={2,1,3}; fd[2]={2,2,3}; fd[3]={2,3,3}; rep(x,4,H-2) fd[x]={2,4,3}; fd[H-1]={4,4,4}; return {move(fd),4}; }; auto makeTT4H=[&](ll H)->pair{ vvll fd(H,vll(4)); fd[0]={1,1,1,2}; fd[1]={3,1,2,2}; rep(x,2,H-3) fd[x]={3,1,4,2}; fd[H-2]={3,3,4,2}; fd[H-1]={3,4,4,4}; return {move(fd),4}; }; auto makeTT5H=[&](ll H)->pair{ vvll fd(H,vll(5)); fd[0]={2,2,2,4,5}; fd[1]={1,2,4,4,5}; rep(x,2,H-3) fd[x]={1,2,3,4,5}; fd[H-2]={1,1,3,5,5}; fd[H-1]={1,3,3,3,5}; return {move(fd),5}; }; auto makeCT3H=[&](ll H)->pair{ vvll fd(H,vll(3)); fd[0]={1,1,1}; rep(x,1,H-2) fd[x]={1,2,1}; fd[H-1]={2,2,2}; return {move(fd),2}; }; auto makeCT4H=[&](ll H)->pair{ vvll fd(H,vll(4)); fd[0]={1,3,3,3}; fd[1]={1,1,3,2}; rep(x,2,H-2) fd[x]={1,2,3,2}; fd[H-1]={1,2,2,2}; return {move(fd),3}; }; auto makeCT5H=[&](ll H)->pair{ vvll fd(H,vll(5)); fd[0]={1,1,1,1,1}; rep(x,1,H-3) fd[x]={3,2,1,2,3}; fd[H-2]={3,2,2,2,3}; fd[H-1]={3,3,3,3,3}; return {move(fd),3}; }; auto makeCC=[&](ll H,ll W)->pair{ vvll ret; ll K=0; while (W>=8){ auto [fd,KK]=makeCC4H(H); conbelow(ret,K,fd,KK); W-=4; } { vvll fd; ll KK=0; if (W==2) ; else if (W==3) tie(fd,KK)=makeCC3H(H); else if (W==4) tie(fd,KK)=makeCC4H(H); else if (W==5) tie(fd,KK)=makeCC5H(H); else if (W==6) tie(fd,KK)=makeCC6H(H); else if (W==7) tie(fd,KK)=makeCC7H(H); else assert(false); conbelow(ret,K,fd,KK); } if (ret.size()) ret=transpose(ret); return {move(ret),K}; }; auto makeTT=[&](ll H,ll W)->pair{ vvll ret; ll K=0; while (W>=6){ auto[fd,KK]=makeTT3H(H); conbelow(ret,K,fd,KK); W-=3; } { vvll fd; ll KK=0; if (W==2) ; else if (W==3) tie(fd,KK)=makeTT3H(H); else if (W==4) tie(fd,KK)=makeTT4H(H); else if (W==5) tie(fd,KK)=makeTT5H(H); else assert(false); conbelow(ret,K,fd,KK); } if (ret.size()) ret=transpose(ret); return {move(ret),K}; }; auto makeCT=[&](ll H,ll W)->pair{ vvll ret; ll K=0; while (W>=6){ auto [fd,KK]=makeCT3H(H); conbelow(ret,K,fd,KK); W-=3; } { vvll fd; ll KK=0; if (W==2) ; else if (W==3) tie(fd,KK)=makeCT3H(H); else if (W==4) tie(fd,KK)=makeCT4H(H); else if (W==5) tie(fd,KK)=makeCT5H(H); else assert(false); conbelow(ret,K,fd,KK); } if (ret.size()) ret=transpose(ret); return {move(ret),K}; }; auto [anscc,Kcc]=makeCC(H,W); auto [anstt,Ktt]=makeTT(H,W); auto [ansct,Kct]=makeCT(H,W); if (rev){ if (anscc.size()) anscc=transpose(anscc); if (anstt.size()) anstt=transpose(anstt); if (ansct.size()) ansct=transpose(ansct); } if (anscc.size()){ cout << Kcc << '\n'; for (auto&& e: anscc) cout << e << '\n'; } else cout << -1 << '\n'; if (anstt.size()){ cout << Ktt << '\n'; for (auto&& e: anstt) cout << e << '\n'; } else cout << -1 << '\n'; if (ansct.size()){ cout << Kct << '\n'; for (auto&& e: ansct) cout << e << '\n'; } else cout << -1 << '\n'; return; } }//SolvingSpace ////////////////////////////////////////// int main(){ #if 1 //SolvingSpace::labo(); SolvingSpace::cin2solve(); //SolvingSpace::generand(); #else ll t; cin >> t; rep(i,0,t-1){ SolvingSpace::cin2solve(); //SolvingSpace::generand(); } #endif cerr << timeget() <<"ms"<< '\n'; return 0; }