Submission #1382914

---

Source Code Expand

#include <bits/stdc++.h>

#define pii pair <int, int>

#define mp make_pair

#define f first
#define s second

#define pb push_back

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

const int N = 505;
const int NN = 20;
const int INF = 1e9 + 7;

int n;
int ans[N * N], cnt[N];
pii a[N];

int main() {
    #define fn "balls"
    #ifdef witch
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #else
//        freopen(fn".in", "r", stdin);
//        freopen(fn".out", "w", stdout);
    #endif
    srand(time(0));
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].f;
        if (a[i].f < i) {
            cout << "No";
            return 0;
        }
        a[i].s = i;
    }
    memset(ans, -1, sizeof(ans));
    sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) {
        int cnt = a[i].s;
        if (ans[a[i].f] != -1) {
            cout << "No";
            return 0;
        }
        for (int j = a[i].f; j > 0; j--) {
            if (ans[j] == -1) {
                ans[j] = a[i].s;
                if (--cnt == 0) {
                    break;
                }
            }
        }
        if (cnt > 0) {
            cout << "No";
            return 0;
        }
    }
    cout << "Yes\n";
    for (int i = 1; i <= n * n; i++) {
        if (ans[i] == -1) {
            for (int j = 1; j <= n; j++) {
                if (cnt[j] >= j && cnt[j] < n) {
                    ans[i] = j;
                    break;
                }
            }
        }
        cnt[ans[i]]++;
    }
    for (int i = 1; i <= n * n; i++) {
        cout << ans[i] << " ";
    }
    return 0;
}

Submission Info

Judge Result