結果

問題 No.2409 Strange Werewolves
ユーザー eQeeQe
提出日時 2023-08-11 21:37:41
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 29 ms / 2,000 ms
コード長 6,816 bytes
コンパイル時間 5,912 ms
コンパイル使用メモリ 333,920 KB
実行使用メモリ 35,328 KB
最終ジャッジ日時 2024-04-29 12:28:29
合計ジャッジ時間 6,799 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 27 ms
35,328 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 28 ms
10,240 KB
testcase_04 AC 28 ms
10,232 KB
testcase_05 AC 15 ms
6,656 KB
testcase_06 AC 28 ms
10,220 KB
testcase_07 AC 29 ms
10,368 KB
testcase_08 AC 17 ms
7,040 KB
testcase_09 AC 18 ms
7,296 KB
testcase_10 AC 9 ms
5,376 KB
testcase_11 AC 3 ms
5,376 KB
testcase_12 AC 9 ms
5,376 KB
testcase_13 AC 17 ms
6,912 KB
testcase_14 AC 19 ms
7,552 KB
testcase_15 AC 18 ms
7,296 KB
testcase_16 AC 15 ms
6,528 KB
testcase_17 AC 3 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define RD(T,...) T __VA_ARGS__;li(__VA_ARGS__)
#define LL(...) RD(ll,__VA_ARGS__)
#define JO(a,b) a##b
#define jo(a,b) JO(a,b)
#define uqsymb(a) jo(a,__LINE__)
#define FE(v,e,...) for(auto&&__VA_OPT__([)e __VA_OPT__(,__VA_ARGS__]):v)
#define FO(n) for(ll uqsymb(i)=n;uqsymb(i)-->0;)
#define FOR(i,...) for(auto[i,i##O,i##E]=rng(0,__VA_ARGS__);i<i##O;i+=i##E)
#define fe(v,...) FE(v,__VA_ARGS__)
#define fo(i,...) FO##__VA_OPT__(R)(i __VA_OPT__(,__VA_ARGS__))
#define of(i,...) for(auto[i,i##O,i##E]=rng(1,__VA_ARGS__);i>=i##O;i-=i##E)
using std::cin,std::cout,std::begin,std::end,std::rbegin;
using std::swap,std::move,std::abs,std::prev,std::next;
using std::tuple,std::bitset,std::minmax,std::get;
using vo=void;using bo=bool;
vo solve();
using is=std::istream;using os=std::ostream;
using dd=long double;using ll=long long;using ull=unsigned long long;
using lll=__int128_t;using ulll=__uint128_t;using str=std::string;
using namespace atcoder;using ml=modint;auto&operator<<(os&o,const ml&x){return o<<x.val();}
constexpr ll oo=3e18;
constexpr ll dx[]{-1,0,1,0,-1,1,1,-1},dy[]{0,-1,0,1,-1,-1,1,1};
constexpr char sp=32;
constexpr char nl=10;
auto rng(bo s,ll a,ll b=oo,ll c=1){if(b==oo)b=a,(s?b:a)=0;return tuple{a-s,b,c};}

ll pwm1(ll x){return 1-2*(x&1);}
template<class T>T zz(T x){return x<0?-x:x;}
template<class T>ll len(const T&a){return a.size();}

struct edg{
  ll t,w;
  edg(){}
  edg(ll t,ll w=1):t(t),w(w){}
  friend os&operator<<(os&o,const edg&e){return o<<e.t<<sp<<e.w;}
};

template<class A,class B=A>struct cp{
  A a={};B b={};
  cp(){}
  cp(A a,B b):a(a),b(b){}
  cp(std::pair<A,B>p):a(p.first),b(p.second){}
  bo operator==(const cp&c)const{return a==c.a&&b==c.b;}
  bo operator<(const cp&c)const{return a!=c.a?a<c.a:b<c.b;}
  bo operator>(const cp&c)const{return a!=c.a?a>c.a:b>c.b;}

  friend is&operator>>(is&i,cp&c){return i>>c.a>>c.b;}
  friend os&operator<<(os&o,const cp&c){return o<<c.a<<sp<<c.b;}
};using cl=cp<ll>;
template<class A,class B=A,class C=A>struct tr{
  A a={};B b={};C c={};
  tr(){}
  tr(A a,B b,C c):a(a),b(b),c(c){}
  bo operator==(const tr&t)const{return a==t.a&&b==t.b&&c==t.c;}

  auto operator<(const tr&t)const{return a!=t.a?a<t.a:b!=t.b?b<t.b:c<t.c;}
  friend is&operator>>(is&i,tr&t){return i>>t.a>>t.b>>t.c;}
  friend os&operator<<(os&o,const tr&t){return o<<t.a<<sp<<t.b<<sp<<t.c;}
};using tl=tr<ll>;

template<class T>decltype(auto)rb(T&a){return*rbegin(a);}
template<class T>auto pot(T&a){auto r=a.top();a.pop();return r;}

template<class V>struct ve;
template<class V>constexpr bo isv=0;
template<class V>constexpr bo isv<ve<V>> =1;
template<class V>constexpr bo isv<std::vector<V>> =1;
template<class V>auto rawv(V){if constexpr(isv<V>)return rawv(V(1)[0]);else return V();}

template<class V>struct ve:std::vector<V>{
  using std::vector<V>::vector;
  using T=decltype(rawv(V()));
  template<class U>ve(const std::vector<U>&v={}){fe(v,e)this->eb(e);}

  auto&operator+=(const ve&u){auto&v=*this;fo(i,len(v))v[i]+=u[i];return v;}
  auto&operator-=(const ve&u){auto&v=*this;fo(i,len(v))v[i]-=u[i];return v;}
  auto&operator^=(const ve&u){fe(u,e)this->eb(e);return*this;}
  auto&operator+=(const T&x){auto&v=*this;fe(v,e)e+=x;return v;}
  auto&operator-=(const T&x){auto&v=*this;fe(v,e)e-=x;return v;}
  auto&operator*=(const T&x){auto&v=*this;fe(v,e)e*=x;return v;}
  template<size_t n>auto&operator+=(const bitset<n>&a){fo(i,n)(*this)[i]+=a[i];return*this;}
  template<size_t n>auto&operator-=(const bitset<n>&a){fo(i,n)(*this)[i]-=a[i];return*this;}

  auto operator+(const ve&u){return ve(*this)+=u;}
  auto operator-(const ve&u){return ve(*this)-=u;}
  auto operator^(const ve&u){return ve(*this)^=u;}
  auto operator+(const T&x){return ve(*this)+=x;}auto&operator++(){return*this+=1;}
  auto operator-(const T&x){return ve(*this)-=x;}auto&operator--(){return*this-=1;}
  auto operator*(const T&x){return ve(*this)*=x;}auto operator-(){return ve(*this)*=-1;}

  auto lower_bound(const V&x)const{return std::lower_bound(all(*this),x);}
  auto upper_bound(const V&x)const{return std::upper_bound(all(*this),x);}

};
template<class T=ll,size_t n,size_t i=0>auto vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)return ve<T>(s[i],x);else{auto X=vec<T,n,i+1>(s,x);return ve<decltype(X)>(s[i],X);}}
template<ll n,class...A>vo setsize(const ll(&l)[n],A&...a){((a=vec(l,rawv(a))),...);}
template<class T>using vve=ve<ve<T>>;using vl=ve<ll>;using vvl=vve<ll>;
using gl=ve<ve<ll>>;using ge=ve<ve<edg>>;

struct io{io(){cin.tie(0)->sync_with_stdio(0);
  cout<<std::fixed<<std::setprecision(15);std::cerr<<nl;}}io;
os&operator<<(os&o,const ulll&x){return(x<10?o:o<<x/10)<<ll(x%10);}
os&operator<<(os&o,const lll&x){return o<<str(x<0,'-')<<ulll(zz(x));}
template<size_t n>os&operator<<(os&o,const bitset<n>&b){fo(i,n)o<<b[i];return o;}
template<class...A>os&operator<<(os&o,const tuple<A...>&t){
  apply([&](const auto&...a){ll i=0;(((o<<a<<str(++i!=sizeof...(a),sp))),...);},t);return o;}
template<class V>os&operator<<(os&o,const std::vector<V>&v){fe(v,e)o<<e<<str(&e!=&rb(v),isv<V>?nl:sp);return o;}
template<char c=sp,class...A>vo pp(const A&...a){ll i=0;((cout<<a<<str(++i!=sizeof...(a),c)),...);cout<<nl;}
template<class V>is&operator>>(is&i,std::vector<V>&v){fe(v,e)i>>e;return i;}
template<class...A>vo li(A&...a){(cin>>...>>a);}

ll inv(ll x,ll m){ll a=(x%m+m)%m,b=m,u=1,v=0;while(b)u-=a/b*v,swap(u,v),a-=a/b*b,swap(a,b);return(u%m+m)%m;}
template<class F>struct rec:F{rec(F&&f):F(std::forward<F>(f)){}template<class...A>decltype(auto)operator()(A&&...a)const{return F::operator()(*this,std::forward<A>(a)...);}};

template<class T>struct twelvefold{
  ve<T>fa,rfa,bs;
  vve<T>m;vve<int>u;
  twelvefold(ll n):fa(n+1,1),rfa(n+1,1),bs(n+1,1){
    fo(i,1,n+1)fa[i]=fa[i-1]*i;
    rfa[n]=fa[n].inv();
    of(i,n)rfa[i]=rfa[i+1]*(i+1);
    fo(i,1,n+1)bs[i]=bs[i-1]+pwm1(i)*rfa[i];
    if(n<=5000)m.resize(n+1,ve<int>(n+1)),u.resize(n+1,ve<int>(n+1));
  }
  T operator()(ll n,ll k){return c(n,k);}
  T c(ll n,ll k){return n<0?pwm1(k)*c(-n+k-1,k):k<0||n<k?0:fa[n]*rfa[k]*rfa[n-k];}
  T p(ll n,ll k){return c(n,k)*fa[k];}
  T h(ll n,ll r){return c(n-1+r,r);}
  T s(ll n,ll k){T r=0;fo(i,k+1)r+=pwm1(k-i)*c(k,i)*T(i).pow(n);return r*rfa[k];}
  T b(ll n,ll k){T r=0;fo(i,k+1)r+=T(i).pow(n)*rfa[i]*bs[k-i];return r;}
  T par(ll n,ll k){
    if(n==0&&k==0)return 1;
    if(k==0)return 0;
    if(u[n][k])return m[n][k];
    if(n-k>=0)return u[n][k]=1,m[n][k]=par(n,k-1)+par(n-k,k);
    return u[n][k]=1,m[n][k]=par(n,k-1);
  }
};using twf=twelvefold<ml>;

int main(){ll T=1;fo(T)solve();}
vo solve(){
  LL(X,Y,x,y);

  twf tw(X+Y);
  if(x){
    pp(tw(X,x)*tw(X-x+Y-1,X-x)*tw.fa[X-x]*tw.fa[Y]);
  }else{
    pp(tw(Y,y)*tw(Y-y+X-1,Y-y)*tw.fa[Y-y]*tw.fa[X]);
  }
}
0