Submission #1609950


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n, x, ans[1<<20];

int main() {
    cin >> n >> x;
    if (x == 1 || x == n+n-1) {
        cout << "No";
        return 0;
    } else cout << "Yes\n";
    if (n == 2) { cout << "1\n2\n3"; return 0; }
    if (x == 2) ans[n-1] = x, ans[n-2] = x+1, ans[n] = x-1, ans[n+1] = x+2;
    else ans[n-1] = x, ans[n-2] = x-1, ans[n] = x+1, ans[n+1] = x-2;
    
    for (int i = 0, k = 1; i < n+n-1; i++) {
        if (k == ans[n+1] || k == ans[n]) k += 4;
        if (ans[i]) i += 3;
        else ans[i] = k++;
    }
    for (int i = 0; i < n+n-1; i++) cout << ans[i] << '\n';
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User Kusika
Language C++14 (GCC 5.4.1)
Score 400
Code Size 639 Byte
Status AC
Exec Time 20 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 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 20 ms 2304 KB
1_10.txt AC 19 ms 2304 KB
1_11.txt AC 19 ms 2304 KB
1_12.txt AC 19 ms 2304 KB
1_13.txt AC 19 ms 2304 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 12 ms 1408 KB
1_17.txt AC 19 ms 2176 KB
1_18.txt AC 9 ms 1024 KB
1_19.txt AC 1 ms 256 KB