結果

問題 No.2521 Don't be Same
ユーザー hitonanodehitonanode
提出日時 2023-10-27 22:02:18
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 68 ms / 2,000 ms
コード長 8,186 bytes
コンパイル時間 1,918 ms
コンパイル使用メモリ 188,380 KB
実行使用メモリ 25,220 KB
平均クエリ数 10.00
最終ジャッジ日時 2024-09-25 14:09:00
合計ジャッジ時間 5,429 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 68 ms
25,196 KB
testcase_01 AC 66 ms
24,440 KB
testcase_02 AC 67 ms
24,824 KB
testcase_03 AC 66 ms
24,568 KB
testcase_04 AC 65 ms
24,440 KB
testcase_05 AC 67 ms
24,440 KB
testcase_06 AC 67 ms
24,580 KB
testcase_07 AC 66 ms
25,220 KB
testcase_08 AC 67 ms
24,452 KB
testcase_09 AC 67 ms
24,836 KB
testcase_10 AC 64 ms
24,440 KB
testcase_11 AC 66 ms
24,824 KB
testcase_12 AC 64 ms
24,824 KB
testcase_13 AC 65 ms
24,440 KB
testcase_14 AC 64 ms
25,208 KB
testcase_15 AC 64 ms
24,568 KB
testcase_16 AC 66 ms
25,220 KB
testcase_17 AC 65 ms
24,580 KB
testcase_18 AC 66 ms
24,836 KB
testcase_19 AC 65 ms
25,220 KB
testcase_20 AC 66 ms
24,568 KB
testcase_21 AC 66 ms
24,824 KB
testcase_22 AC 68 ms
25,196 KB
testcase_23 AC 65 ms
24,568 KB
testcase_24 AC 67 ms
24,824 KB
testcase_25 AC 66 ms
24,568 KB
testcase_26 AC 68 ms
25,208 KB
testcase_27 AC 67 ms
24,568 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

void expe() {
    const int n = 30;
    vector dp(n, vector<int>(n));
    REP(i, n) REP(j, n) {
        bool can_win = false;
        if (i and (i == j)) can_win = true;
        REP(ii, i) if (!dp.at(ii).at(j)) can_win = true;
        REP(jj, j) if (!dp.at(i).at(jj)) can_win = true;
        dp.at(i).at(j) = can_win;
    }
    for (auto v : dp) dbg(v);
}

int main() {
    expe();
    int X, Y;
    cin >> X >> Y;

    vector<int> V{X, Y};

    auto rd = [&]() {
        char c;
        cin >> c;
        if (c == 'C' or c == 'D') {
            exit(0);
        } else if (c == 'B') {
            V.at(0) = V.at(1) = 0;
        } else {
            assert(c == 'A');
            int i, x;
            cin >> i >> x;
            V.at(i - 1) -= x;
        }
    };

    if (abs(X - Y) == 1 and min(X, Y) % 2 == 1) {
        cout << "Second" << endl;
        rd();
    } else {
        cout << "First" << endl;
    }

    while (true) {
        if (V.at(0) == V.at(1)) {
            cout << "B" << endl;
            V.at(0) = V.at(1) = 0;
        } else {
            const int lo = min(V.at(0), V.at(1));
            const int hi = max(V.at(0), V.at(1));
            int hinxt;
            if (lo == 0) {
                hinxt = 0;
            } else if (lo % 2) {
                hinxt = lo + 1;
            } else {
                hinxt = lo - 1;
            }
            const int x = hi - hinxt;
            assert(x > 0);
            int i = (hi == V.at(0) ? 0 : 1);
            cout << "A " << i + 1 << ' ' << x << endl;
            V.at(i) -= x;
        }
        rd();
    }
}
0