結果

問題 No.995 タピオカオイシクナーレ
ユーザー rniyarniya
提出日時 2020-03-06 21:11:36
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 3,787 bytes
コンパイル時間 1,871 ms
コンパイル使用メモリ 169,920 KB
実行使用メモリ 15,652 KB
最終ジャッジ日時 2023-08-04 06:29:55
合計ジャッジ時間 4,199 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
14,712 KB
testcase_01 AC 7 ms
14,640 KB
testcase_02 AC 7 ms
14,724 KB
testcase_03 AC 7 ms
14,724 KB
testcase_04 AC 8 ms
14,648 KB
testcase_05 AC 7 ms
14,584 KB
testcase_06 AC 7 ms
14,588 KB
testcase_07 AC 8 ms
14,816 KB
testcase_08 AC 7 ms
14,460 KB
testcase_09 AC 8 ms
14,580 KB
testcase_10 AC 8 ms
14,664 KB
testcase_11 AC 7 ms
14,468 KB
testcase_12 AC 8 ms
14,480 KB
testcase_13 AC 8 ms
14,472 KB
testcase_14 AC 8 ms
14,588 KB
testcase_15 AC 8 ms
14,476 KB
testcase_16 AC 52 ms
15,580 KB
testcase_17 AC 54 ms
15,616 KB
testcase_18 AC 53 ms
15,652 KB
testcase_19 AC 52 ms
15,560 KB
testcase_20 AC 53 ms
15,536 KB
testcase_21 AC 52 ms
15,456 KB
testcase_22 AC 52 ms
15,560 KB
testcase_23 AC 53 ms
15,512 KB
testcase_24 AC 54 ms
15,420 KB
testcase_25 AC 51 ms
15,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
const long long MOD=1e9+7;

template<uint_fast64_t Modulus> class modint{
    using u64=uint_fast64_t;
    public:
    u64 a;
    constexpr modint(const u64 x=0) noexcept:a(((x%Modulus)+Modulus)%Modulus){}
    constexpr u64 &value() noexcept{return a;}
    constexpr const u64 &value() const noexcept{return a;}
    constexpr modint &operator+=(const modint &rhs) noexcept{
        a+=rhs.a;
        if (a>=Modulus) a-=Modulus;
        return *this;
    }
    constexpr modint operator+(const modint &rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint &operator++() noexcept{
        return ++a,*this;
    }
    constexpr modint operator++(int) noexcept{
        modint t=*this; return ++a,t;
    }
    constexpr modint &operator-=(const modint &rhs) noexcept{
        if (a<rhs.a) a+=Modulus;
        a-=rhs.a;
        return *this;
    }
    constexpr modint operator-(const modint &rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint &operator--() noexcept{
        return --a,*this;
    }
    constexpr modint operator--(int) noexcept{
        modint t=*this; return --a,t;
    }
    constexpr modint &operator*=(const modint &rhs) noexcept{
        a=a*rhs.a%Modulus;
        return *this;
    }
    constexpr modint operator*(const modint &rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        u64 exp=Modulus-2;
        while(exp){
            if (exp&1) *this*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return *this;
    }
    constexpr modint operator/(const modint &rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint operator-() const noexcept{
        return modint(Modulus-a);
    }
    constexpr bool operator==(const modint &rhs) const noexcept{
        return a==rhs.a;
    }
    constexpr bool operator!=(const modint &rhs) const noexcept{
        return a!=rhs.a;
    }
    constexpr bool operator!() const noexcept{return !a;}
    friend constexpr modint pow(modint rhs,long long exp) noexcept{
        modint res{1};
        while(exp){
            if (exp&1) res*=rhs;
            rhs*=rhs; exp>>=1;
        }
        return res;
    }
    template<class T> friend constexpr modint operator+(T x,modint y) noexcept{
        return modint(x)+y;
    }
    template<class T> friend constexpr modint operator-(T x,modint y) noexcept{
        return modint(x)-y;
    }
    template<class T> friend constexpr modint operator*(T x,modint y) noexcept{
        return modint(x)*y;
    }
    template<class T> friend constexpr modint operator/(T x,modint y) noexcept{
        return modint(x)/y;
    }
    friend ostream &operator<<(ostream &s,const modint &rhs) noexcept {
        return s << rhs.a;
    }
    friend istream &operator>>(istream &s,modint &rhs) noexcept {
        u64 a; rhs=modint{(s >> a,a)}; return s;
    }
};

using mint=modint<MOD>;

const int MAX=5e5+10;
vector<mint> fac(MAX),finv(MAX),inv(MAX);
void COMinit(){
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    for (int i=2;i<MAX;++i){
        fac[i]=fac[i-1]*i;
        inv[i]=-inv[MOD%i]*(MOD/i);
        finv[i]=finv[i-1]*inv[i];
    }
}
mint COM(int n,int k){
    if (n<k||n<0||k<0) return 0;
    return fac[n]*finv[k]*finv[n-k];
}

//Be careful with the value of MAX and conducting COMinit()

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,M; long long K; mint p,q;
    cin >> N >> M >> K >> p >> q;
    vector<long long> b(N);
    for (int i=0;i<N;++i) cin >> b[i];
    mint ans=0;
    for (int i=0;i<N;++i){
        if (i<M) ans+=b[i]*(1+pow(1-2*p/q,K))/2;
        else ans+=b[i]*(1-pow(1-2*p/q,K))/2;
    }
    cout << ans << '\n';
}
0