#759149 (C++17) No.97 最大の値を求めるくえり

提出ソース

結果

問題	No.97 最大の値を求めるくえり
ユーザー	Demystify
提出日時	2022-05-07 21:41:30
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	134 ms / 5,000 ms
コード長	9,895 bytes
コンパイル時間	2,359 ms
コンパイル使用メモリ	210,148 KB
実行使用メモリ	7,040 KB
最終ジャッジ日時	2024-07-07 03:40:25
合計ジャッジ時間	4,149 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	5 ms 6,812 KB
testcase_01	AC	6 ms 7,040 KB
testcase_02	AC	77 ms 6,944 KB
testcase_03	AC	19 ms 6,940 KB
testcase_04	AC	18 ms 6,944 KB
testcase_05	AC	20 ms 6,940 KB
testcase_06	AC	22 ms 6,940 KB
testcase_07	AC	30 ms 6,940 KB
testcase_08	AC	44 ms 6,944 KB
testcase_09	AC	72 ms 6,944 KB
testcase_10	AC	134 ms 6,944 KB
testcase_11	AC	97 ms 6,940 KB
testcase_12	AC	78 ms 6,944 KB
testcase_13	AC	68 ms 6,940 KB
testcase_14	AC	48 ms 6,940 KB
testcase_15	AC	31 ms 6,944 KB
testcase_16	AC	27 ms 6,944 KB
testcase_17	AC	24 ms 6,944 KB
testcase_18	AC	24 ms 7,040 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (int i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define P0(i) (((i) & 1) == 0)
#define P1(i) (((i) & 1) == 1)
#ifdef _LOCAL
    #define debug_bar cerr << "--------------------\n";
    #define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
    #define debug_pair(x) cerr << "l." << __LINE__ << " : " << #x << " = (" << x.first << "," << x.second << ")\n";
    template<class T> void debug_line(const vector<T>& ans, int l, int r, int L = 0) { cerr << "l." << L << " :"; for (int i = l; i < r; i++) { cerr << ' ' << ans[i]; } cerr << '\n'; }
#else
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(x)
    #define debug_pair(x)
    template<class T> void debug_line([[maybe_unused]] const vector<T>& ans, [[maybe_unused]] int l, [[maybe_unused]] int r, [[maybe_unused]] int L = 0) {}
#endif
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> pair<T,T> divmod(T a, T b) { assert(a >= 0 && b > 0); return make_pair(T(a / b), T(a % b)); }
template<class T> T mod(T x, T m) { assert(m != 0); return T((x % m + m) % m); }
template<class T> T ceil(T a, T b) { if (b < 0) { return ceil(T(-a), T(-b)); } assert(b > 0); return (a < 0 ? T(a / b) : T((a + b - 1) / b)); }
template<class T> T floor(T a, T b) { if (b < 0) { return floor(T(-a), T(-b)); } assert(b > 0); return (a > 0 ? T(a / b) : T((a - b + 1) / b)); }
template<class T> T powint(T x, T n) { assert(n >= 0); if (n == 0) { return T(1); }; T res = powint(x, T(n>>1)); res *= res; if (n & 1) { res *= x; } return res; }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digit_len(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll digit_sum(ll n) { assert(n >= 0); ll sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; }
ll digit_prod(ll n) { assert(n >= 0); if (n == 0) { return 0; } ll prod = 1; while (n > 0) { prod *= n % 10; n /= 10; } return prod; }
ll xor_sum(ll x) { assert(0 <= x); switch (x % 4) { case 0: return x; case 1: return 1; case 2: return x ^ 1; case 3: return 0; } assert(false); }
string toupper(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = toupper(T[i]); } return T; }
string tolower(const string& S) { string T(S); for (int i = 0; i < (int)T.size(); i++) { T[i] = tolower(T[i]); } return T; }
int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }
int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }
int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }
char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }
char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }
char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
const ld EPS = 1e-10;
const ld PI  = acosl(-1.0);
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 100003;
// constexpr ll MOD = 998244353;
constexpr int inf = (1 << 30) - 1;   // 1073741824 - 1
constexpr ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


// 問題文より
unsigned xor128_x = 123456789, xor128_y = 362436069, xor128_z = 521288629, xor128_w = 88675123;
unsigned xor128() {
	unsigned t = xor128_x ^ (xor128_x << 11);
	xor128_x = xor128_y; xor128_y = xor128_z; xor128_z = xor128_w;
	return xor128_w = xor128_w ^ (xor128_w >> 19) ^ (t ^ (t >> 8));
}
// void generateA(int N, int A[]) {
void generateA(int N, VLL& A) {
    for(int i = 0; i < N; ++ i)
        A[i] = xor128() % 100003;
}


// References:
//   mint:
//     <https://github.com/atcoder/live_library/blob/master/mint.cpp>
//     <https://noshi91.hatenablog.com/entry/2019/03/31/174006>
//     <https://ei1333.github.io/luzhiled/snippets/math/mod-int.html>
//     <https://gist.github.com/MiSawa/dc78c3eb3ca16051818759ea069e8ccb>
//     <https://github.com/drken1215/algorithm/blob/master/MathCombinatorics/mod.cpp>
//   combination:
//     <https://github.com/atcoder/live_library/blob/master/comb.cpp>
//     <https://github.com/drken1215/algorithm/blob/master/MathCombinatorics/mod.cpp>

struct mint {
    ll x;
    constexpr mint(ll x = 0) noexcept : x((x % MOD + MOD) % MOD) {}

    constexpr mint& operator+=(const mint& a) noexcept {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    constexpr mint& operator-=(const mint& a) noexcept {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    constexpr mint& operator*=(const mint& a) noexcept { (x *= a.x) %= MOD; return *this; }
    constexpr mint& operator/=(const mint& a) noexcept { return *this *= a.inv(); }

    constexpr mint operator-() const noexcept { return mint(-x); }
    constexpr mint operator+(const mint& a) const noexcept { return mint(*this) += a; }
    constexpr mint operator-(const mint& a) const noexcept { return mint(*this) -= a; }
    constexpr mint operator*(const mint& a) const noexcept { return mint(*this) *= a; }
    constexpr mint operator/(const mint& a) const noexcept { return mint(*this) /= a; }
    constexpr bool operator==(const mint& a) const noexcept { return x == a.x; }
    constexpr bool operator!=(const mint& a) const noexcept { return x != a.x; }

    constexpr mint pow(ll n) const {
        if (n == 0) return 1;
        mint res = pow(n >> 1);
        res *= res;
        if (n & 1) res *= *this;
        return res;
    }
    constexpr mint inv() const { return pow(MOD - 2); }

    friend istream& operator>>(istream& is, mint& a) noexcept {
        ll v; is >> v;
        a = mint(v);
        return is;
    }
    friend ostream& operator<<(ostream& os, const mint& a) noexcept {
        return os << a.x;
    }
};
using VM = vector<mint>;
using VVM = vector<VM>;
using VVVM = vector<VVM>;
using VVVVM = vector<VVVM>;


struct combination {
    vector<mint> fact_, ifact_, inv_;
    int n_;
    combination() {}
    combination(int n) : fact_(n+1,0), ifact_(n+1,0), inv_(n+1,0) {
        assert(n != 0);
        assert(n < MOD);
        n_ = n;
        fact_[0] = 1; fact_[1] = 1;
        ifact_[0] = 1; ifact_[1] = 1;
        inv_[1] = 1;
        for(int i = 2; i <= n; ++i) {
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            ifact_[i] = ifact_[i-1] * inv_[i];
        }
    }

    mint P(const int& n, const int& k) const noexcept {
        if (n < 0 || k < 0 || n < k) return 0;
        assert(n <= n_);
        return fact_[n] * ifact_[n-k];
    }
    mint C(const int& n, const int& k) const noexcept {
        if (n < 0 || k < 0 || n < k) return 0;
        assert(n <= n_);
        return fact_[n] * ifact_[n-k] * ifact_[k];
    }
    mint H(const int& n, const int& k) const noexcept {
        if (n < 0 || k < 0) return 0;
        assert(n + k - 1 <= n_);
        return C(n + k - 1, k);
    }
    mint fact(const int& n) const noexcept {
        assert(n <= n_);
        if (n < 0) return 0;
        return fact_[n];
    }
    mint ifact(const int& n) const noexcept {
        assert(n <= n_);
        if (n < 0) return 0;
        return ifact_[n];
    }
    mint inv(const int& n) const noexcept {
        assert(n <= n_);
        if (n < 0) return 0;
        return inv_[n];
    }
};


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N, Q; input(N, Q);
    VLL A(N);
    generateA(N, A);

    VB vis(MOD, false);
    for (auto a : A) vis[a] = true;
    combination Z(MOD-1);

    VLL memo(MOD,-1);
    memo[0] = 0;
    int B = sqrt(MOD);
    while (Q--) {
        ll q; input(q);
        if (memo[q] != -1) {
            print(memo[q]);
            continue;
        }
        if (N <= B) {
            ll res = 0;
            for (auto a : A) chmax(res, mod(q * a, MOD));
            memo[q] = res;
        } else {
            RREP(m,MOD) {
                mint a = Z.inv(q) * m;
                if (vis[a.x]) {
                    memo[q] = m; break;
                }
            }
        }
        assert(memo[q] != -1);
        print(memo[q]);
    }

    return 0;
}

yukicoder

結果

テストケース

ソースコード