結果

問題 No.2653 [Cherry 6th Tune] Re: start! (Make it Zero!)
ユーザー 👑 AngrySadEight
提出日時 2023-12-07 01:01:28
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 179 ms / 2,000 ms
コード長 5,689 bytes
コンパイル時間 17,497 ms
コンパイル使用メモリ 261,928 KB
最終ジャッジ日時 2025-02-18 08:51:40
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 72
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>
using mint = modint998244353;
template <typename T>
void debug(T e) {
    cerr << e << endl;
}
template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}
template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}
template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}
template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}
template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}
ll my_pow(ll x, ll n, ll mod) {
    // 　繰り返し二乗法．x^nをmodで割った余り．
    ll ret;
    if (n == 0) {
        ret = 1;
    } else if (n % 2 == 1) {
        ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod;
    } else {
        ret = my_pow((x * x) % mod, n / 2, mod);
    }
    return ret;
}
ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); }
int main() {
    ll T;
    cin >> T;
    while (T--) {
        ll N, M;
        cin >> N >> M;
        vector<ll> X(N);
        for (ll i = 0; i < N; i++) {
            cin >> X[i];
        }
        vector<ll> pow_m(N + 1);
        pow_m[0] = 1;
        for (ll i = 0; i < N; i++) {
            pow_m[i + 1] = (pow_m[i] * M) % mod2;
        }
        ll minus_num = 0;
        for (ll i = 0; i < N; i++) {
            if (X[i] == -1) {
                minus_num++;
            }
        }
        if (minus_num == 0) {
            ll ans = 0;
            ll num = 0;
            for (ll i = 0; i < N; i++) {
                num = (num + X[i]) % M;
                if (num != 0) {
                    ans++;
                }
            }
            if (num == 0) {
                cout << ans << endl;
            } else {
                cout << 0 << endl;
            }
        } else if (minus_num == 1) {
            ll ans = 0;
            ll num = 0;
            ll idx = -1;
            for (ll i = 0; i < N; i++) {
                if (X[i] != -1) {
                    num = (num + X[i]) % M;
                } else {
                    idx = i;
                }
            }
            X[idx] = (M - num) % M;
            num = 0;
            for (ll i = 0; i < N; i++) {
                num = (num + X[i]) % M;
                if (num != 0) {
                    ans++;
                }
            }
            cout << ans << endl;
        } else {
            ll ans = (pow_m[minus_num - 1] * (N - 1)) % mod2;
            vector<ll> minus_idx(0);
            for (ll i = 0; i < N; i++) {
                if (X[i] == -1) {
                    minus_idx.push_back(i);
                }
            }
            ll sum_goal = 0;
            for (ll i = minus_idx[minus_num - 1] + 1; i < N; i++) {
                sum_goal += X[i];
                sum_goal %= M;
            }
            ll sum1 = 0;
            ll sum2 = 0;
            for (ll i = 0; i < N - 1; i++) {
                if (i < minus_idx[0]) {
                    sum1 = (sum1 + X[i]) % M;
                    if (sum1 == 0) {
                        ans = (ans + mod2 - pow_m[minus_num - 1]) % mod2;
                    }
                } else if (i >= minus_idx[minus_num - 1]) {
                    if (X[i] != -1) {
                        sum2 = (sum2 + X[i]) % M;
                    }
                    if (sum2 == sum_goal) {
                        ans = (ans + mod2 - pow_m[minus_num - 1]) % mod2;
                    }
                } else {
                    ans = (ans + mod2 - pow_m[minus_num - 2]) % mod2;
                }
                // debug(ans);
            }
            cout << ans << endl;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0