Submission #1307989

---

Source Code Expand

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

#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)

#define in_range(x, y, w, h) (0<=(int)(x) && (int)(x)<(int)(w) && 0<=(int)(y) && (int)(y)<(int)(h))
#define ALL(a) (a).begin(),(a).end()

typedef long long ll;
const int INF   = 1e9;
const ll  INFLL = 1e18;
typedef pair<int, int> PII;
int dx[4]={0, -1, 1, 0}, dy[4]={-1, 0, 0, 1};

int main()
{
    ios::sync_with_stdio(false);

    int N; cin >> N;
    vector<PII> X(N);
    int NN = N*N;
    vector<int> ans(NN);
    rep(i, N) {
        int tmp; cin >> tmp;
        X[i] = PII(tmp-1, i+1);
    }
    sort(ALL(X));

    bool ok = true;

    for (auto x : X) {
        ans[x.first] = x.second;
        if (x.second == 1) continue;

        int cnt = 0;
        for (int i=0; i<x.first; i++) {
            if (ans[i] == 0) {
                ans[i] = x.second;
                cnt++;
            }

            if (cnt == x.second - 1) break;
        }

        if (cnt < x.second-1) {
            ok = false;
            break;
        }
    }

    for (int j=N-1; j>=0; j--) {
        PII x = X[j];
        if (x.second == N) continue;

        int cnt = 0;
        for (int i=NN-1; i>x.first; i--) {
            if (ans[i] == 0) {
                ans[i] = x.second;
                cnt++;
            }

            if (cnt == N - x.second) break;
        }

        if (cnt < N - x.second) {
            ok = false;
            break;
        }
    }

    if (ok) {
        cout << "Yes" << endl;
        rep(i, NN) {
            // if (i > 0) cout << " ";
            cout << ans[i] << " ";
        }
        cout << endl;
    } else {
        cout << "No" << endl;
    }
}

Submission Info

Judge Result