Submission #19362994 - AtCoder Beginner Contest 188

Contest Duration: 2021-01-10 21:00:00+0900 - 2021-01-10 22:40:00+0900 (local time) (100 minutes) Back to Home

Submission #19362994

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

/*  ----------------------- DEBUG FUNCTION ---------------------------- */
#define DUMPOUT cerr
void dump_function() { DUMPOUT << ' '; }
void dump_function(bool a) { DUMPOUT << a; }
void dump_function(int a) { DUMPOUT << a; }
void dump_function(long long a) { DUMPOUT << a; }
void dump_function(char a) { DUMPOUT << a; }
void dump_function(string &a) { DUMPOUT << a; }
void dump_function(double a) { DUMPOUT << a; }
template <class T> void dump_function(const vector<T> &);
template <class T, size_t size> void dump_function(const array<T, size> &);
template <class T, class L> void dump_function(const pair<T, L> &p);
template <class T, size_t size> void dump_function(const T (&)[size]);
template <class T> void dump_function(const vector<T> &a) {
    if(a.empty()) return;
    dump_function(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
    DUMPOUT << endl;
}
template <class T> void dump_function(const deque<T> &a) {
    if(a.empty()) return;
    dump_function(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template <class T, size_t size> void dump_function(const array<T, size> &a) {
    dump_function(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template <class T, class L> void dump_function(const pair<T, L> &p) {
    DUMPOUT << '(';
    dump_function(p.first);
    DUMPOUT << ",";
    dump_function(p.second);
    DUMPOUT << ')';
}
template <class T> void dump_function(set<T> &x) {
    for(auto e : x) dump_function(e), DUMPOUT << " ";
    DUMPOUT << endl;
}
template <class T> void dump_function(multiset<T> &x) {
    for(auto e : x) dump_function(e), DUMPOUT << " ";
    DUMPOUT << endl;
}
template <class T, size_t size> void dump_function(const T (&a)[size]) {
    dump_function(a[0]);
    for(auto i = a; ++i != end(a);) {
        DUMPOUT << " ";
        dump_function(*i);
    }
}
template <class T> void dump_function(const T &a) { DUMPOUT << a; }
int dump_out() {
    DUMPOUT << '\n';
    return 0;
}
template <class T> int dump_out(const T &t) {
    dump_function(t);
    DUMPOUT << '\n';
    return 0;
}
template <class Head, class... Tail> int dump_out(const Head &head, const Tail &... tail) {
    dump_function(head);
    DUMPOUT << ' ';
    dump_out(tail...);
    return 0;
}

#ifdef DEBUG_
#define dump(x)                                                                                                                                               \
    DUMPOUT << #x << ": ";                                                                                                                                        \
    dump_function(x);                                                                                                                                                  \
    DUMPOUT << endl;
void dumps() {}
template <class T> void dumps(const T &t) {
    dump_function(t);
    DUMPOUT << " ";
}
template <class Head, class... Tail> void dumps(const Head &head, const Tail &... tail) {
    dump_function(head);
    DUMPOUT << ' ';
    dump_out(tail...);
}
#else
#define dump(x)
template <class... T> void dumps(const T &...) {}
#endif
/*  ----------------------- DEBUG FUNCTION ---------------------------- */

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() const { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {
        is >> x.val;
        x.val %= MOD;
        if (x.val < 0) x.val += MOD;
        return is;
    }
    friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD>& r, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(r, n / 2);
        t = t * t;
        if (n & 1) t = t * r;
        return t;
    }
    friend constexpr Fp<MOD> modinv(const Fp<MOD>& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b, swap(a, b);
            u -= t * v, swap(u, v);
        }
        return Fp<MOD>(u);
    }
};


template<class T> struct BiCoef {
    vector<T> fact_, inv_, finv_;
    constexpr BiCoef() {}
    constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
        init(n);
    }
    constexpr void init(int n) noexcept {
        fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
        int MOD = fact_[0].getmod();
        for(int i = 2; i < n; i++){
            fact_[i] = fact_[i-1] * i;
            inv_[i] = -inv_[MOD%i] * (MOD/i);
            finv_[i] = finv_[i-1] * inv_[i];
        }
    }
    constexpr T com(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[k] * finv_[n-k];
    }
    constexpr T fact(int n) const noexcept {
        if (n < 0) return 0;
        return fact_[n];
    }
    constexpr T inv(int n) const noexcept {
        if (n < 0) return 0;
        return inv_[n];
    }
    constexpr T finv(int n) const noexcept {
        if (n < 0) return 0;
        return finv_[n];
    }
    constexpr T perm(int n, int k) const noexcept {
        if (n < k || n < 0 || k < 0) return 0;
        return fact_[n] * finv_[n-k];
    }
};

/* ----------------------------- MOD ----------------------------------- */
const int MOD = 1000000007;
const int MOD2 = 998244353;
using mint = Fp<MOD>;
BiCoef<mint> bc;
// using vec = vector<mint>;
// using mat = vector<vec>;
/* ----------------------------- MOD ----------------------------------- */

/*  ----------------------- AtCoder Library ---------------------------- */
// #include <atcoder/all>
// using namespace atcoder;
/*  ----------------------- AtCoder Library ---------------------------- */

void solve(){
    ll X, Y;
    cin >> X >> Y;
    ll ans = LINF;
    map<ll, ll> memo;
    priority_queue<LP, vector<LP>, greater<LP>> pq;
    pq.emplace(0, Y);
    ll cost[6] = {0};
    cost[2] = 1;
    while(!pq.empty()){
        auto [v, x] = pq.top(); pq.pop();

        if(v >= ans) continue;
        chmin(ans, v + abs(X-x));
        for(int d : {2}){
            int r = (x & 1);
            ll nv = v + r + 1;
            if(nv < ans && (!memo.count(x / d) || nv < memo[x/d])){
                pq.emplace(nv, x / d);
                memo[x / d] = nv;
            }
            nv = v + (d - r) + 1;
            if(nv < ans && (!memo.count(x / d + 1) || nv < memo[x/d + 1])){
                pq.emplace(nv, x / d + 1);
                memo[x / d + 1] = nv;
            }
        }
    }
    cout << ans << endl;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    // int T; cin >> T; REP(t,T) solve();
}

Submission Info

Submission Time	2021-01-11 00:55:23+0900
Task	F - +1-1x2
User	Bondo416
Language	C++ (GCC 9.2.1)
Score	600
Code Size	9158 Byte
Status	AC
Exec Time	6 ms
Memory	3652 KiB

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:244:8: warning: variable ‘cost’ set but not used [-Wunused-but-set-variable]
  244 |     ll cost[6] = {0};
      |        ^~~~

Judge Result

Set Name

Sample

All

after_contest

Score / Max Score

0 / 0

600 / 600

0 / 0

Status

× 3

× 49

× 1

Set Name	Test Cases
Sample	sample_01.txt, sample_02.txt, sample_03.txt
All	extreme_00.txt, extreme_01.txt, extreme_02.txt, extreme_03.txt, extreme_04.txt, handmade_00.txt, handmade_01.txt, handmade_02.txt, handmade_03.txt, handmade_04.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_exp_00.txt, random_exp_01.txt, random_exp_02.txt, random_exp_03.txt, random_exp_04.txt, random_exp_05.txt, random_exp_06.txt, random_exp_07.txt, random_exp_08.txt, random_exp_09.txt, random_exp_10.txt, random_exp_11.txt, random_exp_12.txt, random_exp_13.txt, random_exp_14.txt, random_exp_15.txt, random_small_00.txt, random_small_01.txt, random_small_02.txt, random_small_03.txt, random_small_04.txt, random_small_05.txt, random_small_06.txt, random_small_07.txt, random_small_08.txt, random_small_09.txt, sample_01.txt, sample_02.txt, sample_03.txt
after_contest	after_contest_01.txt

Case Name	Status	Exec Time	Memory
after_contest_01.txt	AC	6 ms	3636 KiB
extreme_00.txt	AC	2 ms	3632 KiB
extreme_01.txt	AC	2 ms	3620 KiB
extreme_02.txt	AC	2 ms	3588 KiB
extreme_03.txt	AC	2 ms	3516 KiB
extreme_04.txt	AC	2 ms	3652 KiB
handmade_00.txt	AC	3 ms	3580 KiB
handmade_01.txt	AC	2 ms	3596 KiB
handmade_02.txt	AC	2 ms	3540 KiB
handmade_03.txt	AC	2 ms	3592 KiB
handmade_04.txt	AC	2 ms	3576 KiB
random_00.txt	AC	2 ms	3636 KiB
random_01.txt	AC	2 ms	3516 KiB
random_02.txt	AC	2 ms	3588 KiB
random_03.txt	AC	2 ms	3608 KiB
random_04.txt	AC	5 ms	3636 KiB
random_05.txt	AC	2 ms	3556 KiB
random_06.txt	AC	2 ms	3552 KiB
random_07.txt	AC	2 ms	3516 KiB
random_08.txt	AC	2 ms	3548 KiB
random_09.txt	AC	2 ms	3584 KiB
random_exp_00.txt	AC	2 ms	3540 KiB
random_exp_01.txt	AC	2 ms	3624 KiB
random_exp_02.txt	AC	2 ms	3516 KiB
random_exp_03.txt	AC	2 ms	3544 KiB
random_exp_04.txt	AC	2 ms	3512 KiB
random_exp_05.txt	AC	2 ms	3600 KiB
random_exp_06.txt	AC	6 ms	3640 KiB
random_exp_07.txt	AC	2 ms	3492 KiB
random_exp_08.txt	AC	2 ms	3544 KiB
random_exp_09.txt	AC	2 ms	3636 KiB
random_exp_10.txt	AC	2 ms	3612 KiB
random_exp_11.txt	AC	5 ms	3488 KiB
random_exp_12.txt	AC	2 ms	3612 KiB
random_exp_13.txt	AC	2 ms	3544 KiB
random_exp_14.txt	AC	2 ms	3612 KiB
random_exp_15.txt	AC	4 ms	3624 KiB
random_small_00.txt	AC	2 ms	3504 KiB
random_small_01.txt	AC	2 ms	3508 KiB
random_small_02.txt	AC	2 ms	3548 KiB
random_small_03.txt	AC	2 ms	3624 KiB
random_small_04.txt	AC	2 ms	3540 KiB
random_small_05.txt	AC	2 ms	3608 KiB
random_small_06.txt	AC	2 ms	3596 KiB
random_small_07.txt	AC	2 ms	3600 KiB
random_small_08.txt	AC	2 ms	3448 KiB
random_small_09.txt	AC	2 ms	3592 KiB
sample_01.txt	AC	2 ms	3620 KiB
sample_02.txt	AC	3 ms	3536 KiB
sample_03.txt	AC	2 ms	3572 KiB