Submission #51713173

---

Source Code Expand

/**
 _  _   __  _ _ _  _  _ _
 |a  ||t  ||o    d | |o  |
| __    _| | _ | __|  _ |
| __ |/_  | __  /__\ / _\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 1000;

int N;
pair <ll, ll> input[N_MAX + 2];

ll A[N_MAX + 2], B[N_MAX + 2];

vector <pair <ll, ll>> sol;
void do_move (ll x, ll y) {
    sol.push_back(make_pair(x, y));
    for (int i = 1; i <= N; i++) {
        A[i] += x; A[i] %= y;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> N;
    for (int i = 1; i <= N; i++) {
        cin >> input[i].first;
    }
    for (int i = 1; i <= N; i++) {
        cin >> input[i].second;
    }
    sort(input + 1, input + N + 1);
    int cnt = 0;
    for (int i = 1; i <= N; i++) {
        if (cnt == 0 || input[i].first > input[i - 1].first) {
            cnt++;
            A[cnt] = input[i].first; B[cnt] = input[i].second;
        } else {
            if (input[i].second != input[i - 1].second) {
                cout << "No\n";
                return 0;
            }
        }
    }
    N = cnt;
    ll K = 3000000000;
    if (N == 1) {
        cout << "Yes\n";
        if (A[1] == B[1]) {
            cout << 0 << "\n";
        } else if (A[1] < B[1]) {
            cout << 1 << "\n";
            cout << B[1] - A[1] << " " << K << "\n";
        } else {
            cout << 1 << "\n";
            cout << B[1] - A[1] + K << " " << K << "\n";
        }
        return 0;
    }
    B[N + 1] = B[1];
    for (int i = 1; i <= N - 1; i++) {
        ll maxA = A[N - i + 1];
        ll x = B[N - i + 2] - B[N - i + 1] + K - (i == 1 ? A[1] : 0);
        do_move(x, maxA + x);
    }
    do_move(B[2], K);
    cout << "Yes\n";
    cout << (int) sol.size() << "\n";
    for (pair <ll, ll> mv : sol) {
        cout << mv.first << " " << mv.second << "\n";
    }

    return 0;
}

Submission Info

Judge Result