結果

問題 No.1025 Modular Equation
ユーザー satashunsatashun
提出日時 2020-12-15 19:24:54
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,250 ms / 5,000 ms
コード長 4,969 bytes
コンパイル時間 2,103 ms
コンパイル使用メモリ 214,100 KB
実行使用メモリ 201,344 KB
最終ジャッジ日時 2024-09-20 02:01:30
合計ジャッジ時間 40,408 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 9 ms
6,940 KB
testcase_03 AC 6 ms
6,944 KB
testcase_04 AC 4 ms
6,944 KB
testcase_05 AC 3 ms
6,940 KB
testcase_06 AC 3 ms
6,940 KB
testcase_07 AC 3 ms
6,944 KB
testcase_08 AC 3 ms
6,944 KB
testcase_09 AC 2,021 ms
7,680 KB
testcase_10 AC 2,080 ms
7,808 KB
testcase_11 AC 1,642 ms
7,808 KB
testcase_12 AC 1,497 ms
8,064 KB
testcase_13 AC 1,252 ms
7,552 KB
testcase_14 AC 1,291 ms
7,680 KB
testcase_15 AC 1,197 ms
7,680 KB
testcase_16 AC 1,134 ms
7,424 KB
testcase_17 AC 1,259 ms
7,808 KB
testcase_18 AC 1,125 ms
7,296 KB
testcase_19 AC 1,431 ms
94,208 KB
testcase_20 AC 1,294 ms
65,280 KB
testcase_21 AC 1,372 ms
52,352 KB
testcase_22 AC 1,289 ms
43,008 KB
testcase_23 AC 1,886 ms
191,360 KB
testcase_24 AC 2,250 ms
8,064 KB
testcase_25 AC 1,692 ms
8,064 KB
testcase_26 AC 1,506 ms
8,192 KB
testcase_27 AC 1,389 ms
8,064 KB
testcase_28 AC 1,280 ms
8,064 KB
testcase_29 AC 1,205 ms
8,064 KB
testcase_30 AC 1,453 ms
70,528 KB
testcase_31 AC 1,607 ms
102,912 KB
testcase_32 AC 1,954 ms
201,344 KB
testcase_33 AC 2 ms
6,940 KB
testcase_34 AC 1,102 ms
7,808 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int pr_root(int)':
main.cpp:140:1: warning: control reaches end of non-void function [-Wreturn-type]
  140 | }
      | ^

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (int i = m; i < (n); i++)
#define per(i, b) per2(i, 0, b)
#define per2(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define ALL(c) (c).begin(), (c).end()
#define SZ(x) ((int)(x).size())

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }

template <class T, class U>
void chmin(T& t, const U& u) {
    if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const U& u) {
    if (t < u) t = u;
}

template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << "," << p.second << ")";
    return os;
}

template <class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "{";
    rep(i, v.size()) {
        if (i) os << ",";
        os << v[i];
    }
    os << "}";
    return os;
}

#ifdef LOCAL
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << H;
    debug_out(T...);
}
#define debug(...) \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

template <unsigned int MOD>
struct ModInt {
    using uint = unsigned int;
    using ull = unsigned long long;
    using M = ModInt;

    uint v;

    ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
    M& set_norm(uint _v) {  //[0, MOD * 2)->[0, MOD)
        v = (_v < MOD) ? _v : _v - MOD;
        return *this;
    }

    explicit operator bool() const { return v != 0; }
    M operator+(const M& a) const { return M().set_norm(v + a.v); }
    M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
    M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
    M operator/(const M& a) const { return *this * a.inv(); }
    M& operator+=(const M& a) { return *this = *this + a; }
    M& operator-=(const M& a) { return *this = *this - a; }
    M& operator*=(const M& a) { return *this = *this * a; }
    M& operator/=(const M& a) { return *this = *this / a; }
    M operator-() const { return M() - *this; }
    M& operator++(int) { return *this = *this + 1; }
    M& operator--(int) { return *this = *this - 1; }

    M pow(ll n) const {
        if (n < 0) return inv().pow(-n);
        M x = *this, res = 1;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }

    M inv() const {
        ll a = v, b = MOD, p = 1, q = 0, t;
        while (b != 0) {
            t = a / b;
            swap(a -= t * b, b);
            swap(p -= t * q, q);
        }
        return M(p);
    }

    bool operator==(const M& a) const { return v == a.v; }
    bool operator!=(const M& a) const { return v != a.v; }
    friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
    static uint get_mod() { return MOD; }
};

using Mint = ModInt<1000000007>;

int pr_root(int p) {
    for (int i = 1; i < p; ++i) {
        set<int> st;
        int x = 1;
        bool ok = 1;
        rep(t, p - 1) {
            if (st.count(x)) {
                ok = 0;
                break;
            }
            st.insert(x);
            x = x * i % p;
        }
        if (ok) {
            return i;
        }
    }
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int p, n, k, b;
    cin >> p >> n >> k >> b;
    V<int> a(n);
    rep(i, n) cin >> a[i];

    k = __gcd(k, p - 1);
    int g = pr_root(p);

    // dp[i][j] : ..i, mod p = r^j, j = k : 0

    VV<Mint> dp(n + 1, V<Mint>(k + 1));
    dp[0][k] = 1;

    V<int> rk(p), pw(p);
    {
        int x = 1;
        rep(t, p - 1) {
            pw[t] = x;
            rk[x] = t;
            x = x * g % p;
        }
    }

    debug(k, rk);

    rep(i, n) {
        rep(j, k + 1) {
            // x=0
            dp[i + 1][j] += dp[i][j];
            int v = j == k ? 0 : pw[j];
            for (int x = 0; x < (p - 1) / k; ++x) {
                int nv = (v + ll(pw[x * k]) * a[i]) % p;
                if (nv == 0) {
                    dp[i + 1][k] += dp[i][j] * k;
                } else {
                    dp[i + 1][rk[nv] % k] += dp[i][j] * k;
                }
            }
        }
    }
    int c = b == 0 ? k : rk[b] % k;
    int cnt = 0;
    for (int i = 1; i < p; ++i) {
        if (rk[i] % k == c) cnt++;
    }
    debug(dp[n]);
    if (b > 0) {
        if (cnt > 0) {
            cout << dp[n][c] / cnt << endl;
        } else {
            cout << 0 << endl;
        }
    } else {
        cout << dp[n][k] << endl;
    }

    return 0;
}
0