結果
問題 | No.2506 Sum of Weighted Powers |
ユーザー |
![]() |
提出日時 | 2023-10-13 21:33:50 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 317 ms / 2,000 ms |
コード長 | 3,063 bytes |
コンパイル時間 | 4,898 ms |
コンパイル使用メモリ | 293,980 KB |
実行使用メモリ | 10,528 KB |
最終ジャッジ日時 | 2024-09-15 17:10:29 |
合計ジャッジ時間 | 8,756 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 42 |
ソースコード
#if __INCLUDE_LEVEL__ == 0#include __BASE_FILE__namespace {using Fp = atcoder::static_modint<943718401>;void solve() {int n;Fp x;scan(n, x);vector<Fp> a(n + 1);scan(a);vector<Fp> b(n + 1);scan(b);vector<Fp> c(n + 1);scan(c);if (x == 0) {Fp ans = a[0] * b[0] * c[0];for (int i : rep1(n)) {ans += a[i] * b[0] * c[i];ans += a[i] * b[i] * c[0];}print(ans);return;}for (int64_t i : rep(n + 1)) {auto t = i * (i - 1) * (i - 2) / 3 + i * i;a[i] *= x.pow(t);b[i] *= x.inv().pow(t);c[i] *= x.inv().pow(t);}b = atcoder::convolution(b, c);Fp ans = 0;for (int i : rep(n + 1)) {ans += a[i] * b[i];}print(ans);}} // namespaceint main() {ios::sync_with_stdio(false);cin.tie(nullptr);solve();}#else // __INCLUDE_LEVEL__#include <bits/stdc++.h>using namespace std;#include <atcoder/convolution>namespace std {template <class T1, class T2>istream& operator>>(istream& is, pair<T1, T2>& p) {return is >> p.first >> p.second;}template <class... Ts>istream& operator>>(istream& is, tuple<Ts...>& t) {return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);}template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {for (auto&& e : r) {is >> e;}return is;}template <class T1, class T2>ostream& operator<<(ostream& os, const pair<T1, T2>& p) {return os << p.first << ' ' << p.second;}template <class... Ts>ostream& operator<<(ostream& os, const tuple<Ts...>& t) {auto f = [&os](const auto&... xs) -> ostream& {[[maybe_unused]] auto sep = "";((os << exchange(sep, " ") << xs), ...);return os;};return apply(f, t);}template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {auto sep = "";for (auto&& e : r) {os << exchange(sep, " ") << e;}return os;}} // namespace stdnamespace atcoder {template <class T, internal::is_modint_t<T>* = nullptr>istream& operator>>(istream& is, T& x) {int v;is >> v;x = T::raw(v);return is;}template <class T, internal::is_modint_t<T>* = nullptr>ostream& operator<<(ostream& os, const T& x) {return os << x.val();}} // namespace atcodertemplate <class... Ts>void scan(Ts&&... xs) {(cin >> ... >> xs);}template <class... Ts>void print(Ts&&... xs) {cout << tie(xs...) << '\n';}inline auto rep(int l, int r) { return views::iota(min(l, r), r); }inline auto rep(int n) { return rep(0, n); }inline auto rep1(int l, int r) { return rep(l, r + 1); }inline auto rep1(int n) { return rep(1, n + 1); }inline auto per(int l, int r) { return rep(l, r) | views::reverse; }inline auto per(int n) { return per(0, n); }inline auto per1(int l, int r) { return per(l, r + 1); }inline auto per1(int n) { return per(1, n + 1); }inline auto len = ranges::ssize;#endif // __INCLUDE_LEVEL__