結果
問題 | No.1546 [Cherry 2nd Tune D] 思ったよりも易しくない |
ユーザー |
![]() |
提出日時 | 2021-06-11 22:39:03 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 139 ms / 2,000 ms |
コード長 | 7,860 bytes |
コンパイル時間 | 2,118 ms |
コンパイル使用メモリ | 199,060 KB |
最終ジャッジ日時 | 2025-01-22 06:21:15 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 53 |
ソースコード
#include <bits/stdc++.h>#define FASTIOusing namespace std;using ll = long long;using Vi = std::vector<int>;using Vl = std::vector<ll>;using Pii = std::pair<int, int>;using Pll = std::pair<ll, ll>;constexpr int I_INF = std::numeric_limits<int>::max();constexpr ll L_INF = std::numeric_limits<ll>::max();template <typename T1, typename T2>inline bool chmin(T1& a, const T2& b) {if (a > b) {a = b;return true;}return false;}template <typename T1, typename T2>inline bool chmax(T1& a, const T2& b) {if (a < b) {a = b;return true;}return false;}template <std::ostream& os = std::cout>class Prints {private:class __Prints {public:__Prints(const char* sep, const char* term) : sep(sep), term(term) {}template <class... Args>#if __cplusplus >= 201703Lauto operator()(const Args&... args) const -> decltype((os << ... << std::declval<Args>()), void()) {#elsevoid operator()(const Args&... args) const {#endifprint(args...);}template <typename T>#if __cplusplus >= 201703Lauto pvec(const T& vec, size_t sz) const -> decltype(os << std::declval<decltype(std::declval<T>()[0])>(), void()) {#elsevoid pvec(const T& vec, size_t sz) const {#endiffor (size_t i = 0; i < sz; i++)os << vec[i] << (i == sz - 1 ? term : sep);}template <typename T>#if __cplusplus >= 201703Lauto pmat(const T& mat, size_t h, size_t w) const -> decltype(os << std::declval<decltype(std::declval<T>()[0][0])>(), void()) {#elsevoid pmat(const T& mat, size_t h, size_t w) const {#endiffor (size_t i = 0; i < h; i++)for (size_t j = 0; j < w; j++)os << mat[i][j] << (j == w - 1 ? term : sep);}private:const char *sep, *term;void print() const { os << term; }void print_rest() const { os << term; }template <class T, class... Tail>void print(const T& head, const Tail&... tail) const { os << head, print_rest(tail...); }template <class T, class... Tail>void print_rest(const T& head, const Tail&... tail) const { os << sep << head, print_rest(tail...); }};public:Prints() {}__Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }};Prints<> prints;Prints<std::cerr> prints_err;//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%template <std::int_fast64_t Modulus>class ModInt {using i64 = std::int_fast64_t;private:i64 m_value;public:constexpr ModInt(const i64 x = 0) noexcept : m_value(x) {if (m_value < -Modulus || m_value >= Modulus) m_value %= Modulus;if (m_value < 0) m_value += Modulus;}constexpr i64 const& value() const noexcept { return m_value; }constexpr ModInt& operator+=(const ModInt rhs) noexcept {m_value += rhs.m_value;if (m_value >= Modulus) {m_value -= Modulus;}return *this;}constexpr ModInt& operator-=(const ModInt rhs) noexcept {if (m_value < rhs.m_value) {m_value += Modulus;}m_value -= rhs.m_value;return *this;}constexpr ModInt& operator*=(const ModInt rhs) noexcept {m_value *= rhs.m_value;if (m_value >= Modulus) m_value %= Modulus;return *this;}constexpr ModInt& operator/=(ModInt rhs) noexcept {*this *= rhs.inv();return *this;}constexpr ModInt& operator++() noexcept {*this += 1;return *this;}constexpr ModInt operator++(int) noexcept {ModInt res = *this;*this += 1;return res;}constexpr ModInt& operator--() noexcept {*this -= 1;return *this;}constexpr ModInt operator--(int) noexcept {ModInt res = *this;*this -= 1;return res;}constexpr ModInt inv() const noexcept {i64 q = m_value;i64 b = Modulus, u = 1, v = 0;i64 tmp = 0;while (b) {i64 t = q / b;q -= t * b;tmp = q, q = b, b = tmp;u -= t * v;tmp = u, u = v, v = tmp;}if (u < -Modulus || u >= Modulus) u %= Modulus;if (u < 0) u += Modulus;return u;}constexpr ModInt pow(i64 k) const noexcept {ModInt res = 1;ModInt tmp = 0;if (k < 0) {tmp = this->inv();k = -k;} else {tmp = *this;}for (; k > 0; k >>= 1) {if (k & 1) res *= tmp;tmp *= tmp;}return res;}friend constexpr ModInt operator+(const ModInt& a) noexcept {return a;}friend constexpr ModInt operator-(const ModInt& a) noexcept {return ModInt(0) - a;}friend constexpr ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept {return ModInt<Modulus>(lhs) += rhs;}friend constexpr ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept {return ModInt<Modulus>(lhs) -= rhs;}friend constexpr ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept {return ModInt<Modulus>(lhs) *= rhs;}friend constexpr ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept {return ModInt<Modulus>(lhs) /= rhs;}friend constexpr bool operator<(const ModInt& lhs, const ModInt& rhs) noexcept {return lhs.m_value < rhs.m_value;}friend constexpr bool operator>(const ModInt& lhs, const ModInt& rhs) noexcept {return lhs.m_value > rhs.m_value;}friend constexpr bool operator<=(const ModInt& lhs, const ModInt& rhs) noexcept {return lhs.m_value <= rhs.m_value;}friend constexpr bool operator>=(const ModInt& lhs, const ModInt& rhs) noexcept {return lhs.m_value >= rhs.m_value;}friend constexpr bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept {return lhs.m_value == rhs.m_value;}friend constexpr bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept {return lhs.m_value != rhs.m_value;}friend std::istream& operator>>(std::istream& is, ModInt& rhs) {i64 a;is >> a;rhs = a;return is;}friend std::ostream& operator<<(std::ostream& os, const ModInt& rhs) {os << rhs.m_value;return os;}};constexpr long long MOD = 998244353;using Mint = ModInt<MOD>;void solve() {ll N;cin >> N;vector<Mint> T(N), V(N);for (ll i = 0; i < N; i++) {cin >> T[i] >> V[i];}vector<Mint> cum(N + 1);for (ll i = 0; i < N; i++) {cum[i + 1] = cum[i] + T[i];}Mint K = cum[N];Mint ans = 0;for (ll i = 0; i < N; i++) {Mint t = T[i];Mint s = cum[i];Mint a = t * (4 * K * (3 * s * s + 3 * s * (t + 2) + t * t + 3 * t + 2) - 3 * (4 * s * s * s + 6 * s * s * (t + 1) + s * (4 * t * t + 6 * t -2) + t * t * t + 2 * t * t - t - 2));ans += V[i] * a * Mint(24).inv();}prints()(ans);}//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%int main() {#ifdef FASTIOstd::cin.tie(nullptr), std::cout.tie(nullptr);std::ios::sync_with_stdio(false);#endif#ifdef FILEINPUTstd::ifstream ifs("./in_out/input.txt");std::cin.rdbuf(ifs.rdbuf());#endif#ifdef FILEOUTPUTstd::ofstream ofs("./in_out/output.txt");std::cout.rdbuf(ofs.rdbuf());#endifstd::cout << std::setprecision(18) << std::fixed;solve();std::cout << std::flush;return 0;}