提出 #66807263

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#include <atcoder/all>
using namespace atcoder;

using ll = long long;
using mint = modint998244353;

ll dot(vector<ll> &A, vector<ll> &B) {
    ll ret = 0;
    int N = A.size();
    assert(A.size() == B.size());
    for(int i = 0; i < N; i++) ret += A[i] * B[i];
    return ret;
}

void solve() {
    int N;
    cin >> N;
    vector<ll> A(N), B(N);
    for(ll &x : A) cin >> x;
    for(ll &x : B) cin >> x;
    vector<array<ll, 3>> v(N);
    for(int i = 0; i < N; i++) {
        v[i][0] = A[i];
        v[i][1] = B[i];
        v[i][2] = i;
    }
    sort(v.begin(), v.end(), [&](auto &x, auto &y) {
        return (x[0] == y[0] ? x[1] > y[1] : x[0] < y[0]);
    });
    { // A[l] <= A[r], B[l] > B[r] を探す
        ll mx = -1, argmx = -1;
        for(int i = 0; i < N; i++) {
            if(v[i][1] < mx) {
                ll l = v[argmx][2];
                ll r = v[i][2];
                vector<ll> X(N);
                X[l] = - B[r] - 1;
                X[r] = B[l] + 1;
                assert(dot(A, X) > 0);
                assert(dot(B, X) < 0);
                cout << "Yes" << "\n";
                for(int i = 0; i < N; i++) {
                    cout << X[i] << " \n"[i == N - 1];
                }
                return;
            }else if(mx < v[i][1]) {
                mx = v[i][1];
                argmx = i;
            }
        }
    }
    sort(v.begin(), v.end(), [&](auto &x, auto &y) {
        return (x[1] == y[1] ? x[0] > y[0] : x[1] < y[1]);
    });
    { // B[l] <= B[r], A[l] > A[r] を探す
        ll mx = -1, argmx = -1;
        for(int i = 0; i < N; i++) {
            if(v[i][0] < mx) {
                ll l = v[argmx][2];
                ll r = v[i][2];
                vector<ll> X(N);
                X[l] = A[r] + 1;
                X[r] = - A[l] - 1;
                assert(dot(A, X) > 0);
                assert(dot(B, X) < 0);
                cout << "Yes" << "\n";
                for(int i = 0; i < N; i++) {
                    cout << X[i] << " \n"[i == N - 1];
                }
                return;
            }else if(mx < v[i][0]) {
                mx = v[i][0];
                argmx = i;
            }
        }
    }
    cout << "No" << "\n";
}

int main() {
    int T;
    cin >> T;
    while(T--) solve();
}

提出情報

ジャッジ結果