Submission #1077373


Source Code Expand

#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstdlib>
using namespace std;

const int MAXN = 500;
int n, x[MAXN+1];
int a[MAXN*MAXN+1];

vector<pair<int,int>> q;

void fk(){
	puts("No");
	exit(0);
}

int main(){
	scanf("%d", &n);
	for(int i=1; i<=n; i++){
		scanf("%d", &x[i]);
		a[x[i]]=i;
		q.push_back(make_pair(x[i], i));
	}

	sort(q.begin(), q.end());
	int index=1;
	for(auto &p:q){
		int place=p.first, num=p.second;
		for(int i=1; i<num; i++){
			while(a[index]) index++;
			if(index > place) fk(); ///
			a[index]=num; index++;
		}
	}

	for(int i=1; i<=n; i++){
        for(int j=1; j<=n-i; j++){
			while(a[index]) index++;
			a[index]=i;
        }
	}

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

Submission Info

Submission Time
Task D - K-th K
User mindol
Language C++14 (GCC 5.4.1)
Score 0
Code Size 809 Byte
Status WA
Exec Time 26 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:21:21: 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 0 / 800
Status
AC × 2
AC × 21
WA × 28
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 2 ms 256 KB
0_01.txt AC 2 ms 256 KB
1_00.txt AC 2 ms 256 KB
1_01.txt AC 25 ms 2176 KB
1_02.txt AC 25 ms 2176 KB
1_03.txt AC 26 ms 2176 KB
1_04.txt AC 26 ms 2176 KB
1_05.txt AC 26 ms 2176 KB
1_06.txt WA 26 ms 2176 KB
1_07.txt WA 25 ms 2176 KB
1_08.txt AC 26 ms 2176 KB
1_09.txt AC 2 ms 256 KB
1_10.txt WA 26 ms 2176 KB
1_11.txt AC 3 ms 256 KB
1_12.txt AC 2 ms 256 KB
1_13.txt WA 26 ms 2176 KB
1_14.txt AC 3 ms 256 KB
1_15.txt WA 18 ms 1536 KB
1_16.txt AC 3 ms 640 KB
1_17.txt WA 22 ms 1920 KB
1_18.txt WA 23 ms 1920 KB
1_19.txt WA 23 ms 2048 KB
1_20.txt WA 19 ms 1664 KB
1_21.txt WA 23 ms 1920 KB
1_22.txt WA 21 ms 1792 KB
1_23.txt WA 20 ms 1664 KB
1_24.txt WA 23 ms 1920 KB
1_25.txt WA 18 ms 1536 KB
1_26.txt WA 19 ms 1664 KB
1_27.txt WA 18 ms 1536 KB
1_28.txt AC 3 ms 640 KB
1_29.txt WA 25 ms 2176 KB
1_30.txt WA 22 ms 1920 KB
1_31.txt WA 24 ms 2048 KB
1_32.txt AC 3 ms 768 KB
1_33.txt WA 24 ms 2048 KB
1_34.txt AC 3 ms 768 KB
1_35.txt WA 17 ms 1408 KB
1_36.txt WA 23 ms 1920 KB
1_37.txt WA 22 ms 1792 KB
1_38.txt WA 25 ms 2048 KB
1_39.txt AC 3 ms 640 KB
1_40.txt WA 11 ms 1024 KB
1_41.txt WA 25 ms 2176 KB
1_42.txt WA 16 ms 1280 KB
1_43.txt WA 22 ms 1920 KB
1_44.txt AC 3 ms 512 KB
1_45.txt AC 3 ms 640 KB
1_46.txt AC 3 ms 768 KB