Submission #954979


Source Code Expand

//Giorgi Kldiashvili

#include <bits/stdc++.h>

#define ll long long
#define M 1000000007LL

using namespace std;

int n, x;
int a[300020];
bool F[300020];

int main()
{
  cin >> n >> x;
  if(2 * n - 1 == x || 1 == x)
    return printf("No\n"), 0;
  printf("Yes\n");

  a[n] = x;
  a[n - 1] = 1;
  a[n + 1] = 2 * n - 1;
  F[x] = F[1] = F[2 * n - 1] = true;
  int now = 1;
  for(int i = 1; i < n - 1; ++ i)
  {
    while(F[now] == true) now ++;
    a[i] = now;
    now ++;
  }
  for(int i = n + 2; i < 2 * n; ++ i)
  {
    while(F[now] == true) now ++;
    a[i] = now;
    now ++;
  }
  for(int i = 1; i <= 2 * n - 1; ++ i)
    printf("%d\n", a[i]);
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User octopuses
Language C++14 (GCC 5.4.1)
Score 400
Code Size 691 Byte
Status AC
Exec Time 22 ms
Memory 2304 KB

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 3 ms 256 KB
0_01.txt AC 2 ms 256 KB
1_00.txt AC 2 ms 256 KB
1_01.txt AC 2 ms 256 KB
1_02.txt AC 2 ms 256 KB
1_03.txt AC 2 ms 256 KB
1_04.txt AC 3 ms 256 KB
1_05.txt AC 3 ms 256 KB
1_06.txt AC 2 ms 256 KB
1_07.txt AC 2 ms 256 KB
1_08.txt AC 2 ms 256 KB
1_09.txt AC 22 ms 2304 KB
1_10.txt AC 21 ms 2304 KB
1_11.txt AC 21 ms 2304 KB
1_12.txt AC 22 ms 2304 KB
1_13.txt AC 21 ms 2304 KB
1_14.txt AC 2 ms 256 KB
1_15.txt AC 3 ms 256 KB
1_16.txt AC 13 ms 1408 KB
1_17.txt AC 21 ms 2176 KB
1_18.txt AC 10 ms 1024 KB
1_19.txt AC 2 ms 256 KB