結果

問題 No.93 ペガサス
ユーザー sigma425
提出日時 2017-09-15 05:08:40
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 59 ms / 5,000 ms
コード長 2,835 bytes
コンパイル時間 2,058 ms
コンパイル使用メモリ 167,288 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 22:26:56
合計ジャッジ時間 2,982 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
template<unsigned int mod_>
struct ModInt{
    using uint = unsigned int;
    using ll = long long;
    using ull = unsigned long long;
    constexpr static uint mod = mod_;
    uint v;
    ModInt():v(0){}
    ModInt(ll v):v(normS(v%mod+mod)){}
    explicit operator bool() const {return v!=0;}
    static uint normS(const uint &x){return (x<mod)?x:x-mod;}       // [0 , 2*mod-1] -> [0 , mod-1]
    static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
    ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
    ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
    ModInt operator-() const { return make(normS(mod-v)); }
    ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
    ModInt operator/(const ModInt& b) const { return *this*b.inv();}
    ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
    ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
    ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
    ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
    ll extgcd(ll a,ll b,ll &x,ll &y) const{
        ll u[]={a,1,0},v[]={b,0,1};
        while(*v){
            ll t=*u/ *v;
            rep(i,3) swap(u[i]-=t*v[i],v[i]);
        }
        if(u[0]<0) rep(i,3) u[i]=-u[i];
        x=u[1],y=u[2];
        return u[0];
    }
    ModInt inv() const{
        ll x,y;
        extgcd(v,mod,x,y);
        return make(normS(x+mod));
    }
    bool operator==(const ModInt& b) const { return v==b.v;}
    bool operator!=(const ModInt& b) const { return v!=b.v;}
    friend istream& operator>>(istream &o,ModInt& x){
        ll tmp;
        o>>tmp;
        x=ModInt(tmp);
        return o;
    }
    friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<1000000007>;
int main(){
    int N;
    cin>>N;
    if(N==1){
        puts("1");
        return 0;
    }
    vector<vector<mint>> dp(N+1,vector<mint>(2));
    dp[0][0] = 1;
    rep(qi,2){
        rep(i,(N-1-qi)/2+1){
            vector<vector<mint>> ndp(N+1,vector<mint>(2));
            rep(k,N) rep(t,2) if(dp[k][t]){
                {   // x
                    int nk = k;
                    int nt = 1;
                    ndp[nk][nt] -= dp[k][t];
                }
                {
                    int nk = k+1;
                    int nt = 0;
                    mint coef = (mint)nk * (t+1);
                    ndp[nk][nt] += dp[k][t] * coef;
                }
            }
            dp = ndp;
        }
        if(qi == 0){
            rep(k,N+1){
                dp[k][1] = 0;
            }
        }
    }
    mint res = 0;
    rep(k,N+1) res += dp[k][0];
    cout<<res<<endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0