結果

問題 No.2658 L-R Nim
ユーザー dyktr_06dyktr_06
提出日時 2024-03-02 00:43:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,638 ms / 7,000 ms
コード長 5,601 bytes
コンパイル時間 2,658 ms
コンパイル使用メモリ 219,104 KB
実行使用メモリ 139,784 KB
最終ジャッジ日時 2024-09-29 15:44:09
合計ジャッジ時間 38,704 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
18,888 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 6 ms
18,832 KB
testcase_03 AC 2 ms
6,820 KB
testcase_04 AC 2 ms
6,820 KB
testcase_05 AC 101 ms
24,800 KB
testcase_06 AC 8 ms
6,816 KB
testcase_07 AC 62 ms
19,568 KB
testcase_08 AC 133 ms
27,520 KB
testcase_09 AC 81 ms
21,228 KB
testcase_10 AC 7 ms
6,816 KB
testcase_11 AC 96 ms
21,440 KB
testcase_12 AC 8 ms
6,820 KB
testcase_13 AC 8 ms
6,816 KB
testcase_14 AC 8 ms
6,820 KB
testcase_15 AC 117 ms
25,204 KB
testcase_16 AC 8 ms
6,820 KB
testcase_17 AC 63 ms
19,688 KB
testcase_18 AC 53 ms
19,644 KB
testcase_19 AC 8 ms
6,820 KB
testcase_20 AC 95 ms
23,376 KB
testcase_21 AC 8 ms
6,816 KB
testcase_22 AC 8 ms
6,816 KB
testcase_23 AC 60 ms
19,908 KB
testcase_24 AC 71 ms
20,716 KB
testcase_25 AC 1,611 ms
138,208 KB
testcase_26 AC 1,347 ms
138,092 KB
testcase_27 AC 1,396 ms
138,112 KB
testcase_28 AC 1,335 ms
138,276 KB
testcase_29 AC 1,500 ms
138,180 KB
testcase_30 AC 1,323 ms
138,108 KB
testcase_31 AC 1,382 ms
138,096 KB
testcase_32 AC 1,333 ms
138,088 KB
testcase_33 AC 17 ms
6,820 KB
testcase_34 AC 153 ms
21,168 KB
testcase_35 AC 568 ms
72,856 KB
testcase_36 AC 347 ms
22,608 KB
testcase_37 AC 38 ms
6,820 KB
testcase_38 AC 1,342 ms
138,180 KB
testcase_39 AC 1,457 ms
138,160 KB
testcase_40 AC 1,353 ms
138,184 KB
testcase_41 AC 1,384 ms
138,252 KB
testcase_42 AC 1,376 ms
138,184 KB
testcase_43 AC 1,339 ms
138,188 KB
testcase_44 AC 1,510 ms
139,784 KB
testcase_45 AC 1,482 ms
138,676 KB
testcase_46 AC 1,638 ms
138,228 KB
testcase_47 AC 1,442 ms
138,420 KB
testcase_48 AC 241 ms
22,748 KB
testcase_49 AC 1,400 ms
138,420 KB
testcase_50 AC 1,528 ms
138,548 KB
testcase_51 AC 1,386 ms
138,148 KB
testcase_52 AC 1,461 ms
138,244 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
 
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

ll n, k;
vll a;

void input(){
    in(n, k);
    vin(a, n);
}

void solve(){
    vll s(n + 1);
    rep(i, n) s[i + 1] = s[i] ^ a[i];

    ll l = -1, r = n + 1;
    {
        map<ll, ll> cnt;
        rep(i, n + 1){
            cnt[s[i]]++;
            if(cnt[s[i]] >= 3){
                out("No");
                return;
            }
        }
        rep(i, n + 1) cnt[s[i]] = -1;
        rep(i, n + 1){
            if(cnt[s[i]] != -1){
                chmax(l, cnt[s[i]]);
                chmin(r, (ll) i);
            }
            cnt[s[i]] = i;
        }
    }
    if(l > r){
        out("No");
        return;
    }
    if(l == -1){
        out("Yes");
        return;
    }

    string ans = "No";
    vll b;
    rep(j, l, r){
        ll tmp = a[j];
        rep(i, max(0LL, tmp - k), tmp + k + 1){
            b.push_back(i ^ tmp);
        }
    }
    Sort(b);
    UNIQUE(b);
    vll cnt(2002000, -1);
    for(auto x : b){
        vll imos(n + 1);
        rep(i, n + 1){
            if(cnt[s[i] ^ x] != -1){
                imos[cnt[s[i] ^ x]]++;
                imos[i]--;
            }
            if(cnt[s[i]] == -1){
            	cnt[s[i]] = i;
            }
        }
        rep(i, n + 1) cnt[s[i]] = -1;
        rep(i, n){
            imos[i + 1] += imos[i];
        }
        rep(i, l, r){
            if(imos[i] == 0 && abs(a[i] - (a[i] ^ x)) <= k){
                ans = "Yes";
            }
        }
    }
    out(ans);
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    
    input();
    solve();
}
0