Submission #70484863

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<int> A(N), B(N);
    rep(i, 0, N) cin >> A[i];
    rep(i, 0, N) cin >> B[i];
    {
        ll diff = 0;
        rep(i, 0, N) if (A[i]) diff += i;
        rep(i, 0, N) if (B[i]) diff -= i;
        if (diff){
            cout << "No\n";
            return;
        }
        if (vec_sum(A) != vec_sum(B)){
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
    if (vec_sum(A) >= (N + 1) / 2){
        rep(i, 0, N) A[i] ^= 1;
        rep(i, 0, N) B[i] ^= 1;
    }
    vector<int> p, q;
    rep(i, 0, N) if (A[i]) p.push_back(i);
    rep(i, 0, N) if (B[i]) q.push_back(i);
    int M = p.size();
    vector<pair<int, int>> L, R;
    rep(i, 0, M){
        if (p[i] < q[i]) R.push_back({p[i], q[i]});
        else L.push_back({p[i], q[i]});
    }
    reverse(all(L));
    vector<tuple<int, int, int, int>> ans;
    auto op = [&](int a, int b, int c, int d) -> void {
        if (b > c) swap(a, c), swap(b, d);
        // cout << a << " " << b << " " << c << " " << d << endl;
        assert(b <= c);
        assert(b - a == d - c);
        int dif = 0;
        rep(i, a, b) dif += A[i];
        rep(i, c, d) dif -= A[i];
        // cout << dif << endl;
        assert(dif == 0);
        rep(i, a, b) swap(A[i], A[i + c - a]);
        ans.push_back({a + 1, b, c + 1, d});
        // vec_out(A);
    };
    rep(i, 0, M - 1){
        if (L.empty() || R.empty()) break;
        auto tmpL = L.back();
        auto tmpR = R.back();
        // cout << tmpL.first << " " << tmpL.second << " " << tmpR.first << " " << tmpR.second << endl;
        if (tmpL.first - tmpL.second < tmpR.second - tmpR.first){
            int len = tmpL.first - tmpL.second;
            op(tmpL.second, tmpL.second + len + 1, tmpR.first, tmpR.first + len + 1);
            R.back().first += len;
            L.pop_back();
        }
        else{
            int len = tmpR.second - tmpR.first;
            op(tmpL.first - len, tmpL.first + 1, tmpR.first, tmpR.second + 1);
            L.back().first -= len;
            R.pop_back();
        }
    }
    cout << ans.size() << "\n";
    for (auto [a, b, c, d] : ans){
        cout << a << " " << b << " " << c << " " << d << "\n";
    }
    assert(A == B);
}

Submission Info

Judge Result