結果

問題 No.2658 L-R Nim
ユーザー hitonanodehitonanode
提出日時 2024-03-03 00:09:42
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,815 ms / 7,000 ms
コード長 7,886 bytes
コンパイル時間 1,981 ms
コンパイル使用メモリ 185,476 KB
実行使用メモリ 8,372 KB
最終ジャッジ日時 2024-09-29 16:31:13
合計ジャッジ時間 42,049 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
7,612 KB
testcase_01 AC 4 ms
7,272 KB
testcase_02 AC 4 ms
7,300 KB
testcase_03 AC 3 ms
7,300 KB
testcase_04 AC 3 ms
7,672 KB
testcase_05 AC 9 ms
7,740 KB
testcase_06 AC 236 ms
7,520 KB
testcase_07 AC 29 ms
7,564 KB
testcase_08 AC 17 ms
7,628 KB
testcase_09 AC 232 ms
7,520 KB
testcase_10 AC 227 ms
7,504 KB
testcase_11 AC 204 ms
7,788 KB
testcase_12 AC 231 ms
7,544 KB
testcase_13 AC 236 ms
7,464 KB
testcase_14 AC 223 ms
7,524 KB
testcase_15 AC 20 ms
7,720 KB
testcase_16 AC 221 ms
7,492 KB
testcase_17 AC 223 ms
7,616 KB
testcase_18 AC 225 ms
7,544 KB
testcase_19 AC 224 ms
7,496 KB
testcase_20 AC 170 ms
7,564 KB
testcase_21 AC 222 ms
7,432 KB
testcase_22 AC 222 ms
7,456 KB
testcase_23 AC 18 ms
7,764 KB
testcase_24 AC 110 ms
7,716 KB
testcase_25 AC 413 ms
8,368 KB
testcase_26 AC 411 ms
8,364 KB
testcase_27 AC 1,762 ms
8,364 KB
testcase_28 AC 388 ms
8,236 KB
testcase_29 AC 1,742 ms
8,368 KB
testcase_30 AC 429 ms
8,292 KB
testcase_31 AC 424 ms
8,368 KB
testcase_32 AC 1,772 ms
8,368 KB
testcase_33 AC 1,062 ms
7,964 KB
testcase_34 AC 1,698 ms
8,108 KB
testcase_35 AC 575 ms
7,728 KB
testcase_36 AC 1,764 ms
8,112 KB
testcase_37 AC 7 ms
8,064 KB
testcase_38 AC 1,815 ms
8,220 KB
testcase_39 AC 1,790 ms
8,120 KB
testcase_40 AC 1,745 ms
8,088 KB
testcase_41 AC 1,784 ms
8,108 KB
testcase_42 AC 1,809 ms
8,160 KB
testcase_43 AC 1,780 ms
8,116 KB
testcase_44 AC 1,790 ms
8,108 KB
testcase_45 AC 1,790 ms
8,112 KB
testcase_46 AC 1,805 ms
8,140 KB
testcase_47 AC 1,787 ms
8,156 KB
testcase_48 AC 677 ms
8,372 KB
testcase_49 AC 418 ms
8,244 KB
testcase_50 AC 410 ms
8,368 KB
testcase_51 AC 1,739 ms
8,112 KB
testcase_52 AC 1,802 ms
8,156 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 Yes() {
    puts("Yes");
    exit(0);
}

int main() {
    int N, K;
    cin >> N >> K;
    vector<int> A(N);
    cin >> A;

    vector<int> cnt(1 << 20);

    vector<int> hist;

    REP(dmasklo, 1 << 7) {
        REP(upper_diff_len, 14) {
            const int diff = (((1 << upper_diff_len) - 1) << 7) + dmasklo;

            int cs = 0;
            // unordered_map<int, int> cnt;
            int ndupe = 0;
            

            auto push = [&](int x) {
                cnt.at(x)++;
                ndupe += cnt.at(x) == 2;
                hist.push_back(x);
            };
            auto pop = [&](int x) {
                cnt.at(x)--;
                ndupe -= cnt.at(x) == 1;
            };

            auto pop_all = [&] {
                for (int x : hist) cnt.at(x) = 0;
                hist.clear();
            };

            push(0);

            for (int a : A) {
                cs ^= a;
                push(cs ^ diff);
            }

            cs = 0;
            for (auto a : A) {
                int after = a ^ diff;
                if (ndupe == 0 and 0 < after and abs(a - after) <= K) Yes();

                cs ^= a;
                pop(cs ^ diff);
                push(cs);
            }

            pop_all();
        }
    }

    puts("No");
}
0