結果

問題 No.797 Noelちゃんとピラミッド
ユーザー algon_320algon_320
提出日時 2019-03-15 21:38:21
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 365 ms / 2,000 ms
コード長 3,872 bytes
コンパイル時間 1,530 ms
コンパイル使用メモリ 168,032 KB
実行使用メモリ 34,360 KB
最終ジャッジ日時 2023-09-14 13:11:45
合計ジャッジ時間 26,898 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 350 ms
34,220 KB
testcase_01 AC 351 ms
34,168 KB
testcase_02 AC 352 ms
34,084 KB
testcase_03 AC 364 ms
34,188 KB
testcase_04 AC 364 ms
34,316 KB
testcase_05 AC 364 ms
34,220 KB
testcase_06 AC 364 ms
34,280 KB
testcase_07 AC 364 ms
34,332 KB
testcase_08 AC 364 ms
34,332 KB
testcase_09 AC 364 ms
34,304 KB
testcase_10 AC 363 ms
34,128 KB
testcase_11 AC 363 ms
34,204 KB
testcase_12 AC 364 ms
34,184 KB
testcase_13 AC 363 ms
34,072 KB
testcase_14 AC 363 ms
34,320 KB
testcase_15 AC 364 ms
34,128 KB
testcase_16 AC 364 ms
34,260 KB
testcase_17 AC 364 ms
34,288 KB
testcase_18 AC 362 ms
34,096 KB
testcase_19 AC 365 ms
34,272 KB
testcase_20 AC 364 ms
34,212 KB
testcase_21 AC 364 ms
34,288 KB
testcase_22 AC 364 ms
34,272 KB
testcase_23 AC 361 ms
34,276 KB
testcase_24 AC 355 ms
34,336 KB
testcase_25 AC 358 ms
34,264 KB
testcase_26 AC 358 ms
34,312 KB
testcase_27 AC 364 ms
34,204 KB
testcase_28 AC 361 ms
34,188 KB
testcase_29 AC 353 ms
34,164 KB
testcase_30 AC 353 ms
34,340 KB
testcase_31 AC 359 ms
34,188 KB
testcase_32 AC 354 ms
34,280 KB
testcase_33 AC 358 ms
34,280 KB
testcase_34 AC 357 ms
34,284 KB
testcase_35 AC 364 ms
34,340 KB
testcase_36 AC 352 ms
34,188 KB
testcase_37 AC 362 ms
34,072 KB
testcase_38 AC 363 ms
34,344 KB
testcase_39 AC 358 ms
34,268 KB
testcase_40 AC 352 ms
34,272 KB
testcase_41 AC 353 ms
34,332 KB
testcase_42 AC 357 ms
34,100 KB
testcase_43 AC 352 ms
34,172 KB
testcase_44 AC 352 ms
34,072 KB
testcase_45 AC 352 ms
34,124 KB
testcase_46 AC 351 ms
34,308 KB
testcase_47 AC 351 ms
34,196 KB
testcase_48 AC 350 ms
34,212 KB
testcase_49 AC 351 ms
34,268 KB
testcase_50 AC 352 ms
34,184 KB
testcase_51 AC 351 ms
34,208 KB
testcase_52 AC 350 ms
34,128 KB
testcase_53 AC 352 ms
34,280 KB
testcase_54 AC 350 ms
34,180 KB
testcase_55 AC 350 ms
34,164 KB
testcase_56 AC 351 ms
34,360 KB
testcase_57 AC 352 ms
34,080 KB
testcase_58 AC 351 ms
34,264 KB
testcase_59 AC 350 ms
34,264 KB
testcase_60 AC 350 ms
34,276 KB
testcase_61 AC 352 ms
34,168 KB
testcase_62 AC 351 ms
34,288 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &&x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define INSEG(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void PSUM(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(0); ios::sync_with_stdio(0);
        cout << setprecision(15) << fixed;
        // #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

template <int mod>
class ModInt {
public:
    ModInt() : v(0) {}
    ModInt(int x) : v((x+mod)%mod) {}
    int value() const {return v;}
    const ModInt operator+(const ModInt &r) const { return ModInt(this->v + r.v); }
    const ModInt operator-(const ModInt &r) const { return ModInt(this->v + mod - r.v); }
    const ModInt operator*(const ModInt &r) const { return ModInt(this->v * r.v); }
    const ModInt operator/(const ModInt &r) const { return (*this * (~r)); }
    const ModInt operator~() const { return ModInt(bpow(this->v, mod-2)); }
    bool operator==(const ModInt &r) const { return this->v == r.v; }
    bool operator!=(const ModInt &r) const { return this->v != r.v; }
    ModInt& operator+=(const ModInt &r) { return *this = *this + r; }
    ModInt& operator-=(const ModInt &r) { return *this = *this - r; }
    ModInt& operator*=(const ModInt &r) { return *this = *this * r; }
    ModInt& operator/=(const ModInt &r) { return *this = *this * (~r); }
private:
    int v;
    int bpow(int a, int b) const {
        int ret = 1;
        while (b > 0) {
            if (b & 1) ret = (ret * a) % mod;
            a = (a * a) % mod;
            b >>= 1;
        }
        return ret;
    }
};
using Mint = ModInt<1000000007>;

struct Factorial {
    static constexpr int MAX_N = 2000006;
    vector<Mint> fact, fact_inv;
    Factorial(size_t size = MAX_N) : fact(size), fact_inv(size) {
        fact[0] = fact_inv[0] = 1;
        for (int i = 1; i < MAX_N; ++i) {
            fact[i] = fact[i - 1] * i;
            fact_inv[i] = ~fact[i];
        }
    }
    Mint combination(int N, int R) {
        if (N < R) return 0;
        return fact[N] * fact_inv[N - R] * fact_inv[R];
    }
    static Mint bin_pow(Mint x, int p) {
        if (x.value() == 0) return x;
        Mint prod = 1;
        while (p > 0) {
            if (p & 1) prod *= x;
            x *= x;
            p >>= 1;
        }
        return prod;
    }
};
Factorial fact;

signed main() {
    int N;
    cin >> N;
    Mint ans = 0;
    REP(i, N) {
        int a;
        cin >> a;
        ans += Mint(a) * fact.combination(N - 1, i);
    }
    cout << ans.value() << endl;
    return (0^_^0);
}

0