Submission #1439534
Source Code Expand
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
typedef long long ll;
int main() {
int N, x;
cin >> N >> x;
if(x == 1 || x == 2 * N - 1) {
puts("No");
} else {
puts("Yes");
if(N == 2) {
FOR(i,0,3) cout << i + 1 << endl;
} else {
int num[2*N-1], ind[2*N];
FOR(i,0,2*N-1) {
num[i] = i + 1;
ind[i+1] = i;
}
if(x == 2) {
swap(num[(2*N-1)/2-1],num[ind[3]]);
swap(ind[num[(2*N-1)/2-1]],ind[num[ind[3]]]);
swap(num[(2*N-1)/2],num[ind[2]]);
swap(ind[num[(2*N-1)/2]],ind[num[ind[2]]]);
swap(num[(2*N-1)/2+1],num[ind[1]]);
swap(ind[num[(2*N-1)/2+1]],ind[num[ind[1]]]);
swap(num[(2*N-1)/2+2],num[ind[4]]);
} else {
swap(num[(2*N-1)/2-2],num[ind[x-1]]);
swap(ind[num[(2*N-1)/2-2]],ind[num[ind[x-1]]]);
swap(num[(2*N-1)/2-1],num[ind[x+1]]);
swap(ind[num[(2*N-1)/2-1]],ind[num[ind[x+1]]]);
swap(num[(2*N-1)/2],num[ind[x]]);
swap(ind[num[(2*N-1)/2]],ind[num[ind[x]]]);
swap(num[(2*N-1)/2+1],num[ind[x-2]]);
}
FOR(i,0,2*N-1) cout << num[i] << endl;
}
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Median Pyramid Easy |
User |
nenuon |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
1486 Byte |
Status |
AC |
Exec Time |
312 ms |
Memory |
3072 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
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 |
256 KB |
0_01.txt |
AC |
1 ms |
256 KB |
1_00.txt |
AC |
1 ms |
256 KB |
1_01.txt |
AC |
1 ms |
256 KB |
1_02.txt |
AC |
1 ms |
256 KB |
1_03.txt |
AC |
1 ms |
256 KB |
1_04.txt |
AC |
1 ms |
256 KB |
1_05.txt |
AC |
1 ms |
256 KB |
1_06.txt |
AC |
1 ms |
256 KB |
1_07.txt |
AC |
1 ms |
256 KB |
1_08.txt |
AC |
1 ms |
256 KB |
1_09.txt |
AC |
306 ms |
3072 KB |
1_10.txt |
AC |
300 ms |
3072 KB |
1_11.txt |
AC |
301 ms |
3072 KB |
1_12.txt |
AC |
312 ms |
3072 KB |
1_13.txt |
AC |
303 ms |
3072 KB |
1_14.txt |
AC |
1 ms |
256 KB |
1_15.txt |
AC |
1 ms |
256 KB |
1_16.txt |
AC |
178 ms |
1792 KB |
1_17.txt |
AC |
291 ms |
2944 KB |
1_18.txt |
AC |
126 ms |
1408 KB |
1_19.txt |
AC |
1 ms |
256 KB |