結果
問題 | No.2734 Addition and Multiplication in yukicoder (Hard) |
ユーザー |
|
提出日時 | 2024-04-19 22:31:56 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 147 ms / 5,000 ms |
コード長 | 9,273 bytes |
コンパイル時間 | 2,926 ms |
コンパイル使用メモリ | 233,804 KB |
最終ジャッジ日時 | 2025-02-21 04:43:36 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#pragma clang diagnostic push#pragma ide diagnostic ignored "cppcoreguidelines-narrowing-conversions"#pragma ide diagnostic ignored "hicpp-signed-bitwise"#pragma GCC optimize ("Ofast,unroll-loops")#pragma GCC optimize("no-stack-protector,fast-math")#include <bits/stdc++.h>using namespace std;typedef long long ll;typedef pair<ll, ll> pll;typedef pair<int, int> pii;typedef pair<double, double> pdd;typedef vector<int> vi;typedef vector<ll> vll;typedef vector<double> vd;typedef vector<string> vs;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vll> vvll;typedef vector<vvll> vvvll;typedef vector<pii> vpii;typedef vector<vpii> vvpii;typedef vector<pll> vpll;typedef vector<vpll> vvpll;typedef vector<pdd> vpdd;typedef vector<vd> vvd;#define yn(ans) printf("%s\n", (ans)?"Yes":"No");#define YN(ans) printf("%s\n", (ans)?"YES":"NO");template<class T> bool chmax(T &a, T b) {if (a >= b) return false;a = b; return true;}template<class T> bool chmin(T &a, T b) {if (a <= b) return false;a = b; return true;}#define FOR(i, s, e, t) for ((i) = (s); (i) < (e); (i) += (t))#define REP(i, e) for (int i = 0; i < (e); ++i)#define REP1(i, s, e) for (int i = (s); i < (e); ++i)#define RREP(i, e) for (int i = (e); i >= 0; --i)#define RREP1(i, e, s) for (int i = (e); i >= (s); --i)#define all(v) v.begin(), v.end()#define pb push_back#define qb pop_back#define pf push_front#define qf pop_front#define maxe max_element#define mine min_elementll inf = 1e18;#define DEBUG printf("%d\n", __LINE__); fflush(stdout);template<class T> void print(vector<T> &v, bool withSize = false) {if (withSize) cout << v.size() << endl;REP(i, v.size()) cout << v[i] << " ";cout << endl;}mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());int __FAST_IO__ = []() {std::ios::sync_with_stdio(0);std::cin.tie(0);std::cout.tie(0);return 0;}();// Mint & Combinatoricstemplate <typename T>T inverse(T a, T m) {T u = 0, v = 1;while (a != 0) {T t = m / a;m -= t * a; swap(a, m);u -= t * v; swap(u, v);}return u;}template <typename T>class Modular {public:using Type = typename decay<decltype(T::value)>::type;constexpr Modular() : value() {}template <typename U>Modular(const U& x) {value = normalize(x);}template <typename U>static Type normalize(const U& x) {Type v;if (-mod() <= x && x < mod()) v = static_cast<Type>(x);else v = static_cast<Type>(x % mod());if (v < 0) v += mod();return v;}const Type& operator()() const { return value; }template <typename U>explicit operator U() const { return static_cast<U>(value); }constexpr static Type mod() { return T::value; }Modular& operator+=(const Modular& other) { if ((value += other.value) >= mod()) value -= mod(); return *this; }Modular& operator-=(const Modular& other) { if ((value -= other.value) < 0) value += mod(); return *this; }template <typename U> Modular& operator+=(const U& other) { return *this += Modular(other); }template <typename U> Modular& operator-=(const U& other) { return *this -= Modular(other); }Modular& operator++() { return *this += 1; }Modular& operator--() { return *this -= 1; }Modular operator++(int) { Modular result(*this); *this += 1; return result; }Modular operator--(int) { Modular result(*this); *this -= 1; return result; }Modular operator-() const { return Modular(-value); }template <typename U = T>typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type& operator*=(const Modular& rhs) {#ifdef _WIN32uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;asm("divl %4; \n\t": "=a" (d), "=d" (m): "d" (xh), "a" (xl), "r" (mod()));value = m;#elsevalue = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));#endifreturn *this;}template <typename U = T>typename enable_if<is_same<typename Modular<U>::Type, long long>::value, Modular>::type& operator*=(const Modular& rhs) {long long q = static_cast<long long>(static_cast<long double>(value) * rhs.value / mod());value = normalize(value * rhs.value - q * mod());return *this;}template <typename U = T>typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type& operator*=(const Modular& rhs) {value = normalize(value * rhs.value);return *this;}Modular& operator/=(const Modular& other) { return *this *= Modular(inverse(other.value, mod())); }friend const Type& abs(const Modular& x) { return x.value; }template <typename U>friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);template <typename U>friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);template <typename V, typename U>friend V& operator>>(V& stream, Modular<U>& number);private:Type value;};template <typename T> bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value == rhs.value; }template <typename T, typename U> bool operator==(const Modular<T>& lhs, U rhs) { return lhs == Modular<T>(rhs); }template <typename T, typename U> bool operator==(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) == rhs; }template <typename T> bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) { return !(lhs == rhs); }template <typename T, typename U> bool operator!=(const Modular<T>& lhs, U rhs) { return !(lhs == rhs); }template <typename T, typename U> bool operator!=(U lhs, const Modular<T>& rhs) { return !(lhs == rhs); }template <typename T> bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) { return lhs.value < rhs.value; }template <typename T> Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }template <typename T, typename U> Modular<T> operator+(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) += rhs; }template <typename T, typename U> Modular<T> operator+(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) += rhs; }template <typename T> Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }template <typename T, typename U> Modular<T> operator-(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) -= rhs; }template <typename T, typename U> Modular<T> operator-(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) -= rhs; }template <typename T> Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }template <typename T, typename U> Modular<T> operator*(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) *= rhs; }template <typename T, typename U> Modular<T> operator*(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) *= rhs; }template <typename T> Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }template <typename T, typename U> Modular<T> operator/(const Modular<T>& lhs, U rhs) { return Modular<T>(lhs) /= rhs; }template <typename T, typename U> Modular<T> operator/(U lhs, const Modular<T>& rhs) { return Modular<T>(lhs) /= rhs; }template<typename T, typename U>Modular<T> power(const Modular<T>& a, const U& b) {assert(b >= 0);Modular<T> x = a, res = 1;U p = b;while (p > 0) {if (p & 1) res *= x;x *= x;p >>= 1;}return res;}template <typename T>bool IsZero(const Modular<T>& number) {return number() == 0;}template <typename T>string to_string(const Modular<T>& number) {return to_string(number());}// U == std::ostream? but done this way because of fastoutputtemplate <typename U, typename T>U& operator<<(U& stream, const Modular<T>& number) {return stream << number();}// U == std::istream? but done this way because of fastinputtemplate <typename U, typename T>U& operator>>(U& stream, Modular<T>& number) {typename common_type<typename Modular<T>::Type, long long>::type x;stream >> x;number.value = Modular<T>::normalize(x);return stream;}struct MOD {static int value;};int MOD::value = 998244353;using Mint = Modular<MOD>;typedef vector<Mint> vm;typedef vector<vm> vvm;typedef vector<vvm> vvvm;vector<vector<int>> readGraph(int N, int M, bool isDirected = false) {vector<vector<int>> g(N);REP(i, M) {int u, v;cin >> u >> v;--u, --v;g[u].push_back(v);if (!isDirected) g[v].push_back(u);}return g;}#define TESTS int t; cin >> t; while (t--)#define TESTint main() {TEST {int N;cin >> N;vll v(N), c(N);vector<__int128_t> p(20, 1);REP(i, N) cin >> v[i], c[i] = to_string(v[i]).size();REP1(i, 1, 20) p[i] = p[i - 1] * 10;vi q(N);REP(i, N) q[i] = i;sort(all(q), [&](int x, int y) {__int128_t l = v[x] * p[c[y]] + v[y], r = v[x] + v[y] * p[c[x]];return l < r;});ll ans = 0, MOD = 998244353;REP(i, N) {ans = (ans * p[c[q[i]]] % MOD + v[q[i]]) % MOD;}printf("%lld\n", ans);}return 0;}