結果
問題 |
No.2653 [Cherry 6th Tune] Re: start! (Make it Zero!)
|
ユーザー |
|
提出日時 | 2024-02-26 16:45:49 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 52 ms / 2,000 ms |
コード長 | 4,071 bytes |
コンパイル時間 | 3,179 ms |
コンパイル使用メモリ | 253,752 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-09-29 11:39:44 |
合計ジャッジ時間 | 8,154 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 72 |
ソースコード
#include<bits/stdc++.h> using namespace std; using ll = long long; using pll = pair<ll, ll>; #define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i) #define rep(i, n) drep(i, 0, n - 1) #define all(a) (a).begin(), (a).end() #define pb push_back #define fi first #define se second mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count()); const ll MOD1000000007 = 1000000007; const ll MOD998244353 = 998244353; const ll MOD[3] = {999727999, 1070777777, 1000000007}; const ll LINF = 1LL << 60LL; const int IINF = (1 << 30) - 1; template<long long mod> class modint{ long long x; public: modint(long long x=0) : x((x%mod+mod)%mod) {} modint operator-() const { return modint(-x); } bool operator==(const modint& a){ if(x == a) return true; else return false; } bool operator==(long long a){ if(x == a) return true; else return false; } bool operator!=(const modint& a){ if(x != a) return true; else return false; } bool operator!=(long long a){ if(x != a) return true; else return false; } modint& operator+=(const modint& a) { if ((x += a.x) >= mod) x -= mod; return *this; } modint& operator-=(const modint& a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } modint& operator*=(const modint& a) { (x *= a.x) %= mod; return *this; } modint operator+(const modint& a) const { modint res(*this); return res+=a; } modint operator-(const modint& a) const { modint res(*this); return res-=a; } modint operator*(const modint& a) const { modint res(*this); return res*=a; } modint pow(long long t) const { if (!t) return 1; modint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod modint inv() const { return pow(mod-2); } modint& operator/=(const modint& a) { return (*this) *= a.inv(); } modint operator/(const modint& a) const { modint res(*this); return res/=a; } friend std::istream& operator>>(std::istream& is, modint& m) noexcept { is >> m.x; m.x %= mod; if (m.x < 0) m.x += mod; return is; } friend ostream& operator<<(ostream& os, const modint& m){ os << m.x; return os; } }; using mint = modint<MOD998244353>; void solve(){ int n; cin >> n; ll m; cin >> m; vector<ll> x(n+1, 0); int cnt = 0; for(int i=1; i<=n; i++){ cin >> x[i]; cnt += (x[i]==-1); } if(cnt == 0){ vector<ll> sum(n+1, 0); for(int i=1; i<=n; i++) sum[i] = (sum[i-1] + x[i])%m; if(sum[n]%m!=0){ cout << 0 << '\n'; }else{ int ans = 0; for(int i=0; i<=n; i++) ans += (sum[i]!=0); cout << ans << '\n'; } return; } if(cnt == 1){ ll s = 0; for(int i=1; i<=n; i++) if(x[i]!=-1) s += x[i]; for(int i=1; i<=n; i++) if(x[i]==-1) x[i] = (m-s%m)%m; vector<ll> sum(n+1, 0); for(int i=1; i<=n; i++) sum[i] = (sum[i-1] + x[i])%m; if(sum[n]%m!=0){ cout << 0 << '\n'; }else{ int ans = 0; for(int i=0; i<=n; i++) ans += (sum[i]!=0); cout << ans << '\n'; } return; } mint ans = 0; int l, r; for(l=1; l<=n; l++)if(x[l]==-1) break; for(r=n; r>=1; r--)if(x[r]==-1) break; ll sum = 0; for(int i=1; i<l; i++){ sum = (sum + x[i])%m; if(sum!=0) ans += mint(m).pow(cnt-1); } sum = 0; for(int i=n; i>r; i--){ sum = (sum + x[i])%m; if(sum!=0) ans += mint(m).pow(cnt-1); } for(int i=l; i<r; i++) ans += mint(m-1)*mint(m).pow(cnt-2); cout << ans << '\n'; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int T=1; cin >> T; while(T--) solve(); }