Submission #1042114


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <queue>
#include <set>
#include <map>
#include <functional>
#define SIZE 505
#define MX 250005

using namespace std;
typedef long long int ll;
typedef pair <int,int> P;

int A[MX],B[MX];
int X[SIZE];

int main()
{
	int n;
	scanf("%d",&n);
	memset(A,-1,sizeof(A));
	memset(B,-1,sizeof(B));
	for(int i=0;i<n;i++)
	{
		scanf("%d",&X[i]);
		X[i]--;
		A[X[i]]=B[X[i]]=i;
	}
	int sz=n*n;
	for(int i=sz-1;i>=0;i--)
	{
		if(A[i]==-1) continue;
		int v=A[i];
		int zan=n-(v+1);
		int pos=sz-1;
		while(pos>i&&zan>0)
		{
			if(B[pos]==-1)
			{
				zan--;
				B[pos]=v;
			}
			pos--;
		}
		//printf("%d %d\n",v,zan);
		if(zan>0)
		{
			puts("No");
			return 0;
		}
	}
	for(int i=0;i<sz;i++)
	{
		if(A[i]==-1) continue;
		int v=A[i];
		int zan=v;
		int pos=i-1;
		while(pos>=0&&zan>0)
		{
			if(B[pos]==-1)
			{
				zan--;
				B[pos]=v;
			}
			pos--;
		}
		if(zan>0)
		{
			puts("No");
			return 0;
		}
	}
	puts("Yes");
	for(int i=0;i<sz;i++)
	{
		if(i!=0) printf(" ");
		printf("%d",B[i]+1);
	}puts("");
	return 0;
}

Submission Info

Submission Time
Task D - K-th K
User yutaka1999
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1232 Byte
Status AC
Exec Time 125 ms
Memory 3072 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:30:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&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 3 ms 2048 KB
0_01.txt AC 3 ms 2048 KB
1_00.txt AC 3 ms 2048 KB
1_01.txt AC 45 ms 3072 KB
1_02.txt AC 106 ms 3072 KB
1_03.txt AC 83 ms 3072 KB
1_04.txt AC 69 ms 3072 KB
1_05.txt AC 65 ms 3072 KB
1_06.txt AC 125 ms 3072 KB
1_07.txt AC 92 ms 3072 KB
1_08.txt AC 105 ms 3072 KB
1_09.txt AC 24 ms 2176 KB
1_10.txt AC 3 ms 2176 KB
1_11.txt AC 3 ms 2048 KB
1_12.txt AC 44 ms 2176 KB
1_13.txt AC 3 ms 2048 KB
1_14.txt AC 3 ms 2048 KB
1_15.txt AC 42 ms 2688 KB
1_16.txt AC 8 ms 2048 KB
1_17.txt AC 4 ms 2048 KB
1_18.txt AC 54 ms 2944 KB
1_19.txt AC 88 ms 2944 KB
1_20.txt AC 65 ms 2816 KB
1_21.txt AC 88 ms 2944 KB
1_22.txt AC 59 ms 2816 KB
1_23.txt AC 10 ms 2176 KB
1_24.txt AC 96 ms 2944 KB
1_25.txt AC 64 ms 2816 KB
1_26.txt AC 7 ms 2048 KB
1_27.txt AC 3 ms 2048 KB
1_28.txt AC 32 ms 2176 KB
1_29.txt AC 18 ms 2176 KB
1_30.txt AC 67 ms 2944 KB
1_31.txt AC 81 ms 2944 KB
1_32.txt AC 26 ms 2176 KB
1_33.txt AC 53 ms 2944 KB
1_34.txt AC 31 ms 2048 KB
1_35.txt AC 4 ms 2048 KB
1_36.txt AC 70 ms 2944 KB
1_37.txt AC 67 ms 2944 KB
1_38.txt AC 63 ms 2944 KB
1_39.txt AC 27 ms 2176 KB
1_40.txt AC 31 ms 2432 KB
1_41.txt AC 3 ms 2048 KB
1_42.txt AC 46 ms 2688 KB
1_43.txt AC 51 ms 2944 KB
1_44.txt AC 18 ms 2176 KB
1_45.txt AC 28 ms 2048 KB
1_46.txt AC 33 ms 2048 KB