結果
| 問題 | No.2658 L-R Nim |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2024-03-01 23:44:09 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,126 ms / 7,000 ms |
| コード長 | 5,641 bytes |
| コンパイル時間 | 2,419 ms |
| コンパイル使用メモリ | 206,112 KB |
| 最終ジャッジ日時 | 2025-02-19 23:17:31 |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 5 |
| other | AC * 48 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}int pct(int x) { return __builtin_popcount(x); }int pct(ll x) { return __builtin_popcountll(x); }int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename T>void reorder(vector<T> &a, const vector<int> &ord) {int n = a.size();vector<T> b(n);for (int i = 0; i < n; i++) b[i] = a[ord[i]];swap(a, b);}template <typename T>T floor(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? x / y : (x - y + 1) / y);}template <typename T>T ceil(T x, T y) {assert(y != 0);if (y < 0) x = -x, y = -y;return (x >= 0 ? (x + y - 1) / y : x / y);}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);cerr << fixed << setprecision(15);}} io_setup;constexpr int inf = (1 << 30) - 1;constexpr ll INF = (1LL << 60) - 1;// constexpr int MOD = 1000000007;constexpr int MOD = 998244353;void solve() {int N, K;cin >> N >> K;vector<int> a(N);rep(i, N) cin >> a[i];vector<int> x(N + 1, 0);rep(i, N) x[i + 1] = x[i] ^ a[i];const int MAX = 1 << 20;vector<vector<int>> ids(MAX);rep(i, N + 1) ids[x[i]].eb(i);rep(i, MAX) {if (sz(ids[i]) >= 3) {cout << "No\n";return;}}int L = 0, R = N + 1; // [L, R]rep(i, MAX) {if (sz(ids[i]) == 2) {int l = ids[i][0];int r = ids[i][1];chmax(L, l + 1);chmin(R, r);}}if (L > R) {cout << "No\n";return;}if (L == 0) {cout << "Yes\n";return;}auto ENUM = [&](int x) {vector<int> v;rep2(y, x - K, x + K + 1) {if (y > 0) v.eb(x ^ y);}return v;};vector<int> v;rep2(i, L, R + 1) { each(e, ENUM(a[i - 1])) v.eb(e); }rearrange(v);int M = sz(v);vector<int> id(MAX, -1);rep(i, M) id[v[i]] = i;// print(x), print(v);// cerr << L MM R << endl;vector<int> ng(MAX, 0);rep(i, N + 1) {// ng.resize(10);// print(ng);if (L <= i && i <= R) {auto u = ENUM(a[i - 1]);each(e, u) {if (ng[e] == 0) {// cerr << i MM e << endl;cout << "Yes\n";return;}}}if (i < N + 1) {each(e, v) {int b = x[i] ^ e;each(j, ids[b]) {if (j < i) ng[e]--;if (i < j) ng[e]++;}}}}cout << "No\n";}int main() {int T = 1;// cin >> T;while (T--) solve();}