Submission #1499277

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < int(n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < int(n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define repeat_from_reverse(i,m,n) for (int i = (n)-1; (i) >= int(m); --(i))
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
typedef long long ll;
using namespace std;
template <class T> void setmax(T & a, T const & b) { if (a < b) a = b; }
template <class T> void setmin(T & a, T const & b) { if (b < a) a = b; }
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
int main() {
    // input
    int n; cin >> n;
    vector<int> x(n); repeat (i,n) { cin >> x[i]; -- x[i]; }
    // solve
    vector<int> a(n*n, -1);
    repeat (i,n) a[x[i]] = i;
    vector<int> ix(n);
    whole (iota, ix, 0);
    whole (sort, ix, [&](int i, int j) { return x[i] < x[j]; });
    int j = 0;
    for (int i : ix) {
        for (int k = 0; k < i; ) {
            assert (j < n*n);
            if (a[j] == -1) {
                a[j] = i;
                ++ k;
            } else if (a[j] == i) {
                a.clear();
                goto done;
            }
            ++ j;
        }
    }
    whole(reverse, ix);
    j = n*n-1;
    for (int i : ix) {
        for (int k = 0; k < n-i-1; ) {
            assert (j >= 0);
            if (a[j] == -1) {
                a[j] = i;
                ++ k;
            } else if (a[j] == i) {
                a.clear();
                goto done;
            }
            -- j;
        }
    }
done: ;
    // output
    if (a.empty()) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
        repeat (i,n*n) {
            if (i) cout << ' ';
            cout << a[i] + 1;
        }
        cout << endl;
    }
    return 0;
}

Submission Info

Judge Result