結果
問題 | No.2658 L-R Nim |
ユーザー |
👑 |
提出日時 | 2024-03-01 23:49:36 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2,402 ms / 7,000 ms |
コード長 | 3,103 bytes |
コンパイル時間 | 1,470 ms |
コンパイル使用メモリ | 121,612 KB |
実行使用メモリ | 140,536 KB |
最終ジャッジ日時 | 2024-09-29 15:23:10 |
合計ジャッジ時間 | 52,939 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 48 |
ソースコード
#include <cassert> #include <cmath> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> #include <bitset> #include <complex> #include <deque> #include <functional> #include <iostream> #include <limits> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <sstream> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using Int = long long; template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; }; template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; } template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; } template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; } template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; } #define COLOR(s) ("\x1b[" s "m") constexpr int E = 20; int N, K; vector<int> A; bool solve() { vector<int> ASum(N + 1, 0); for (int i = 0; i < N; ++i) { ASum[i + 1] = ASum[i] ^ A[i]; } int l = 0, r = N; vector<int> app(1 << E, -1); for (int j = 0; j <= N; ++j) { int &i = app[ASum[j]]; if (~i) { chmax(l, i); chmin(r, j); } i = j; } cerr<<"l = "<<l<<", r = "<<r<<endl; if (l >= r) { return false; } vector<pair<int, int>> ps; for (int i = l; i < r; ++i) { for (int k = 0; k <= K; ++k) { ps.emplace_back(A[i] ^ (A[i] + k), i); } for (int k = 0; k <= min(K, A[i] - 1); ++k) { ps.emplace_back(A[i] ^ (A[i] - k), i); } } sort(ps.begin(), ps.end()); const int psLen = ps.size(); vector<int> freq(1 << E, 0); for (int i = 0; i <= l; ++i) { ++freq[ASum[i]]; } vector<int> can(N, 0); for (int k0 = 0, k1; k0 < psLen; k0 = k1) { for (k1 = k0; k1 < psLen && ps[k0].first == ps[k1].first; ++k1) {} const int b = ps[k0].first; for (int k = k0; k < k1; ++k) can[ps[k].second] = 1; // cerr<<"b = "<<b<<", can = "<<can<<", freq = "<<freq<<endl; int bad = 0; for (int i = l + 1; i <= N; ++i) { if (++freq[ASum[i] ^ b] == 2) ++bad; } for (int i = l; i < r; ++i) { if (can[i] && bad == 0) { // cerr<<"found i = "<<i<<", freq = "<<freq<<endl; return true; } if (freq[ASum[i + 1] ^ b]-- == 2) --bad; if (++freq[ASum[i + 1]] == 2) ++bad; } for (int i = l + 1; i <= r; ++i) --freq[ASum[i]]; for (int i = r + 1; i <= N; ++i) --freq[ASum[i] ^ b]; for (int k = k0; k < k1; ++k) can[ps[k].second] = 0; } return false; } int main() { for (; ~scanf("%d%d", &N, &K); ) { A.resize(N); for (int i = 0; i < N; ++i) { scanf("%d", &A[i]); } const bool ans = solve(); puts(ans ? "Yes" : "No"); } return 0; }