結果
問題 | No.2754 Cumulate and Drop |
ユーザー |
👑 ![]() |
提出日時 | 2024-05-10 22:53:33 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 385 ms / 2,000 ms |
コード長 | 4,065 bytes |
コンパイル時間 | 5,333 ms |
コンパイル使用メモリ | 222,548 KB |
実行使用メモリ | 17,384 KB |
最終ジャッジ日時 | 2024-12-20 06:56:16 |
合計ジャッジ時間 | 13,593 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <algorithm>#include <atcoder/all>#include <bitset>#include <cassert>#include <cmath>#include <ctime>#include <functional>#include <iomanip>#include <iostream>#include <map>#include <queue>#include <random>#include <set>#include <stack>#include <string>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>using namespace std;using namespace atcoder;typedef long long ll;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)#define repk(i, k, n) for (int i = k; i < (int)(n); i++)#define all(v) v.begin(), v.end()#define mod1 1000000007#define mod2 998244353#define mod3 100000007#define vi vector<int>#define vs vector<string>#define vc vector<char>#define vl vector<ll>#define vb vector<bool>#define vvi vector<vector<int>>#define vvc vector<vector<char>>#define vvl vector<vector<ll>>#define vvb vector<vector<bool>>#define vvvi vector<vector<vector<int>>>#define vvvl vector<vector<vector<ll>>>#define pii pair<int, int>#define pil pair<int, ll>#define pli pair<ll, int>#define pll pair<ll, ll>#define vpii vector<pair<int, int>>#define vpll vector<pair<ll, ll>>#define vvpii vector<vector<pair<int, int>>>#define vvpll vector<vector<pair<ll, ll>>>using mint = modint998244353;template <typename T>void debug(T e) {cerr << e << endl;}template <typename T>void debug(vector<T> &v) {rep(i, v.size()) { cerr << v[i] << " "; }cerr << endl;}template <typename T>void debug(vector<vector<T>> &v) {rep(i, v.size()) {rep(j, v[i].size()) { cerr << v[i][j] << " "; }cerr << endl;}}template <typename T>void debug(vector<pair<T, T>> &v) {rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }}template <typename T>void debug(set<T> &st) {for (auto itr = st.begin(); itr != st.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(multiset<T> &ms) {for (auto itr = ms.begin(); itr != ms.end(); itr++) {cerr << *itr << " ";}cerr << endl;}template <typename T>void debug(map<T, T> &mp) {for (auto itr = mp.begin(); itr != mp.end(); itr++) {cerr << itr->first << " " << itr->second << endl;}}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << H << " ";debug_out(T...);}ll my_pow(ll x, ll n, ll mod) {// 繰り返し二乗法.x^nをmodで割った余り.ll ret;if (n == 0) {ret = 1;} else if (n % 2 == 1) {ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;} else {ret = my_pow((x * x) % mod, n / 2, mod);}return ret;}ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }int main() {ll N;cin >> N;vector<ll> A(N);for (ll i = 0; i < N; i++) {cin >> A[i];}vector<ll> fact(400004);vector<ll> fact_inv(400004);fact[0] = 1;for (ll i = 0; i < 400003; i++) {fact[i + 1] = (fact[i] * (i + 1)) % mod2;}for (ll i = 0; i < 400004; i++) {fact_inv[i] = inv(fact[i], mod2);}auto comb = [fact, fact_inv](ll n, ll r) {ll ret;if (n < r) {ret = 0;} else if (r < 0) {ret = 0;} else {ret = (fact[n] * ((fact_inv[n - r] * fact_inv[r]) % mod2)) % mod2;}return ret;};ll ans = 0;for (ll i = 0; i < N; i++) {// i から N - 1 まで行く経路で、i + 1 を通らないものの個数ll coef = comb((N - 1) + (N - 1 - i), (N - 1 - i));ll coef2 = comb((N - 1) + (N - 1 - i), (N - 1 - (i + 1)));// debug_out(coef, coef2);ll coef_last = (coef - coef2 + mod2) % mod2;ans = (ans + (coef_last * A[i]) % mod2) % mod2;}cout << ans << endl;}