提出 #40427405

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define pb push_back

/*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
*/

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    vector<int> a(n);
    int sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += a[i];
    }

    if (n % 2 == 1 && sum % n != 0) {
        cout << "No" << endl;
        return 0;
    }

    vector<vector<int>> ope;

    if (n % 2 == 0 && sum % n != 0) {
        if (sum % (n/2) != 0) {
            cout << "No" << endl;
            return 0;
        } else {
            vector<int> tmp(n);
            for (int i = 0; i < n; i++) {
                a[i] += i + 1;
                tmp[i] = i + 1;
            }
            ope.pb(tmp);
        }
    }

    int ave = sum/n;
    vector<int> p, m;
    for (int i = 0; i < n; i++) {
        if (a[i] > ave) {
            for (int j = 0; j < a[i] - ave; j++) m.pb(i);
        }
        if (a[i] < ave) {
            for (int j = 0; j < ave - a[i]; j++) p.pb(i);
        }
    }

    for (int i = 0; i < (int)p.size(); i++) {
        vector<int> o1(n), o2(n);
        o1[m[i]] = 1; o1[p[i]] = 2;
        o2[m[i]] = n - 1; o2[p[i]] = n;
        int c = 3;
        for (int j = 0; j < n; j++) {
            if (j != m[i] && j != p[i]) {
                o1[j] = c; o2[j] = n + 1 - c;
                c++;
            }
        }
        ope.pb(o1);
        ope.pb(o2);
    }

    cout << "Yes" << endl;
    cout << (int)ope.size() << endl;
    for (int i = 0; i < (int)ope.size(); i++) {
        for (int j = 0; j < n; j++) {
            cout << ope[i][j] << " ";
        }
        cout << endl;
    }
}

提出情報

ジャッジ結果