結果
問題 | No.2653 [Cherry 6th Tune] Re: start! (Make it Zero!) |
ユーザー | Misuki |
提出日時 | 2024-02-23 22:19:37 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 40 ms / 2,000 ms |
コード長 | 5,456 bytes |
コンパイル時間 | 2,372 ms |
コンパイル使用メモリ | 201,528 KB |
実行使用メモリ | 6,548 KB |
最終ジャッジ日時 | 2024-02-23 22:19:50 |
合計ジャッジ時間 | 6,993 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,548 KB |
testcase_01 | AC | 27 ms
6,548 KB |
testcase_02 | AC | 26 ms
6,548 KB |
testcase_03 | AC | 27 ms
6,548 KB |
testcase_04 | AC | 26 ms
6,548 KB |
testcase_05 | AC | 26 ms
6,548 KB |
testcase_06 | AC | 40 ms
6,548 KB |
testcase_07 | AC | 40 ms
6,548 KB |
testcase_08 | AC | 25 ms
6,548 KB |
testcase_09 | AC | 28 ms
6,548 KB |
testcase_10 | AC | 28 ms
6,548 KB |
testcase_11 | AC | 30 ms
6,548 KB |
testcase_12 | AC | 29 ms
6,548 KB |
testcase_13 | AC | 26 ms
6,548 KB |
testcase_14 | AC | 26 ms
6,548 KB |
testcase_15 | AC | 26 ms
6,548 KB |
testcase_16 | AC | 27 ms
6,548 KB |
testcase_17 | AC | 27 ms
6,548 KB |
testcase_18 | AC | 26 ms
6,548 KB |
testcase_19 | AC | 26 ms
6,548 KB |
testcase_20 | AC | 26 ms
6,548 KB |
testcase_21 | AC | 26 ms
6,548 KB |
testcase_22 | AC | 27 ms
6,548 KB |
testcase_23 | AC | 26 ms
6,548 KB |
testcase_24 | AC | 24 ms
6,548 KB |
testcase_25 | AC | 26 ms
6,548 KB |
testcase_26 | AC | 25 ms
6,548 KB |
testcase_27 | AC | 26 ms
6,548 KB |
testcase_28 | AC | 26 ms
6,548 KB |
testcase_29 | AC | 25 ms
6,548 KB |
testcase_30 | AC | 24 ms
6,548 KB |
testcase_31 | AC | 26 ms
6,548 KB |
testcase_32 | AC | 26 ms
6,548 KB |
testcase_33 | AC | 27 ms
6,548 KB |
testcase_34 | AC | 27 ms
6,548 KB |
testcase_35 | AC | 27 ms
6,548 KB |
testcase_36 | AC | 25 ms
6,548 KB |
testcase_37 | AC | 27 ms
6,548 KB |
testcase_38 | AC | 27 ms
6,548 KB |
testcase_39 | AC | 24 ms
6,548 KB |
testcase_40 | AC | 28 ms
6,548 KB |
testcase_41 | AC | 24 ms
6,548 KB |
testcase_42 | AC | 24 ms
6,548 KB |
testcase_43 | AC | 39 ms
6,548 KB |
testcase_44 | AC | 39 ms
6,548 KB |
testcase_45 | AC | 39 ms
6,548 KB |
testcase_46 | AC | 39 ms
6,548 KB |
testcase_47 | AC | 39 ms
6,548 KB |
testcase_48 | AC | 39 ms
6,548 KB |
testcase_49 | AC | 39 ms
6,548 KB |
testcase_50 | AC | 39 ms
6,548 KB |
testcase_51 | AC | 39 ms
6,548 KB |
testcase_52 | AC | 39 ms
6,548 KB |
testcase_53 | AC | 23 ms
6,548 KB |
testcase_54 | AC | 25 ms
6,548 KB |
testcase_55 | AC | 30 ms
6,548 KB |
testcase_56 | AC | 23 ms
6,548 KB |
testcase_57 | AC | 26 ms
6,548 KB |
testcase_58 | AC | 29 ms
6,548 KB |
testcase_59 | AC | 31 ms
6,548 KB |
testcase_60 | AC | 23 ms
6,548 KB |
testcase_61 | AC | 24 ms
6,548 KB |
testcase_62 | AC | 26 ms
6,548 KB |
testcase_63 | AC | 24 ms
6,548 KB |
testcase_64 | AC | 25 ms
6,548 KB |
testcase_65 | AC | 24 ms
6,548 KB |
testcase_66 | AC | 27 ms
6,548 KB |
testcase_67 | AC | 27 ms
6,548 KB |
testcase_68 | AC | 27 ms
6,548 KB |
testcase_69 | AC | 27 ms
6,548 KB |
testcase_70 | AC | 27 ms
6,548 KB |
testcase_71 | AC | 27 ms
6,548 KB |
ソースコード
#pragma GCC optimize("O2") #include <algorithm> #include <array> #include <bit> #include <bitset> #include <cassert> #include <cctype> #include <cfenv> #include <cfloat> #include <chrono> #include <cinttypes> #include <climits> #include <cmath> #include <compare> #include <complex> #include <concepts> #include <cstdarg> #include <cstddef> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <deque> #include <fstream> #include <functional> #include <initializer_list> #include <iomanip> #include <ios> #include <iostream> #include <istream> #include <iterator> #include <limits> #include <list> #include <map> #include <memory> #include <new> #include <numbers> #include <numeric> #include <ostream> #include <queue> #include <random> #include <ranges> #include <set> #include <span> #include <sstream> #include <stack> #include <streambuf> #include <string> #include <tuple> #include <type_traits> #include <variant> //#define int ll #define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1) #define INT128_MIN (-INT128_MAX - 1) #define clock chrono::steady_clock::now().time_since_epoch().count() #ifdef DEBUG #define dbg(x) cout << (#x) << " = " << x << '\n' #else #define dbg(x) #endif namespace R = std::ranges; namespace V = std::views; using namespace std; using ll = long long; using ull = unsigned long long; using ldb = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; //#define double ldb template<class T> ostream& operator<<(ostream& os, const pair<T, T> pr) { return os << pr.first << ' ' << pr.second; } template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N> &arr) { for(const T &X : arr) os << X << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const vector<T> &vec) { for(const T &X : vec) os << X << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const set<T> &s) { for(const T &x : s) os << x << ' '; return os; } //reference: https://github.com/NyaanNyaan/library/blob/master/modint/montgomery-modint.hpp#L10 //note: mod should be a prime less than 2^30. template<uint32_t mod> struct MontgomeryModInt { using mint = MontgomeryModInt; using i32 = int32_t; using u32 = uint32_t; using u64 = uint64_t; static constexpr u32 get_r() { u32 res = 1, base = mod; for(i32 i = 0; i < 31; i++) res *= base, base *= base; return -res; } static constexpr u32 get_mod() { return mod; } static constexpr u32 n2 = -u64(mod) % mod; //2^64 % mod static constexpr u32 r = get_r(); //-P^{-1} % 2^32 u32 a; static u32 reduce(const u64 &b) { return (b + u64(u32(b) * r) * mod) >> 32; } static u32 transform(const u64 &b) { return reduce(u64(b) * n2); } MontgomeryModInt() : a(0) {} MontgomeryModInt(const int64_t &b) : a(transform(b % mod + mod)) {} mint pow(u64 k) const { mint res(1), base(*this); while(k) { if (k & 1) res *= base; base *= base, k >>= 1; } return res; } mint inverse() const { return (*this).pow(mod - 2); } u32 get() const { u32 res = reduce(a); return res >= mod ? res - mod : res; } mint& operator+=(const mint &b) { if (i32(a += b.a - 2 * mod) < 0) a += 2 * mod; return *this; } mint& operator-=(const mint &b) { if (i32(a -= b.a) < 0) a += 2 * mod; return *this; } mint& operator*=(const mint &b) { a = reduce(u64(a) * b.a); return *this; } mint& operator/=(const mint &b) { a = reduce(u64(a) * b.inverse().a); return *this; } mint operator-() { return mint() - mint(*this); } bool operator==(mint b) const { return (a >= mod ? a - mod : a) == (b.a >= mod ? b.a - mod : b.a); } bool operator!=(mint b) const { return (a >= mod ? a - mod : a) != (b.a >= mod ? b.a - mod : b.a); } friend mint operator+(mint a, mint b) { return a += b; } friend mint operator-(mint a, mint b) { return a -= b; } friend mint operator*(mint a, mint b) { return a *= b; } friend mint operator/(mint a, mint b) { return a /= b; } friend ostream& operator<<(ostream& os, const mint& b) { return os << b.get(); } friend istream& operator>>(istream& is, mint& b) { int64_t val; is >> val; b = mint(val); return is; } }; using mint = MontgomeryModInt<998244353>; signed main() { ios::sync_with_stdio(false), cin.tie(NULL); int t; cin >> t; while(t--) { int n, m; cin >> n >> m; vector<int> x(n); for(int &y : x) cin >> y; int tot = 0; for(int y : x) tot += y == -1; if (tot == 0) { mint ans = 0; int pre = 0; for(int y : x) { pre = (pre + y) % m; if (pre != 0) ans += 1; } cout << (pre == 0 ? ans : mint(0)) << '\n'; continue; } vector<int> suf(n + 1); for(int i = n - 1; i >= 0; i--) suf[i] = (suf[i + 1] + (x[i] == -1 ? 0 : x[i])) % m; mint ans = 0; mint c = mint(m).pow(tot - 2), d = mint(m).pow(tot - 1); for(int pre = 0, cnt = 0, i = 0; int y : x) { if (y != -1) pre = (pre + y) % m; else cnt++; if (cnt != 0 and cnt != tot) ans += c; else if (cnt == 0 and pre == 0) ans += d; else if (cnt == tot and suf[i + 1] == 0) ans += d; i++; } cout << n * d - ans << '\n'; } return 0; }