Submission #1438213

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "math.h"
#include "utility"
#include "string"
#include "map"
#include "unordered_map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

long long int power(long long int x, long long int n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0) tmp = (tmp*tmp) % M;
		else tmp = (((tmp*tmp) % M)*x) % M;
	}
	return tmp;
}

long long int N, M, K, Q, W, H, L, R;
long long int ans;

using namespace std;


int main() {
	ios::sync_with_stdio(false);
	cin >> N >> M;
	if (M == 1 || M == 2 * N - 1) {
		cout << "No\n";
		return 0;
	}
	if (N == 2) {
		cout << "1 2 3\n";
	}
	int num[500000] = {};
	bool flag[500000] = {};
	flag[M] = true;
	flag[M - 1] = true;
	flag[M + 1] = true;
	num[N] = M;
	num[N - 1] = M - 1;
	num[N + 1] = M + 1;
	if (M != 2 * N - 2) {
		num[N - 2] = M + 2;
		flag[M + 2] = true;
	}
	if (M != 2) {
		num[N + 2] = 2;
		flag[2] = true;
	}
	int box = 1;
	for (int i = 1; i <= N * 2 - 1; i++) {
		if (num[i])continue;
		while (flag[box])box++;
		num[i] = box;
		flag[box] = true;
	}
	for (int i = 1; i <= 2 * N - 1; i++) {
		cout << num[i] << endl;
	}
	return 0;
}

Submission Info

Judge Result