#526157 (C++17) No.1152 10億ゲーム

提出ソース

結果

問題	No.1152 10億ゲーム
ユーザー	noimi
提出日時	2020-08-07 22:37:36
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	RE
実行時間	-
コード長	13,598 bytes
コンパイル時間	2,907 ms
コンパイル使用メモリ	227,816 KB
実行使用メモリ	25,220 KB
平均クエリ数	23.10
最終ジャッジ日時	2024-07-17 04:57:02
合計ジャッジ時間	10,544 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	82 ms 24,964 KB
testcase_01	AC	79 ms 24,836 KB
testcase_02	AC	82 ms 24,836 KB
testcase_03	AC	82 ms 24,836 KB
testcase_04	AC	81 ms 25,220 KB
testcase_05	AC	81 ms 24,836 KB
testcase_06	AC	81 ms 24,580 KB
testcase_07	AC	82 ms 25,220 KB
testcase_08	AC	80 ms 24,836 KB
testcase_09	AC	81 ms 24,836 KB
testcase_10	AC	81 ms 24,836 KB
testcase_11	AC	81 ms 24,836 KB
testcase_12	AC	82 ms 24,836 KB
testcase_13	AC	81 ms 25,220 KB
testcase_14	AC	82 ms 24,964 KB
testcase_15	AC	81 ms 25,220 KB
testcase_16	AC	79 ms 24,580 KB
testcase_17	AC	82 ms 24,580 KB
testcase_18	AC	81 ms 25,220 KB
testcase_19	AC	81 ms 24,452 KB
testcase_20	AC	80 ms 24,836 KB
testcase_21	AC	79 ms 24,580 KB
testcase_22	AC	79 ms 24,964 KB
testcase_23	AC	80 ms 25,220 KB
testcase_24	AC	81 ms 24,580 KB
testcase_25	AC	81 ms 25,220 KB
testcase_26	RE	-
testcase_27	RE	-
testcase_28	AC	82 ms 24,964 KB
testcase_29	AC	81 ms 25,220 KB
testcase_30	AC	80 ms 24,964 KB
testcase_31	AC	85 ms 25,220 KB
testcase_32	AC	81 ms 25,220 KB
testcase_33	AC	83 ms 25,220 KB
testcase_34	AC	81 ms 24,964 KB
testcase_35	AC	81 ms 25,220 KB
testcase_36	RE	-
testcase_37	RE	-
testcase_38	AC	79 ms 24,836 KB
testcase_39	AC	80 ms 24,964 KB
testcase_40	AC	80 ms 24,964 KB
testcase_41	AC	80 ms 25,220 KB
testcase_42	AC	80 ms 25,076 KB
testcase_43	AC	81 ms 24,836 KB
testcase_44	AC	80 ms 25,220 KB
testcase_45	AC	81 ms 24,836 KB
testcase_46	AC	80 ms 25,220 KB
testcase_47	AC	80 ms 24,580 KB
testcase_48	AC	79 ms 24,964 KB
testcase_49	AC	80 ms 24,580 KB

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

コンパイルメッセージ

main.cpp:342:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  342 | main() {
      | ^~~~

ソースコード

raw source code

#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i, a, b) for(ll i = a; i <= b; ++i)
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define rep3(i, a, b) for(ll i = a; i >= b; --i)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                                                                                                  \
    vector<type> name(size);                                                                                                                                   \
    IN(name)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                                                                                                   \
    vector<vector<type>> name(h, vector<type>(w));                                                                                                             \
    IN(name)
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define fi first
#define se second
#define all(c) begin(c), end(c)
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
using namespace std;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define Size(c) (int)(c).size()
#define INT(...)                                                                                                                                               \
    int __VA_ARGS__;                                                                                                                                           \
    IN(__VA_ARGS__)
#define LL(...)                                                                                                                                                \
    ll __VA_ARGS__;                                                                                                                                            \
    IN(__VA_ARGS__)
#define ULL(...)                                                                                                                                               \
    ull __VA_ARGS__;                                                                                                                                           \
    IN(__VA_ARGS__)
#define STR(...)                                                                                                                                               \
    string __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
#define CHR(...)                                                                                                                                               \
    char __VA_ARGS__;                                                                                                                                          \
    IN(__VA_ARGS__)
#define DBL(...)                                                                                                                                               \
    double __VA_ARGS__;                                                                                                                                        \
    IN(__VA_ARGS__)
#define LD(...)                                                                                                                                                \
    ld __VA_ARGS__;                                                                                                                                            \
    IN(__VA_ARGS__)
int scan() { return getchar(); }
template <class T> void scan(T a) { cin >> a; }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
    for(auto &i : a) scan(i);
}
template <class T> void scan(deque<T> &a) {
    for(auto &i : a) scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
    for(auto &i : a) scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
    scan(p.first);
    scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
    for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &... tail) {
    scan(head);
    IN(tail...);
}
string stin() {
    string s;
    cin >> s;
    return s;
}
template <class T, class S> inline bool chmax(T &a, S b) {

    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T, class S> inline bool chmin(T &a, S b) {

    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}
vi iota(int n) {
    vi a(n);
    iota(all(a), 0);
    return a;
}
template <class T> void UNIQUE(vector<T> &x) {
    sort(all(x));
    x.erase(unique(all(x)), x.end());
}
int in() {
    int x;
    cin >> x;
    return x;
}
ll lin() {
    unsigned long long x;
    cin >> x;
    return x;
}
void print() { putchar(' '); }
void print(bool a) { cout << a; }
void print(int a) { cout << a; }
void print(long long a) { cout << a; }
void print(char a) { cout << a; }
void print(string &a) { cout << a; }
void print(double a) { cout << a; }
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {

    if(a.empty()) return;
    print(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        cout << " ";
        print(*i);
    }
    cout << endl;
}
template <class T> void print(const deque<T> &a) {

    if(a.empty()) return;
    print(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        cout << " ";
        print(*i);
    }
}
template <class T, size_t size> void print(const array<T, size> &a) {
    print(a[0]);
    for(auto i = a.begin(); ++i != a.end();) {
        cout << " ";
        print(*i);
    }
}
template <class T, class L> void print(const pair<T, L> &p) {
    cout << '(';
    print(p.first);
    cout << ",";
    print(p.second);
    cout << ')';
}
template <class T> void print(set<T> &x) {
    for(auto e : x) print(e), cout << " ";
    cout << endl;
}
template <class T> void print(multiset<T> &x) {
    for(auto e : x) print(e), cout << " ";
    cout << endl;
}
template <class T, size_t size> void print(const T (&a)[size]) {
    print(a[0]);
    for(auto i = a; ++i != end(a);) {
        cout << " ";
        print(*i);
    }
}
template <class T> void print(const T &a) { cout << a; }
int out() {
    putchar('\n');
    return 0;
}
template <class T> int out(const T &t) {
    print(t);
    putchar('\n');
    return 0;
}
template <class Head, class... Tail> int out(const Head &head, const Tail &... tail) {
    print(head);
    putchar(' ');
    out(tail...);
    return 0;
}
ll gcd(ll a, ll b) {
    while(b) {
        ll c = b;
        b = a % b;
        a = c;
    }
    return a;
}
ll lcm(ll a, ll b) {

    if(!a || !b) return 0;
    return a * b / gcd(a, b);
}
vector<pll> factor(ll x) {
    vector<pll> ans;
    for(ll i = 2; i * i <= x; i++)

        if(x % i == 0) {
            ans.push_back({i, 1});
            while((x /= i) % i == 0) ans.back().second++;
        }

    if(x != 1) ans.push_back({x, 1});
    return ans;
}
template <class T> vector<T> divisor(T x) {
    vector<T> ans;
    for(T i = 1; i * i <= x; i++)

        if(x % i == 0) {
            ans.pb(i);

            if(i * i != x) ans.pb(x / i);
        }
    return ans;
}
template <typename T> void zip(vector<T> &x) {
    vector<T> y = x;
    sort(all(y));
    for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }
}
int popcount(ll x) { return __builtin_popcountll(x); }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int n) { return uniform_int_distribution<int>(0, n - 1)(rng); }
template <typename T> void shuffle(vector<T> &v) {
    rep3(i, v.size() - 1, 1) { swap(v[i], v[rnd(i)]); }
}
#define endl '\n'
vector<string> YES{"NO", "YES"};
vector<string> Yes{"No", "Yes"};
vector<string> yes{"no", "yes"};

#ifdef _LOCAL
#undef endl
#define debug(x)                                                                                                                                               \
    cout << #x << ": ";                                                                                                                                        \
    print(x);                                                                                                                                                  \
    cout << endl;
void err() {}
template <class T> void err(const T &t) {
    print(t);
    cout << " ";
}
template <class Head, class... Tail> void err(const Head &head, const Tail &... tail) {
    print(head);
    putchar(' ');
    out(tail...);
}
#else
#define debug(x)
template <class... T> void err(const T &...) {}
#endif

template <typename T> struct edge {
    int from, to;
    T cost;
    int id;
    edge(int to, T cost) : from(-1), to(to), cost(cost) {}
    edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}
    edge(int from, int to, T cost, int id) : from(from), to(to), cost(cost), id(id) {}
    edge &operator=(const int &x) {
        to = x;
        return *this;
    }
    operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;

struct Graph : vector<vector<int>> {
    using vector<vector<int>>::vector;
    Graph(int n, int m) : vector(n) { read(m); }
    inline void add(int a, int b, bool directed = false) {
        (*this)[a].emplace_back(b);

        if(!directed) (*this)[b].emplace_back(a);
    }
    void read(int n = -1, int offset = 1, bool directed = false) {

        if(n == -1) n = this->size() - 1;
        int a, b;
        while(n--) {
            cin >> a >> b;
            Graph::add(a - offset, b - offset, directed);
        }
    }
};
template <typename T> struct WeightedGraph : vector<Edges<T>> {
    using vector<Edges<T>>::vector;
    inline void add(int a, int b, T c, bool directed = false) {
        (*this)[a].emplace_back(b, c);

        if(!directed) (*this)[b].emplace_back(a, c);
    }
    void read(int n = -1, int offset = 1) {

        if(n == -1) n = this->size() - 1;
        int a, b;
        T c;
        while(n--) {
            cin >> a >> b >> c;
            WeightedGraph::add(a - offset, b - offset, c);
        }
    }
};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(15);
    }
} setup_io;
#pragma endregion

// _________コーディングはここから！！___________

main() {
    INT(x1, x2);
    const int N = 9;
    auto f = [](int x) {
        int a = __builtin_ctz(x);
        int b = 0;
        while(x % 5 == 0) x /= 5, b++;
        return pii(a, b);
    };
    int a1, a2, b1, b2;
    tie(a1, b1) = f(x1);
    tie(a2, b2) = f(x2);
    auto g = [](int x, int y) {
        int r = 1;
        rep(_, y) r *= 5;
        return r << x;
    };
    int cnt = 0;
    auto ask = [&] {
        cnt++;
        assert(cnt < N * 4);
        cout << g(a1, b1) << endl;
        cout.flush();
        if(tie(a1, b1) == tie(a2, b2)) exit(0);
        tie(a2, b2) = f(in());
        if(tie(a1, b1) == tie(a2, b2)) exit(0);
    };
    int d[4] = {0, 1, 0, -1};
    auto ins = [](int x, int y) { return 0 <= x and x <= N and 0 <= y and y <= N; };
    while(1) {
        if(abs(a2 - a1) + abs(b2 - b1) == 1 or ((b1 == N and b2 == N) and (a1 == N - 2 and a2 == N))) {
            a1 = a2, b1 = b2;
            ask();
        } else if(~(a1 + a2 + b1 + b2) & 1) {
            if(b1 < N)
                b1++;
            else if(a1 < N - 2)
                a1++;
            else if(a1 == N - 2) {
                a1 += 2;
            } else
                a1--;
            ask();
        } else {
            if(abs(a1 - a2) > 1) {
                if(a1 > a2)
                    a1--;
                else
                    a1++;
            } else if(abs(b1 - b2) > 1) {
                if(b1 > b2)
                    b1--;
                else
                    b1++;
            } else if(abs(a1 - a2)) {
                if(a1 > a2)
                    a1--;
                else
                    a1++;
            } else if(b1 > b2)
                b1--;
            else
                b1++;
            ask();
        }
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード