Submission #1694769


Source Code Expand

///////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
//                       _oo0oo_                         //
//                      o8888888o                        //
//                      88" . "88      ------ hzt1       //
//                      (| -_- |)                        //
//                      0\  =  /0                        //
//                    ___/`---'\___                      //
//                  .' \|     |// '.                     //
//                 / \|||  :  |||// \                    //
//                / _||||| -:- |||||- \                  //
//               |   | \  -  /// |     |                 //
//               | \_|  ''\---/''  |_/ |                 //
//               \  .-\__  '-'  ___/-. /                 //
//             ___'. .'  /--.--\  `. .'___               //
//          ."" '<  `.___\_<|>_/___.' >' "".             //
//         | | :  `- \`.;`\ _ /`;.`/ - ` : | |           //
//         \  \ `_.   \_ __\ /__ _/   .-` /  /           //
//     =====`-.____`.___ \_____/___.-`___.-'=====        //
//                       `=---='                         //
//                                                       //
//                                                       //
//     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~       //
//                                                       //
//                 God-He Bless All.                     //
//           This Code Will Never Explode.               //
//                                                       //
//                                                       //
///////////////////////////////////////////////////////////
///////////////////////////////////////////////////////////
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define mp make_pair
#define xx first
#define yy second
#define rep(i,a,b) for(int i=(a),i##_end_=(b);i<=i##_end_;i++)
#define dwn(i,a,b) for(int i=(a),i##_end_=(b);i>=i##_end_;i--)
using namespace std;
const int Size=1<<16;
char buffer[Size],*head,*tail;
inline char Getchar() {
    if(head==tail) {
        int l=fread(buffer,1,Size,stdin);
        tail=(head=buffer)+l;
    }
    if(head==tail) return -1;
    return *head++;
}
inline int read() {
    int x=0,f=1;char c=Getchar();
    for(;!isdigit(c);c=Getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=Getchar()) x=x*10+c-'0';
    return x*f;
}
typedef long long ll;
const int maxn=510;
const int maxm=250010;
void GG() {puts("No");exit(0);}
int ans[maxm],n,m;
pair<int,int> A[maxn];
int main() {
	n=read();m=n*n;
	rep(i,1,n) {
		int x=read();
		ans[x]=i;
		A[i]=mp(x,i);
	}
	sort(A+1,A+n+1);
	int cur=1;
	rep(i,1,n) {
		 rep(j,1,A[i].yy-1) {
		 	while(ans[cur]) cur++;
		 	ans[cur]=A[i].yy;
		 }
		 if(cur>A[i].xx) GG();
	}
	cur=m;
	dwn(i,n,1) {
		rep(j,A[i].yy+1,n) {
			while(ans[cur]) cur--;
			ans[cur]=A[i].yy;
		}
		if(cur<A[i].xx) GG();
	}
	puts("Yes");
	rep(i,1,m) printf("%d%c",ans[i],i==m?'\n':' ');
	return 0;
}

Submission Info

Submission Time
Task D - K-th K
User wzj52501
Language C++14 (GCC 5.4.1)
Score 800
Code Size 3142 Byte
Status AC
Exec Time 25 ms
Memory 2048 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 2
AC × 49
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 128 KB
0_01.txt AC 1 ms 128 KB
1_00.txt AC 1 ms 128 KB
1_01.txt AC 24 ms 2048 KB
1_02.txt AC 24 ms 2048 KB
1_03.txt AC 24 ms 2048 KB
1_04.txt AC 24 ms 2048 KB
1_05.txt AC 23 ms 2048 KB
1_06.txt AC 23 ms 2048 KB
1_07.txt AC 23 ms 2048 KB
1_08.txt AC 24 ms 2048 KB
1_09.txt AC 1 ms 128 KB
1_10.txt AC 1 ms 640 KB
1_11.txt AC 1 ms 128 KB
1_12.txt AC 1 ms 128 KB
1_13.txt AC 1 ms 640 KB
1_14.txt AC 1 ms 128 KB
1_15.txt AC 16 ms 1408 KB
1_16.txt AC 1 ms 640 KB
1_17.txt AC 1 ms 768 KB
1_18.txt AC 25 ms 1920 KB
1_19.txt AC 22 ms 1920 KB
1_20.txt AC 17 ms 1536 KB
1_21.txt AC 21 ms 1920 KB
1_22.txt AC 19 ms 1664 KB
1_23.txt AC 1 ms 768 KB
1_24.txt AC 21 ms 1920 KB
1_25.txt AC 17 ms 1536 KB
1_26.txt AC 1 ms 896 KB
1_27.txt AC 1 ms 768 KB
1_28.txt AC 1 ms 640 KB
1_29.txt AC 1 ms 1024 KB
1_30.txt AC 20 ms 1792 KB
1_31.txt AC 22 ms 1920 KB
1_32.txt AC 1 ms 512 KB
1_33.txt AC 22 ms 1920 KB
1_34.txt AC 1 ms 640 KB
1_35.txt AC 1 ms 768 KB
1_36.txt AC 21 ms 1920 KB
1_37.txt AC 20 ms 1792 KB
1_38.txt AC 22 ms 1920 KB
1_39.txt AC 1 ms 640 KB
1_40.txt AC 9 ms 896 KB
1_41.txt AC 1 ms 1152 KB
1_42.txt AC 14 ms 1280 KB
1_43.txt AC 20 ms 1792 KB
1_44.txt AC 1 ms 512 KB
1_45.txt AC 1 ms 640 KB
1_46.txt AC 1 ms 640 KB