提出 #70488316

---

ソースコード 拡げる

#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = std::forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = std::forward<U>(y), true); }

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

void solve() {
    int N;
    cin >> N;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    for (int i = 0; i < N; i++) {
        cin >> B[i];
    }

    int one = accumulate(A.begin(), A.end(), 0);
    if (N - one < one) {
        for (int i = 0; i < N; i++) {
            A[i] ^= 1;
            B[i] ^= 1;
        }
    }
    vector<int> p, q;
    for (int i = 0; i < N; i++) {
        if (A[i] == 1) {
            p.emplace_back(i);
        }
        if (B[i] == 1) {
            q.emplace_back(i);
        }
    }
    if (p.size() != q.size() or accumulate(p.begin(), p.end(), 0) != accumulate(q.begin(), q.end(), 0)) {
        cout << "No\n";
        return;
    }

    vector<tuple<int, int, int, int>> ans;
    int M = p.size();
    queue<int> neg, pos;
    for (int i = 0; i < M; i++) {
        if (p[i] > q[i]) {
            pos.emplace(i);
        }
    }
    for (int i = M - 1; i >= 0; i--) {
        if (p[i] < q[i]) {
            neg.emplace(i);
        }
    }
    auto op = [&](int i, int j, int len) {
        int a = p[i], b = p[i] + len;
        int c = p[j] - len + 1, d = p[j] + 1;
        if (a > c) {
            swap(a, c);
            swap(b, d);
        }
        ans.emplace_back(a, b, c, d);
        p[i] += len - 1;
        p[j] -= len - 1;
    };
    while (not neg.empty()) {
        auto i = neg.front();
        auto j = pos.front();
        auto I = abs(p[i] - q[i]);
        auto J = abs(p[j] - q[j]);
        auto len = min(I, J) + 1;
        op(i, j, len);
        if (p[i] == q[i]) {
            neg.pop();
        }
        if (p[j] == q[j]) {
            pos.pop();
        }
    }
    cout << "Yes\n";
    cout << ans.size() << "\n";
    for (auto [a, b, c, d] : ans) {
        cout << a + 1 << " " << b << " " << c + 1 << " " << d << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    for (; T--;) {
        solve();
    }
    return 0;
}

提出情報

ジャッジ結果