結果

問題 No.2658 L-R Nim
ユーザー ecotteaecottea
提出日時 2024-03-06 16:20:36
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,480 ms / 7,000 ms
コード長 7,990 bytes
コンパイル時間 5,335 ms
コンパイル使用メモリ 261,296 KB
実行使用メモリ 291,260 KB
最終ジャッジ日時 2025-01-03 14:22:18
合計ジャッジ時間 39,128 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 5
other AC * 48
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; using ull = unsigned long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0, set##_ub = 1 << int(d); set < set##_ub; ++set) // d
#define repis(i, set) for(int i = lsb(set), bset##i = set; i >= 0; bset##i -= 1 << i, i = lsb(bset##i)) // set
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll powi(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
bool naive(int n, int k, vi a) {
rep(i, n) {
repi(na, max(1, a[i] - k), a[i] + k) {
vi a2(a);
a2[i] = na;
vi acc(n + 1);
rep(i, n) acc[i + 1] = acc[i] ^ a2[i];
uniq(acc);
if (sz(acc) == n + 1) return true;
}
}
return false;
}
/*
* XOR Binary Trie
*
*
* AC
*
* a XOR (a+x) (x∈[-100..100])
*
* XOR [][]
*
*/
bool solve(int n, int k, vi a) {
int A = 1 << (msb(*max_element(all(a))) + 1);
vi acc(n + 1);
rep(i, n) acc[i + 1] = acc[i] ^ a[i];
dump("acc:", acc);
vi imos(n + 1); int v = 0;
vi l_min(A, -1);
repi(r, 0, n) {
int l = l_min[acc[r]];
if (l != -1) {
imos[l]++;
imos[r]--;
v++;
}
l_min[acc[r]] = r;
}
if (v == 0) return true;
rep(i, n) imos[i + 1] += imos[i];
dump("imos:", imos);
int L = INF, R = -INF;
rep(i, n) {
if (imos[i] == v) {
chmin(L, i);
chmax(R, i);
}
}
dump("L, R:", L, R);
if (L == INF) return false;
unordered_map<int, vi> fb;
repi(i, L, R) {
repi(x, max(a[i] - k, 1), a[i] + k) {
int y = a[i] ^ x;
if (!fb.count(y)) {
vi imos(n + 1);
vi l_min(A, -1);
repi(r, 0, n) {
if ((acc[r] ^ y) < A) {
int l = l_min[acc[r] ^ y];
if (l != -1) {
imos[l]++;
imos[r]--;
}
}
if (l_min[acc[r]] == -1) l_min[acc[r]] = r;
}
rep(i, n) imos[i + 1] += imos[i];
dump(y); dump(imos);
fb[y] = move(imos);
}
if (fb[y][i] == 0) return true;
}
}
return false;
}
void bug_find() {
#ifdef _MSC_VER
//
mute_dump = true;
mt19937_64 mt;
mt.seed((int)time(NULL));
uniform_int_distribution<ll> rnd(0LL, 1LL << 60);
rep(hoge, 10000) {
int n = rnd(mt) % 10 + 1;
int k = rnd(mt) % 10 + 1;
vi a(n);
rep(i, n) a[i] = rnd(mt) % 18 + 1;
auto res_naive = naive(n, k, a);
auto res_solve = solve(n, k, a);
if (res_naive != res_solve) {
cout << "----------error!----------" << endl;
cout << "input:" << endl;
cout << n << " " << k << endl;
cout << a << endl;
cout << "results:" << endl;
cout << res_naive << endl;
cout << res_solve << endl;
cout << "--------------------------" << endl;
}
}
mute_dump = false;
exit(0);
#endif
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
bug_find();
int n, k;
cin >> n >> k;
vi a(n);
rep(i, n) cin >> a[i];
Yes(solve(n, k, a));
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0