#957038 (C++17) No.2658 L-R Nim

提出ソース

結果

問題	No.2658 L-R Nim
ユーザー	dyktr_06
提出日時	2024-03-01 23:52:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,638 bytes
コンパイル時間	2,323 ms
コンパイル使用メモリ	214,920 KB
実行使用メモリ	22,940 KB
最終ジャッジ日時	2024-09-29 15:29:37
合計ジャッジ時間	149,183 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 18,868 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	6 ms 18,952 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	12 ms 19,596 KB
testcase_06	AC	8 ms 6,816 KB
testcase_07	AC	14 ms 19,572 KB
testcase_08	WA	-
testcase_09	AC	3,912 ms 19,588 KB
testcase_10	AC	7 ms 6,816 KB
testcase_11	AC	167 ms 19,668 KB
testcase_12	AC	7 ms 6,820 KB
testcase_13	AC	7 ms 6,816 KB
testcase_14	AC	7 ms 6,820 KB
testcase_15	WA	-
testcase_16	AC	7 ms 6,820 KB
testcase_17	AC	720 ms 19,652 KB
testcase_18	AC	268 ms 19,624 KB
testcase_19	AC	7 ms 6,820 KB
testcase_20	AC	24 ms 19,588 KB
testcase_21	AC	7 ms 6,816 KB
testcase_22	AC	7 ms 6,816 KB
testcase_23	AC	16 ms 19,436 KB
testcase_24	AC	38 ms 19,644 KB
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	5,230 ms 22,724 KB
testcase_30	AC	897 ms 22,092 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	AC	17 ms 6,816 KB
testcase_34	AC	86 ms 21,320 KB
testcase_35	AC	6,031 ms 21,584 KB
testcase_36	AC	461 ms 22,900 KB
testcase_37	AC	35 ms 6,820 KB
testcase_38	AC	6,043 ms 22,884 KB
testcase_39	AC	6,052 ms 22,788 KB
testcase_40	AC	6,048 ms 22,796 KB
testcase_41	AC	6,057 ms 22,904 KB
testcase_42	AC	6,048 ms 22,888 KB
testcase_43	AC	6,053 ms 22,892 KB
testcase_44	AC	6,040 ms 22,896 KB
testcase_45	AC	6,039 ms 22,864 KB
testcase_46	AC	6,050 ms 22,004 KB
testcase_47	AC	6,051 ms 22,940 KB
testcase_48	AC	60 ms 22,788 KB
testcase_49	AC	65 ms 22,788 KB
testcase_50	WA	-
testcase_51	AC	6,049 ms 22,928 KB
testcase_52	AC	6,044 ms 22,908 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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(){
    ll ti = clock();

    ll l = -1, r = n + 1;
    {
        vll s(n + 1);
        rep(i, n) s[i + 1] = s[i] ^ a[i];
        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;
    }

    vll cnt(2001000);
    auto check = [&](){
        vll s(n + 1);
        rep(i, n){
            s[i + 1] = s[i] ^ a[i];
        }
        rep(i, n + 1){
            if(cnt[s[i]]){
                rep(j, i){
                    cnt[s[j]]--;
                }
                return false;
            }
            cnt[s[i]]++;
        }
        rep(i, n + 1) cnt[s[i]]--;
        return true;
    };

    string ans = "No";
    rep(j, l, r){
        if(clock() - ti >= 600 * CLOCKS_PER_SEC / 100){
            break;
        }
        ll tmp = a[j];
        rep(i, max(0LL, tmp - k), tmp + k + 1){
            a[j] = i;
            if(check()){
                out("Yes");
                return;
            }
        }
        a[j] = tmp;
    }
    out("No");
}

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

yukicoder

結果

テストケース

ソースコード