Problem:
Score : 800 points

Problem Statement

You are given an integer sequence x of length N.
Determine if there exists an integer sequence a that satisfies all of the following conditions, and if it exists, construct an instance of a.

a is N^2 in length, containing N copies of each of the integers 1, 2, ..., N.

For each 1 ≤ i ≤ N, the i-th occurrence of the integer i from the left in a is the x_i-th element of a from the left.

Constraints

1 ≤ N ≤ 500

1 ≤ x_i ≤ N^2

All x_i are distinct.

Input

The input is given from Standard Input in the following format:

N
x_1 x_2 ... x_N

Output

If there does not exist an integer sequence a that satisfies all the conditions, print No.
If there does exist such an sequence a, print Yes in the first line, then print an instance of a in the second line, with spaces inbetween.

Sample Input 1

3
1 5 9

Sample Output 1

Yes
1 1 1 2 2 2 3 3 3

For example, the second occurrence of the integer 2 from the left in a in the output is the fifth element of a from the left.
Similarly, the condition is satisfied for the integers 1 and 3.

Sample Input 2

2
4 1

Sample Output 2

No

Solution in Python (3.8.2) (judge verdict: Runtime Error)

from collections import deque
N = int(input())
x = [0] + list(map(int, input().split()))

x2 = list()
x3 = list()
for i in range(N+1):
    x2.append([x[i], i, i-1]) #[期限, 値, 残]
    x3.append([x[i], i, (N-i)])
    

x2.sort()
x3.sort(reverse= True)
# print(x2)

ans = [0]*(N**2 + 1)

for i in range(1, N+1):
    ans[x[i]] = i

# count = [0] * (N+1)
ind = 1
rear_ind = 1

i = 1

Flag = False
while True:
    if x2[ind][2] == 0:
        ind += 1
        
    if ind == N+1:
        break
    
    if i >= len(ans):
        Flag = True
        break

    if ans[i] == 0:
        ans[i] = x2[ind][1]
        # count[ans[i]] += 1
        x2[ind][2] -= 1
        

    i += 1

i = N**2
while True: 
    if x3[rear_ind][2] == 0:
        rear_ind += 1
    
    if rear_ind == N:
        break

        
    if ans[i] == 0:
        ans[i] = x3[rear_ind][1]
        # count[ans[i]] += 1
        x3[rear_ind][2] -= 1
    

    i -= 1

def check():
    count = [0]*(N+1)
    for i in range(1, N**2 + 1):
        count[ans[i]] += 1
        if count[ans[i]] == ans[i]:
            if x[ans[i]] != i:
                return True

    for i in range(1, N+1):
        if count[i] != N:
            return True
    
    return False

Flag = check()

if Flag:
    print("No")
    # print(ans[:1002])
else:
    print("Yes")
    for i in range(1, N**2 + 1):
        print(ans[i] , end = " ")
    print()