結果

問題 No.1819 Mirrored 2
コンテスト
ユーザー haruki_K
提出日時 2022-01-21 23:27:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 11,432 bytes
コンパイル時間 2,406 ms
コンパイル使用メモリ 212,856 KB
最終ジャッジ日時 2025-01-27 14:33:22
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 1
other WA * 22 RE * 4
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
template <class Int> auto constexpr inf_ = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf_<int32_t>;
auto constexpr INF64 = inf_<int64_t>;
auto constexpr INF   = inf_<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T, class Comp> struct pque : priority_queue<T, vector<T>, Comp> { vector<T> &data() { return this->c; } void clear() { this->c.clear(); } };
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T, S> const& p) { return os << p.first << " " << p.second; }
template <class T, class S> istream& operator>>(istream& is, pair<T, S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint { template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); } };
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T, d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T, d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T, 0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T, d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > (T)y) { x = (T)y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < (T)y) { x = (T)y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b, e, typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) { return lower_bound(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
constexpr ll mod(ll x, ll m) { assert(m > 0); return (x %= m) < 0 ? x+m : x; }
constexpr ll div_floor(ll x, ll y) { assert(y != 0); return x/y - ((x^y) < 0 and x%y); }
constexpr ll div_ceil(ll x, ll y) { assert(y != 0); return x/y + ((x^y) > 0 and x%y); }
constexpr int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1 };
constexpr int dy[] = { 0, 1, 0, -1, 1, 1, -1, -1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
mt19937_64 seed_{random_device{}()};
template <class Int> Int rand(Int a, Int b) { return uniform_int_distribution<Int>(a, b)(seed_); }
i64 irand(i64 a, i64 b) { return rand<i64>(a, b); } // [a, b]
u64 urand(u64 a, u64 b) { return rand<u64>(a, b); } //
template <class It> void shuffle(It l, It r) { shuffle(l, r, seed_); }
template <class V> V &operator--(V &v) { for (auto &x : v) --x; return v; }
template <class V> V &operator++(V &v) { for (auto &x : v) ++x; return v; }
bool next_product(vector<int> &v, int m) {
    repR (i, v.size()) if (++v[i] < m) return true; else v[i] = 0;
    return false;
}
bool next_product(vector<int> &v, vector<int> const& s) {
    repR (i, v.size()) if (++v[i] < s[i]) return true; else v[i] = 0;
    return false;
}
template <class vec> int sort_unique(vec &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
    return v.size();
}
template <class V> auto prefix_sum(V const& a) {
    vector<typename V::value_type> s;
    s.reserve(a.size() + 1);
    s.push_back(0);
    for (auto const& x : a) s.emplace_back(s.back() + x);
    return s;
}
template <class V> auto suffix_sum(V const& a) {
    vector<typename V::value_type> s(a.size() + 1);
    int pos = a.size();
    for (auto it = a.rbegin(); it != a.rend(); ++it, --pos) {
        s[pos-1] = *it + s[pos];
    }
    return s;
}
// <<<
// >>> runtime modint

template <int id> class runtime_modint {
    using u32 = uint32_t;
    using i32 = int32_t;
    using i64 = int64_t;
    using M = runtime_modint;
    u32 x;
    struct barrett {
        uint32_t mod;
        uint64_t inv;
        barrett() : mod(0), inv(0) { }
        barrett(uint32_t mod) : mod(mod), inv((uint64_t)(-1) / mod + 1) { }
        uint32_t operator()(uint32_t a, uint32_t b) const {
            return operator()(uint64_t(a) * b);
        }
        uint32_t operator()(uint64_t a) const {
            const __uint128_t c = a;
            const uint64_t q = (c * inv) >> 64;
            uint32_t x = c - q * mod;
            if (mod <= x) x += mod;
            return x;
        }
    };
    inline static barrett bar;
public:
    static void set_mod(u32 new_mod) { bar = barrett(new_mod); }
    static int mod() { return bar.mod; }
    runtime_modint(i64 x = 0) {
        assert(mod() > 0);
        if (x < 0) {
            x = -x;
            this->x = bar(x);
            if (this->x > 0) this->x = mod() - this->x;
        } else {
            this->x = bar(x);
        }
    }
    i64 val() const { return x; }
    constexpr explicit operator i64() const { return x; }
    bool operator==(M const& r) const { return x == r.x; }
    bool operator!=(M const& r) const { return x != r.x; }
    M operator+() const { return *this; }
    M operator-() const { return M()-*this; }
    M& operator+=(M const& r) { i64 t = i64(x) + r.x; if (t >= mod()) t -= mod(); x = t; return *this; }
    M& operator-=(M const& r) { i64 t = i64(x) + mod()-r.x; if (t >= mod()) t -= mod(); x = t; return *this; }
    M& operator*=(M const& r) { x = bar(x, r.x); return *this; }
    M& operator/=(M const& r) { return *this *= r.inv(); }
    M operator+(M r) const { return M(*this) += r; }
    M operator-(M r) const { return M(*this) -= r; }
    M operator*(M r) const { return M(*this) *= r; }
    M operator/(M r) const { return M(*this) /= r; }
    friend M operator+(i64 x, M y) { return M(x)+y; }
    friend M operator-(i64 x, M y) { return M(x)-y; }
    friend M operator*(i64 x, M y) { return M(x)*y; }
    friend M operator/(i64 x, M y) { return M(x)/y; }
    M pow(i64 n) const { // 0^0 = 1
        if (n < 0) return inv().pow(-n);
        M v = *this, r = 1;
        for (; n > 0; n >>= 1, v *= v) if (n&1) r *= v;
        return r;
    }
    M inv() const {
        uint32_t a = x, b = mod();
        int64_t u = 1, v = 0;
        while (b) {
            int64_t q = a / b;
            swap(a -= q * b, b);
            swap(u -= q * v, v);
        }
        assert(a == 1);
        return u;
    }
    static i64 gen() { // assume mod():prime
        if (mod() == 2) return 1;
        assert(mod() >= 3);
        for (int i = 2; i*i <= mod(); i++) assert(mod() % i != 0);
        vector<int> ps;
        int n = mod()-1;
        for (int i = 2; i*i <= n; ++i) {
            if (n % i) continue;
            ps.push_back(i);
            do n /= i; while (n % i == 0);
        }
        if (n > 1) ps.push_back(n);
        n = mod()-1;
        auto check = [&](M g) {
            for (int p : ps) if (g.pow(n/p) == 1) return false;
            return true;
        };
        for (int g = 2; g <= n; ++g) if (check(g)) return g;
        return -1;
    }

    // return minimum k >= (allow_zero ? 0 : 1) s.t. this->pow(k) == y
    // return -1 if not found
    int log(M y, bool allow_zero = false) {
        if (allow_zero and pow(0) == y) return 0;
        auto x = *this;
        M z = 1;
        int k = 0;
        while ((1u << k) < mod()) {
            z *= x, k++;
            if (z == y) return k;
        }
        u32 g = gcd(z.x, mod());
        if (y.x % g != 0) return -1;

        auto old_bar = bar;
        bar = barrett(mod()/g);
        x.x %= mod(), y.x /= g, z.x /= g;
        unordered_map<u32, u32> m;
        int s = 0;
        M w = 1;
        for ( ; s*s < mod(); s++) m[(y*w).x] = s, w *= x;
        while (k < mod()) {
            z *= w, k += s;
            if (m.count(z.x)) {
                swap(bar, old_bar);
                return k - m[z.x];
            }
        }
        swap(bar, old_bar);
        return -1;
    }
#ifdef LOCAL
//    friend string to_s(M r) { return to_s(r.val(), M::mod()); }
    friend string to_s(M r) { return to_s(r.val()); }
#endif
    friend ostream& operator<<(ostream& os, M r) { return os << r.val(); }
    friend istream& operator>>(istream& is, M &r) { i64 x; is >> x; r = x; return is; }
};

using mint = runtime_modint<-1>;

// <<<
using modP = runtime_modint<1>;
using modQ = runtime_modint<2>;

int32_t main() {
    int P, Q; cin >> P >> Q;
    modP::set_mod(P);
    modQ::set_mod(Q);
    modP x; cin >> x;
    modQ y; cin >> y;

    auto xx = x;
    auto yy = y;

    const int L = 1e5;
    string N(L, '0');
    N.front() = N.back() = '1';
    x -= modP(10).pow(L-1) + 1;
    y -= modQ(10).pow(L-1) + 1;

    y /= 10;
    string Y = to_string(y.val());
    reverse(all(Y));
    rep (i, Y.size()) {
        N[i+1] = Y[i];
        x -= (Y[i]-'0')*modP(10).pow((L-1)-(i+1));
    }

    for (int k = 1; ; k++) {
        string kQ = to_string(k*Q);
        reverse(all(kQ));
        int r = stoll(kQ);
        if (r % P == 0) continue;
        int pos = modP(10).log(x/r/10) + 1;
        pos = L - pos - sz(kQ);
        rep (i, kQ.size()) N[i+pos] = kQ[i];
        cout << N << '\n';
        break;
    }

    debug {
        modP X = 0;
        rep (i, N.size()) X = X*10 + (N[i]-'0');
        assert(X == xx);

        reverse(all(N));
        modQ Y = 0;
        rep (i, N.size()) Y = Y*10 +(N[i]-'0');
        assert(Y == yy);
    }


}
0