Submission #1695218


Source Code Expand

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

const int maxn=250010;

int n,a[maxn],a0[maxn];

int main()
{
#ifdef h10
	freopen("D.in","r",stdin);
	freopen("D.out","w",stdout);
#endif
	int i,j,x,p;
	scanf("%d",&n);
	for (i=1;i<=n;i++)
		scanf("%d",&x),a0[x]=a[x]=i;

	for (i=p=1;i<=n*n;i++)
		if (a0[i])
		{
			int val=a0[i];
			for (j=1;j<val;j++)
			{
				while (a[p]) p++;
				a[p]=val;
			}
			if (p>i) {puts("No"); return 0;}
		}

	for (i=p=n*n;i>=1;i--)
		if (a0[i])
		{
			int val=a0[i];
			for (j=val;j<n;j++)
			{
				while (a[p]) p--;
				a[p]=val;
			}
			if (p<i) {puts("No"); return 0;}
		}

	puts("Yes");
	for (i=1;i<=n*n;i++)
		printf("%d ",a[i]);
}

Submission Info

Submission Time
Task D - K-th K
User h10
Language C++14 (GCC 5.4.1)
Score 800
Code Size 711 Byte
Status AC
Exec Time 22 ms
Memory 2816 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:17:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x),a0[x]=a[x]=i;
                              ^

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 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 22 ms 2688 KB
1_02.txt AC 22 ms 2688 KB
1_03.txt AC 22 ms 2432 KB
1_04.txt AC 22 ms 2176 KB
1_05.txt AC 22 ms 2688 KB
1_06.txt AC 22 ms 2688 KB
1_07.txt AC 22 ms 2816 KB
1_08.txt AC 22 ms 2176 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 2 ms 768 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 2 ms 768 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 15 ms 1920 KB
1_16.txt AC 2 ms 1152 KB
1_17.txt AC 2 ms 1280 KB
1_18.txt AC 22 ms 2432 KB
1_19.txt AC 20 ms 2432 KB
1_20.txt AC 16 ms 1920 KB
1_21.txt AC 20 ms 2432 KB
1_22.txt AC 18 ms 2176 KB
1_23.txt AC 2 ms 1280 KB
1_24.txt AC 20 ms 2432 KB
1_25.txt AC 16 ms 1920 KB
1_26.txt AC 2 ms 1280 KB
1_27.txt AC 2 ms 1152 KB
1_28.txt AC 2 ms 1152 KB
1_29.txt AC 2 ms 1664 KB
1_30.txt AC 19 ms 2304 KB
1_31.txt AC 21 ms 2560 KB
1_32.txt AC 2 ms 1024 KB
1_33.txt AC 20 ms 2432 KB
1_34.txt AC 2 ms 1152 KB
1_35.txt AC 2 ms 1152 KB
1_36.txt AC 20 ms 2432 KB
1_37.txt AC 19 ms 2304 KB
1_38.txt AC 21 ms 2560 KB
1_39.txt AC 2 ms 1152 KB
1_40.txt AC 9 ms 1152 KB
1_41.txt AC 2 ms 1664 KB
1_42.txt AC 13 ms 1664 KB
1_43.txt AC 19 ms 2304 KB
1_44.txt AC 1 ms 896 KB
1_45.txt AC 2 ms 1152 KB
1_46.txt AC 2 ms 1152 KB