#938831 (C++17) No.2589 Prepare Integers

提出ソース

結果

問題	No.2589 Prepare Integers
ユーザー	👑 Nachia
提出日時	2023-12-17 15:15:01
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	9,591 bytes
コンパイル時間	1,301 ms
コンパイル使用メモリ	117,992 KB
実行使用メモリ	6,676 KB
最終ジャッジ日時	2023-12-17 15:15:11
合計ジャッジ時間	5,384 ms
ジャッジサーバーID （参考情報）	judge14 / judge11

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,676 KB
testcase_01	AC	2 ms 6,676 KB
testcase_02	AC	2 ms 6,676 KB
testcase_03	AC	2 ms 6,676 KB
testcase_04	AC	1,953 ms 6,676 KB
testcase_05	AC	938 ms 6,676 KB
testcase_06	AC	553 ms 6,676 KB
testcase_07	AC	443 ms 6,676 KB
testcase_08	AC	125 ms 6,676 KB
testcase_09	AC	52 ms 6,676 KB
testcase_10	AC	66 ms 6,676 KB
testcase_11	AC	82 ms 6,676 KB
testcase_12	AC	669 ms 6,676 KB
testcase_13	AC	427 ms 6,676 KB
testcase_14	AC	404 ms 6,676 KB
testcase_15	AC	324 ms 6,676 KB
testcase_16	AC	314 ms 6,676 KB
testcase_17	AC	141 ms 6,676 KB
testcase_18	WA	-
testcase_19	AC	91 ms 6,676 KB
testcase_20	AC	54 ms 6,676 KB
testcase_21	WA	-
testcase_22	WA	-
testcase_23	AC	78 ms 6,676 KB
testcase_24	AC	85 ms 6,676 KB
testcase_25	AC	87 ms 6,676 KB
testcase_26	AC	82 ms 6,676 KB
testcase_27	AC	6 ms 6,676 KB

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

ソースコード

raw source code

#ifdef NACHIA
// #define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = priority_queue<A,vector<A>,greater<A>>;
using Modint = atcoder::static_modint<998244353>;

#include <iterator>
#include <functional>

template<class Elem> struct vec;

template<class Iter>
struct seq_view{
    using Ref = typename std::iterator_traits<Iter>::reference;
    using Elem = typename std::iterator_traits<Iter>::value_type;
    Iter a, b;
    Iter begin() const { return a; }
    Iter end() const { return b; }
    int size() const { return (int)(b-a); }
    seq_view(Iter first, Iter last) : a(first), b(last) {}
    seq_view sort() const { std::sort(a, b); return *this; }
    Ref& operator[](int x){ return *(a+x); }
    template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {
        ret x(size()); for(int i=0; i<size(); i++) x[i] = i;
        x().sort([&](int l, int r){ return f(a[l],a[r]); });
        return x;
    }
    template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }
    template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>
    ret rle(F eq = F()) const {
        auto x = ret();
        for(auto& a : (*this)){
            if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;
        } return x;
    }
    template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }
    Iter uni() const { return std::unique(a, b); }
    Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }
    Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }
    int lbi(const Elem& x) const { return lb(x) - a; }
    int ubi(const Elem& x) const { return ub(x) - a; }
    seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }
    template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }
    template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }
    template<class F> Iter when_true_to_false(F f) const {
        if(a == b) return a;
        return std::lower_bound(a, b, *a,
            [&](const Elem& x, const Elem&){ return f(x); });
    }
    seq_view same(Elem x) const { return { lb(x), ub(x) }; }
    template<class F> auto map(F f) const {
        vec<typename Iter::value_type> r;
        for(auto& x : *this) r.emp(f(x));
        return r;
    }
    Iter max() const { return std::max_element(a, b); }
    Iter min() const { return std::min_element(a, b); }
    template<class F = std::less<Elem>>
    Iter min(F f) const { return std::min_element(a, b, f); }
    seq_view rev() const { std::reverse(a, b); return *this; }
};

template<class Elem>
struct vec {
    using Base = typename std::vector<Elem>;
    using Iter = typename Base::iterator;
    using CIter = typename Base::const_iterator;
    using View = seq_view<Iter>;
    using CView = seq_view<CIter>;

    vec(){}
    explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}
    template <class I2> vec(I2 first, I2 last) : a(first, last) {}
    vec(std::initializer_list<Elem> il) : a(std::move(il)) {}
    vec(Base b) : a(std::move(b)) {}
    operator Base() const { return a; }

    Iter begin(){ return a.begin(); }
    CIter begin() const { return a.begin(); }
    Iter end(){ return a.end(); }
    CIter end() const { return a.end(); }
    int size() const { return a.size(); }
    bool empty() const { return a.empty(); }
    Elem& back(){ return a.back(); }
    const Elem& back() const { return a.back(); }
    vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }
    Iter operator()(int x){ return a.begin() + x; }
    CIter operator()(int x) const { return a.begin() + x; }
    View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }
    CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }
    View operator()(){ return (*this)(0,size()); }
    CView operator()() const { return (*this)(0,size()); }
    Elem& operator[](int x){ return a[x]; }
    const Elem& operator[](int x) const { return a[x]; }
    Base& operator*(){ return a; }
    const Base& operator*() const { return a; }
    vec& push(Elem args){
        a.push_back(std::move(args));
        return *this;
    }
    template<class... Args>
    vec& emp(Args &&... args){
        a.emplace_back(std::forward<Args>(args) ...);
        return *this;
    }
    template<class Range>
    vec& app(Range& x){ for(auto& v : a) emp(v); }
    Elem pop(){
        Elem x = std::move(a.back());
        a.pop_back(); return x;
    }
    bool operator==(const vec& r) const { return a == r.a; }
    bool operator!=(const vec& r) const { return a != r.a; }
    bool operator<(const vec& r) const { return a < r.a; }
    bool operator<=(const vec& r) const { return a <= r.a; }
    bool operator>(const vec& r) const { return a > r.a; }
    bool operator>=(const vec& r) const { return a >= r.a; }
    vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }
    template<class F> vec& filter(F f){
        int p = 0;
        for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);
        a.resize(p); return *this;
    }
private: Base a;
};

template<class IStr, class U, class T>
IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }
template<class IStr, class T>
IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }
template<class OStr, class T>
OStr& operator<<(OStr& os, const vec<T>& v){
    for(int i=0; i<v.size(); i++){
        if(i){ os << ' '; } os << v[i];
    } return os;
}

#include <cassert>
namespace nachia{

// ax + by = gcd(a,b)
// return ( x, - )
std::pair<long long, long long> ExtGcd(long long a, long long b){
    long long x = 1, y = 0;
    while(b){
        long long u = a / b;
        std::swap(a-=b*u, b);
        std::swap(x-=y*u, y);
    }
    return std::make_pair(x, a);
}

} // namespace nachia

void testcase(){
    i64 K, Q; cin >> K >> Q;
    i64 dim = 0, maxval = 1;
    while(maxval <= 2'000'000'000){ dim++; maxval *= K; }
    vec<vec<i64>> basis(dim);
    auto tsum = [K,dim](const vec<i64>& x, const vec<i64>& y, i64 a, i64 b){
        vec<i64> res(dim);
        rep(i,dim) res[i] = (x[i] * a + y[i] * b) % K;
        return res;
    };
    rep(d,dim){
        basis[d] = vec<i64>(dim);
        basis[d][d] = K;
    }
    auto query2 = [&](i64 x) -> i64 {
        vec<i64> count(dim+1, 1);
        rep(d,dim) count[d+1] = count[d] * (K / basis[d][d]);
        if(count[dim] <= x) return -1;
        vec<i64> res(dim);
        repr(d,dim){
            i64 f = x / count[d] - res[d] / basis[d][d];
            x %= count[d];
            if(f < 0) f += K;
            res = tsum(res, basis[d], 1, f);
        }
        i64 resi = 0;
        repr(d,dim) resi = resi * K + res[d];
        return resi;
    };
    auto query3 = [&](i64 x) -> i64 {
        if(x >= maxval){
            i64 c = 1;
            rep(d,dim) c *= K / basis[d][d];
            return c;
        }
        vec<i64> X(dim);
        rep(d,dim){ X[d] = x % K; x /= K; }
        vec<i64> just(dim);
        bool make_just = true;
        i64 ans = 0;
        repr(d,dim){
            i64 b = basis[d][d];
            ans *= K / b;
            if(make_just){
                ans += X[d] / b + 1 - (X[d] % b <= just[d] % b ? 1 : 0);
                i64 f = (X[d] - just[d] + K) % K / b;
                just = tsum(just, basis[d], 1, f);
                if(just[d] != X[d]) make_just = false;
            }
        }
        return ans;
    };
    while(Q--){
        i64 t, x; cin >> t >> x;
        if(t == 1){
            vec<i64> X(dim);
            rep(d,dim){ X[d] = x % K; x /= K; }
            repr(d,dim) if(X[d] != 0){
                auto [a,g] = nachia::ExtGcd(basis[d][d], X[d]);
                i64 b = (g - a * basis[d][d]) / X[d];
                if(a == 0){ swap(a,b); swap(basis[d], X); }
                if(a < 0) a += K;
                if(b < 0) b += K;
                basis[d] = tsum(basis[d], X, a, b);
                X = tsum(X, basis[d], K - 1, X[d] / basis[d][d]);
            }
        } else if(t == 2){
            i64 lb = -1, ub = 1001001001001001001;
            if(query3(ub) < x){ cout << "-1\n"; continue; }
            while(lb + 1 < ub){
                i64 m = lb + (ub - lb) / 2;
                if(query3(m+1) < x) lb = m; else ub = m;
            }
            cout << ub << '\n';
            // x--;
            // cout << query2(x) << '\n';
        } else {
            x++;
            cout << query3(x) << '\n';
        }
    //    {
    //        rep(d,dim){
    //            cout << "[ " << basis[d] << " ]" << endl;
    //        } cout << endl;
    //    }
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}

yukicoder

結果

テストケース

ソースコード