Submission #1484058

---

Source Code Expand

#include<string>
#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<map>
using namespace std;
typedef long long int llint;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
const int mod=1000000007;
const llint big=1e18+10;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-9;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
int gcd(int a,int b){if(a%b==0){return b;}else return gcd(b,a%b);}//a>b
class in_t{public:
	int a;in_t(){cin>>a;}
	operator int() {return a;}
};
class ld_t{public:
	long double a;ld_t(){cin>>a;}
	operator long double() {return a;}
};
int main(void){
	in_t n;
	int i,j;
	vector<int>bas(n);//あるべき場所
	vector<pair<int,int>>zyu(n);//場所、数字
	vector<int>ans(n*n,-1);
	deque<int>suu;
	vector<int>ikt(n);//それまでの数
	for(i=0;i<n;i++){
		int x;
		cin>>x;x--;
		ans[x]=i;
		bas[i]=x;
		zyu[i]=mp(x,i);
	}
	sort(zyu.begin(),zyu.end());
	for(i=0;i<n;i++){
		for(j=0;j<zyu[i].sec;j++){suu.pub(zyu[i].sec);}
		
	}
	for(i=0;i<n;i++){
		for(j=zyu[i].sec+1;j<n;j++){suu.pub(zyu[i].sec);}
	}
	//前がない->あと
	for(i=0;i<n*n;i++){
		int kore;
		if(ans[i]!=-1){kore=ans[i];}
		else{kore=suu.front();suu.pof();}
		if(ikt[kore]==kore){
			if(bas[kore]!=i){cout<<"No"<<endl;return 0;}
		}ikt[kore]++;
		ans[i]=kore;
	}
	cout<<"Yes"<<endl;
	for(i=0;i<n*n;i++){cout<<ans[i]+1<<" ";}
	return 0;
}

Submission Info

Judge Result