#829844 (C++23) No.2165 Let's Play Nim!

提出ソース

結果

問題	No.2165 Let's Play Nim!
ユーザー	hitonanode
提出日時	2023-01-02 16:11:20
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	198 ms / 2,000 ms
コード長	7,883 bytes
コンパイル時間	2,074 ms
コンパイル使用メモリ	178,372 KB
実行使用メモリ	25,452 KB
平均クエリ数	863.56
最終ジャッジ日時	2024-11-27 00:56:55
合計ジャッジ時間	16,815 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	25 ms 24,812 KB
testcase_01	AC	134 ms 24,796 KB
testcase_02	AC	143 ms 24,800 KB
testcase_03	AC	92 ms 25,196 KB
testcase_04	AC	24 ms 25,196 KB
testcase_05	AC	30 ms 25,196 KB
testcase_06	AC	30 ms 24,812 KB
testcase_07	AC	29 ms 25,196 KB
testcase_08	AC	97 ms 24,824 KB
testcase_09	AC	27 ms 25,208 KB
testcase_10	AC	33 ms 24,568 KB
testcase_11	AC	141 ms 24,940 KB
testcase_12	AC	122 ms 24,556 KB
testcase_13	AC	25 ms 24,556 KB
testcase_14	AC	28 ms 25,196 KB
testcase_15	AC	25 ms 24,940 KB
testcase_16	AC	118 ms 25,196 KB
testcase_17	AC	60 ms 24,556 KB
testcase_18	AC	198 ms 25,452 KB
testcase_19	AC	25 ms 24,824 KB
testcase_20	AC	28 ms 24,952 KB
testcase_21	AC	50 ms 24,580 KB
testcase_22	AC	42 ms 24,580 KB
testcase_23	AC	39 ms 24,580 KB
testcase_24	AC	37 ms 24,580 KB
testcase_25	AC	78 ms 24,580 KB
testcase_26	AC	142 ms 24,556 KB
testcase_27	AC	44 ms 25,196 KB
testcase_28	AC	66 ms 24,556 KB
testcase_29	AC	23 ms 25,196 KB
testcase_30	AC	23 ms 25,208 KB
testcase_31	AC	23 ms 24,812 KB
testcase_32	AC	93 ms 24,556 KB
evil_2_big_1.txt	AC	1,551 ms 24,544 KB
evil_2_big_2.txt	AC	1,783 ms 25,196 KB
evil_2_big_3.txt	AC	1,556 ms 25,196 KB
evil_big_1.txt	AC	1,737 ms 24,836 KB
evil_big_2.txt	AC	1,785 ms 25,460 KB
evil_big_3.txt	AC	1,804 ms 25,220 KB

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

ソースコード

raw source code

#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 <numeric>
#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, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
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


int main() {
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    int all_xor = 0;
    for (auto a : A) all_xor ^= a;

    constexpr int D = 18;
    vector<bitset<75000>> ons(D);

    auto set_i = [&](int i) {
        REP(d, D) ons.at(d)[i] = ((A.at(i) >> d) & 1);
    };
    REP(i, N) set_i(i);

    auto my_turn = [&]() -> int {
        int e = floor_lg(all_xor);
        int i = ons.at(e)._Find_first();
        int ainxt = all_xor ^ A.at(i);
        cout << i + 1 << ' ' << A.at(i) - ainxt << endl;
        A.at(i) = ainxt;
        set_i(i);
        all_xor = 0;

        int ret;
        cin >> ret;
        return ret;
    };

    auto com_turn = [&]() -> int {
        int i, k, ret;
        cin >> i >> k >> ret;
        --i;
        all_xor ^= A.at(i);
        A.at(i) -= k;
        all_xor ^= A.at(i);
        set_i(i);

        return ret;
    };

    cout << int(all_xor > 0) << endl;

    while (true) {
        if ((all_xor ? my_turn() : com_turn()) < 0) break;
    }
}

yukicoder

結果

テストケース

ソースコード