結果
問題 | No.797 Noelちゃんとピラミッド |
ユーザー | paruki |
提出日時 | 2019-03-15 21:48:38 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 80 ms / 2,000 ms |
コード長 | 3,141 bytes |
コンパイル時間 | 1,511 ms |
コンパイル使用メモリ | 168,352 KB |
実行使用メモリ | 5,180 KB |
最終ジャッジ日時 | 2023-09-14 13:25:14 |
合計ジャッジ時間 | 8,687 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 67 ms
5,072 KB |
testcase_01 | AC | 67 ms
4,880 KB |
testcase_02 | AC | 66 ms
4,960 KB |
testcase_03 | AC | 79 ms
4,872 KB |
testcase_04 | AC | 77 ms
5,040 KB |
testcase_05 | AC | 78 ms
5,064 KB |
testcase_06 | AC | 79 ms
4,944 KB |
testcase_07 | AC | 79 ms
4,872 KB |
testcase_08 | AC | 78 ms
4,976 KB |
testcase_09 | AC | 78 ms
4,876 KB |
testcase_10 | AC | 78 ms
5,000 KB |
testcase_11 | AC | 79 ms
5,072 KB |
testcase_12 | AC | 78 ms
5,180 KB |
testcase_13 | AC | 79 ms
4,968 KB |
testcase_14 | AC | 78 ms
4,940 KB |
testcase_15 | AC | 79 ms
4,844 KB |
testcase_16 | AC | 80 ms
5,040 KB |
testcase_17 | AC | 79 ms
4,936 KB |
testcase_18 | AC | 79 ms
4,920 KB |
testcase_19 | AC | 79 ms
5,160 KB |
testcase_20 | AC | 79 ms
4,972 KB |
testcase_21 | AC | 78 ms
4,972 KB |
testcase_22 | AC | 79 ms
4,976 KB |
testcase_23 | AC | 76 ms
4,868 KB |
testcase_24 | AC | 69 ms
4,964 KB |
testcase_25 | AC | 74 ms
4,872 KB |
testcase_26 | AC | 73 ms
4,840 KB |
testcase_27 | AC | 79 ms
4,940 KB |
testcase_28 | AC | 78 ms
5,156 KB |
testcase_29 | AC | 69 ms
4,988 KB |
testcase_30 | AC | 69 ms
5,020 KB |
testcase_31 | AC | 76 ms
5,164 KB |
testcase_32 | AC | 71 ms
5,024 KB |
testcase_33 | AC | 75 ms
5,136 KB |
testcase_34 | AC | 73 ms
4,864 KB |
testcase_35 | AC | 80 ms
4,936 KB |
testcase_36 | AC | 69 ms
4,984 KB |
testcase_37 | AC | 77 ms
4,920 KB |
testcase_38 | AC | 77 ms
4,900 KB |
testcase_39 | AC | 74 ms
4,972 KB |
testcase_40 | AC | 68 ms
5,104 KB |
testcase_41 | AC | 69 ms
4,956 KB |
testcase_42 | AC | 73 ms
4,868 KB |
testcase_43 | AC | 68 ms
4,888 KB |
testcase_44 | AC | 67 ms
4,964 KB |
testcase_45 | AC | 67 ms
4,896 KB |
testcase_46 | AC | 68 ms
4,992 KB |
testcase_47 | AC | 67 ms
4,956 KB |
testcase_48 | AC | 68 ms
4,876 KB |
testcase_49 | AC | 67 ms
5,160 KB |
testcase_50 | AC | 68 ms
4,876 KB |
testcase_51 | AC | 67 ms
4,972 KB |
testcase_52 | AC | 68 ms
4,936 KB |
testcase_53 | AC | 67 ms
4,976 KB |
testcase_54 | AC | 67 ms
5,040 KB |
testcase_55 | AC | 68 ms
5,052 KB |
testcase_56 | AC | 67 ms
5,072 KB |
testcase_57 | AC | 68 ms
4,868 KB |
testcase_58 | AC | 67 ms
4,840 KB |
testcase_59 | AC | 68 ms
5,164 KB |
testcase_60 | AC | 67 ms
4,872 KB |
testcase_61 | AC | 68 ms
4,976 KB |
testcase_62 | AC | 67 ms
4,904 KB |
ソースコード
#define _USE_MATH_DEFINES #include "bits/stdc++.h" using namespace std; #define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i)) #define rep(i,j) FOR(i,0,j) #define each(x,y) for(auto &(x):(y)) #define mp make_pair #define MT make_tuple #define all(x) (x).begin(),(x).end() #define debug(x) cout<<#x<<": "<<(x)<<endl #define smax(x,y) (x)=max((x),(y)) #define smin(x,y) (x)=min((x),(y)) #define MEM(x,y) memset((x),(y),sizeof (x)) #define sz(x) (int)(x).size() #define RT return using ll = long long; using pii = pair<int, int>; using vi = vector<int>; using vll = vector<ll>; template<int MOD> class ModInt { public: ModInt() :value(0) {} ModInt(long long val) :value((int)(val<0 ? MOD + val%MOD : val%MOD)) { } ModInt& operator+=(ModInt that) { value = value + that.value; if (value >= MOD)value -= MOD; return *this; } ModInt& operator-=(ModInt that) { value -= that.value; if (value<0)value += MOD; return *this; } ModInt& operator*=(ModInt that) { value = (int)((long long)value * that.value % MOD); return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt pow(long long k) const { ModInt n = *this, res = 1; while (k) { if (k & 1)res *= n; n *= n; k >>= 1; } return res; } ModInt inverse() const { long long a = value, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } return ModInt(u); } int toi() const { return value; } private: int value; }; typedef ModInt<1000000007> mint; ostream& operator<<(ostream& os, const mint& x) { os << x.toi(); return os; } namespace comb { const int N = 200000; mint fact[N]; mint rev[N]; void init() { fact[0] = 1; for (int i = 1; i < N; ++i)fact[i] = fact[i - 1] * i; for (int i = 0; i < N; ++i)rev[i] = fact[i].inverse(); } mint C(int n, int r) { if (n < r)return 0; return fact[n] * rev[r] * rev[n - r]; } mint H(int n, int r) { return C(n + r - 1, r); } mint P(int n, int r) { assert(n >= r); return fact[n] * rev[n - r]; } mint catalan(int n) { return fact[2 * n] * rev[n + 1] * rev[n]; } } void solve() { comb::init(); int N; cin >> N; vi A(N); rep(i, N)cin >> A[i]; mint ans; rep(i, N) { ans += comb::C(N - 1, i) * A[i]; } cout << ans << endl; } int main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(15); solve(); return 0; }