Submission #1750717


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int main () {
	int n, x;
	cin >> n >> x;               
	if (x == n) {
		for (int i = 1;i <=  2 * n - 1;i ++) {
			cout << i << endl;
		}
		return 0;
	}
	if (x < n) {
		if (x == 1) {
			cout << "No";
			return 0;
		}
		int val = 0;
		for (int i = 1;i <= 2 * n - 1;i ++) {
			if (i == x || i == x - 1) continue;
			cout << i << endl;
			val ++;
			if (val == n - 2) {
				cout << x - 1 << endl << x << endl;
			}
		}
	} 
	if (x > n) {
		if (x == 2 * n - 1) {
			cout << "No";
			return 0;
		}
		int val = 0;
		for (int i = 1;i <= 2 * n - 1;i ++) {
			if (i == x || i == x + 1) continue;
			cout << i << endl;
			val ++;
			if (val == n - 1) {
				cout << x  << endl << x + 1 << endl;
			}
		}
	}
	return 0;
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User almasalmas
Language C++14 (GCC 5.4.1)
Score 0
Code Size 799 Byte
Status WA
Exec Time 319 ms
Memory 1536 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 1
WA × 1
AC × 9
WA × 13
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 WA 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt WA 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt WA 1 ms 256 KB
1_05.txt WA 1 ms 256 KB
1_06.txt WA 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt WA 311 ms 1536 KB
1_10.txt WA 308 ms 1536 KB
1_11.txt WA 308 ms 1536 KB
1_12.txt WA 306 ms 1536 KB
1_13.txt WA 319 ms 1536 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt WA 177 ms 896 KB
1_17.txt WA 302 ms 1408 KB
1_18.txt WA 126 ms 768 KB
1_19.txt AC 1 ms 256 KB