Submission #66387058

---

Source Code Expand

#include <bits/stdc++.h>

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(i, n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i, s, n, d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep1(i, n) for (ll i = ll(n)-1; i >= 0; i--)
#define rrep2(i, n, t) for (ll i = ll(n)-1; i >= (ll)t; i--)
#define rrep3(i, n, t, d) for (ll i = ll(n)-1; i >= (ll)t; i-=d)
#define rrep(...) overload4(__VA_ARGS__,rrep3,rrep2,rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define SUM(a) accumulate(all(a),0LL)
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SORT(a) sort(all(a));
#define REV(a) reverse(all(a));
#define SZ(a) int(a.size())
#define ppc(x) popcount((unsigned long long) x)
#define pf push_front
#define pb push_back
#define ef emplace_front
#define eb emplace_back
#define ppf pop_front
#define ppb pop_back
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); cout << flush; }
#else
#define debug(...) void(0);
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vp = vector<P>;
using vvp = vector<vp>;
using vlp = vector<LP>;
using vvlp = vector<vlp>;
template<class T>
using PQ = priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>>;

template<class S, class T>
istream &operator>>(istream &is, pair<S, T> &p) { return is >> p.first >> p.second; }

template<class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << '{' << p.first << ", " << p.second << '}'; }

template<class S, class T, class U>
istream &operator>>(istream &is, tuple<S, T, U> &t) { return is >> get<0>(t) >> get<1>(t) >> get<2>(t); }

template<class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
    return os << '{' << get<0>(t) << ", " << get<1>(t) << ", " << get<2>(t) << '}';
}

template<class T>
istream &operator>>(istream &is, vector<T> &v) {
    for (T &t: v) { is >> t; }
    return is;
}

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '[';
    rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", ");
    return os << ']';
}

template<class T>
ostream &operator<<(ostream &os, const deque<T> &v) {
    os << '[';
    rep(i, v.size()) os << v[i] << (i == int(v.size() - 1) ? "" : ", ");
    return os << ']';
}

template<class T>
ostream &operator<<(ostream &os, const set<T> &st) {
    os << '{';
    auto it = st.begin();
    while (it != st.end()) {
        os << (it == st.begin() ? "" : ", ") << *it;
        it++;
    }
    return os << '}';
}

template<class T>
ostream &operator<<(ostream &os, const multiset<T> &st) {
    os << '{';
    auto it = st.begin();
    while (it != st.end()) {
        os << (it == st.begin() ? "" : ", ") << *it;
        it++;
    }
    return os << '}';
}

template<class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
    os << '{';
    auto it = mp.begin();
    while (it != mp.end()) {
        os << (it == mp.begin() ? "" : ", ") << *it;
        it++;
    }
    return os << '}';
}

template<class T>
void vecout(const vector<T> &v, char div = '\n') {
    rep(i, v.size()) cout << v[i] << (i == int(v.size() - 1) ? '\n' : div);
}

template<class T>
bool constexpr chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool constexpr chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

void scan() {}

template<class Head, class... Tail>
void scan(Head &head, Tail &... tail) {
    cin >> head;
    scan(tail...);
}

template<class T>
void print(const T &t) { cout << t << '\n'; }

template<class Head, class... Tail>
void print(const Head &head, const Tail &... tail) {
    cout << head << ' ';
    print(tail...);
}

template<class T>
vector<T> &operator+=(vector<T> &v, T x) {
    for (T &t: v) t += x;
    return v;
}

template<class T>
vector<T> &operator-=(vector<T> &v, T x) {
    for (T &t: v) t -= x;
    return v;
}

template<class T>
vector<T> &operator*=(vector<T> &v, T x) {
    for (T &t: v) t *= x;
    return v;
}

template<class T>
vector<T> &operator/=(vector<T> &v, T x) {
    for (T &t: v) t /= x;
    return v;
}

struct Init_io {
    Init_io() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout.tie(nullptr);
        cout << boolalpha << fixed << setprecision(15);
        cerr << boolalpha << fixed << setprecision(15);
    }
} init_io;

const string yes[] = {"no", "yes"};
const string Yes[] = {"No", "Yes"};
const string YES[] = {"NO", "YES"};
const int inf = 1001001001;
const ll linf = 1001001001001001001;

void rearrange(const vi &) {}

template<class T, class... Tail>
void rearrange(const vi &ord, vector<T> &head, Tail &...tail) {
    assert(ord.size() == head.size());
    vector<T> ori = head;
    rep(i, ord.size()) head[i] = ori[ord[i]];
    rearrange(ord, tail...);
}

template<class T, class... Tail>
void sort_by(vector<T> &head, Tail &... tail) {
    vi ord(head.size());
    iota(all(ord), 0);
    sort(all(ord), [&](int i, int j) { return head[i] < head[j]; });
    rearrange(ord, head, tail...);
}

bool in_rect(int i, int j, int h, int w) {
    return 0 <= i and i < h and 0 <= j and j < w;
}

// integer division (ref: https://nyaannyaan.github.io/library/misc/int_div.hpp)
// a/b 以下の最大の整数
ll int_floor(ll a, ll b) {
    assert(b != 0);
    if (b < 0) a = -a, b = -b;
    return a / b - (a % b < 0);
}

// a/b 未満の最大の整数
ll int_under(ll a, ll b) {
    assert(b != 0);
    if (b < 0) a = -a, b = -b;
    return a / b - (a % b <= 0);
}

// a/b 以上の最小の整数
ll int_ceil(ll a, ll b) {
    assert(b != 0);
    if (b < 0) a = -a, b = -b;
    return a / b + (a % b > 0);
}

// a/b 超過の最小の整数
ll int_over(ll a, ll b) {
    assert(b != 0);
    if (b < 0) a = -a, b = -b;
    return a / b + (a % b >= 0);
}

// a mod b (b > 0)
ll int_mod(ll a, ll b) {
    assert(b >= 0);
    long long c = a % b;
    return c < 0 ? c + b : c;
}

template<class T, class S>
vector<T> cumsum(const vector<S> &v, bool shift_one = true) {
    int n = v.size();
    vector<T> res;
    if (shift_one) {
        res.resize(n + 1);
        rep(i, n) res[i + 1] = res[i] + v[i];
    } else {
        res.resize(n);
        if (n) {
            res[0] = v[0];
            rep(i, 1, n) res[i] = res[i - 1] + v[i];
        }
    }
    return res;
}

vvi graph(int n, int m, bool directed = false, int origin = 1) {
    vvi G(n);
    rep(_, m) {
        INT(u, v);
        u -= origin, v -= origin;
        G[u].pb(v);
        if (!directed) G[v].pb(u);
    }
    return G;
}

template<class T>
vector<vector<pair<int, T>>> weighted_graph(int n, int m, bool directed = false, int origin = 1) {
    vector<vector<pair<int, T>>> G(n);
    rep(_, m) {
        int u, v;
        T w;
        scan(u, v, w);
        u -= origin, v -= origin;
        G[u].eb(v, w);
        if (!directed) G[v].eb(u, w);
    }
    return G;
}

bool is_zigzag(ll bit, int n) {
    rep(i, n - 1) {
        if ((bit >> i & 1) == (bit >> (i + 1) & 1)) return false;
    }
    return true;
}

void solve() {
    INT(n);
    LL(k);
    vl a(n);
    scan(a);
    vlp es;
    vl ls;
    rep(i, n) {
        ll use = 1LL << i;
        ll now = a[i];
        for (auto [j, e]: es) {
            if (chmin(now, now ^ e)) use ^= j;
        }
        if (now) {
            es.eb(use, now);
        } else {
            ls.eb(use);
        }
    }
    debug(es, ls);
    ll tmp = 0;
    for (auto [j, e]: es) {
        if (chmin(k, k ^ e)) tmp ^= j;
    }
    if (k) return print("No");
    ll use = -1;
    rep(bit, 1LL << SZ(ls)) {
        ll now = tmp;
        rep(i, SZ(ls)) if (bit >> i & 1) now ^= ls[i];
        if (!is_zigzag(now, n)) {
            use = now;
            break;
        }
    }
    if (use == -1) return print("No");
    debug(use);
    print("Yes");
    if (use == (1LL << n) - 1) {
        print(n - 1);
        vi ans;
        rrep(i, n - 1) ans.eb(i + 1);
        return vecout(ans, ' ');
    } else if (!use) {
        print(2);
        return print(1, 1);
    }
    vb v(n);
    rep(i, n) v[i] = (use >> i & 1);
    int t = -1;
    rep(i, n - 1) {
        if (!v[i] and !v[i + 1]) {
            t = i;
            break;
        }
    }
    debug(t);
    debug(v);
    vi ans;
    auto op = [&](int i) {
        assert(0 <= i and i < n - 1);
        ans.eb(i + 1);
        ll x = a[i] ^ a[i + 1];
        a[i] = a[i + 1] = x;
    };
    if (t == -1) {
        rep(i, n - 2) {
            if (v[i] and v[i + 1] and !v[i + 2]) {
                op(i);
                v[i + 1] = 0;
                t = i + 1;
            }
            if (!v[i] and v[i + 1] and v[i + 2]) {
                op(i + 1);
                v[i + 1] = 0;
                t = i;
            }
        }
    }
    assert(t != -1);
    int l = t, r = t + 2;
    op(l);
    op(l);
    auto move_left = [&]() {
        rep(i, l, r) assert(!a[i] and !v[i]);
        assert(l);
        swap(v[l - 1], v[r - 1]);
        rep(i, l - 1, r - 1) op(i);
        --l, --r;
        rep(i, l, r, 2) {
            if (i + 1 < r) {
                op(i);
            } else {
                assert(i > l);
                op(i - 1);
                op(i - 1);
            }
        }
    };
    auto move_right = [&]() {
        rep(i, l, r) assert(!a[i] and !v[i]);
        assert(r < n);
        swap(v[l], v[r]);
        rrep(i, r, l) op(i);
        ++l, ++r;
        rep(i, l, r, 2) {
            if (i + 1 < r) {
                op(i);
            } else {
                assert(i > l);
                op(i - 1);
                op(i - 1);
            }
        }
    };
    while (l) move_left();
    while (r < n) {
        if (v[r]) {
            move_right();
        } else {
            op(r - 1);
            op(r - 1);
            ++r;
        }
    }
    assert(l);
    rrep(i, l - 1) op(i);
    debug(a);
    assert(SZ(ans) <= 10000);
    print(SZ(ans));
    vecout(ans, ' ');
}

int main() {
    INT(t);
    rep(_, t) solve();
}

Submission Info

Judge Result