Submission #1356114


Source Code Expand

#include <stdio.h>
#include <string.h>
#include <algorithm>
#define MAXN (200005)
using namespace std;

int A[MAXN];
int N, X, L, R;

int main() {
	scanf("%d%d", &N, &X); N = (N<<1)-1;
	if(X == 1 || N == X) { puts("No"); return 0; }
	L = X-1; R = N-X; const int d = min(L, R);
	for(int i = X-d; i <= X+d; i++) A[N/2+1 + i - X] = i;
	if(d == L) {
		for(int i = 1; i <= (N-d-X)/2; i++) A[i] = X+d + i;
		for(int i = X+d+(N-d-X)/2+1; i <= N; i++) A[N/2+1 + d + i - X - d - (N-d-X)/2] = i;

	} else {
		for(int i = 1; i <= (X-d-1)/2; i++) A[i] = i;
		for(int i = (X-d-1)/2 + 1; i < X-d; i++) A[N/2+1 + d + i - (X-d-1)/2 ] = i;
	}
	puts("Yes");
	for(int i = 1; i <= N; i++) printf("%d\n", A[i]);
	return 0;
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User youngyojun
Language C++14 (GCC 5.4.1)
Score 400
Code Size 728 Byte
Status AC
Exec Time 17 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &X); N = (N<<1)-1;
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 22
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
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 1 ms 128 KB
1_02.txt AC 1 ms 128 KB
1_03.txt AC 1 ms 128 KB
1_04.txt AC 1 ms 128 KB
1_05.txt AC 1 ms 128 KB
1_06.txt AC 1 ms 128 KB
1_07.txt AC 1 ms 128 KB
1_08.txt AC 0 ms 128 KB
1_09.txt AC 17 ms 2176 KB
1_10.txt AC 17 ms 2176 KB
1_11.txt AC 17 ms 2176 KB
1_12.txt AC 17 ms 2176 KB
1_13.txt AC 17 ms 2176 KB
1_14.txt AC 1 ms 128 KB
1_15.txt AC 1 ms 128 KB
1_16.txt AC 10 ms 1280 KB
1_17.txt AC 17 ms 2176 KB
1_18.txt AC 7 ms 896 KB
1_19.txt AC 1 ms 128 KB