Submission #957822

Source Code Expand

#include <iostream>
using namespace std;
int main(void){
    int n,x;
    cin >> n >> x;
    
    if(x == 1 || x == 2*n -1){
        cout << "No" << endl;
        return 0;
        
    }
    cout << "Yes" << endl;
    for(int i=1;i<=2*n-1;i++){
        if(i==(2*n-1)/2){
            cout << x-1 << endl;
        }else if(i==(((2*n-1)/2) + 1)){
            cout << x << endl;
        }else if(i==(((2*n-1)/2) + 2)){
            cout << x+1 << endl;
        }else{
            cout << 1 << endl;
        }
    }
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User tsukamasa
Language C++14 (GCC 5.4.1)
Score 0
Code Size 537 Byte
Status WA
Exec Time 838 ms
Memory 640 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 1
WA × 1
AC × 10
WA × 12
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 3 ms 256 KiB
0_01.txt AC 3 ms 256 KiB
1_00.txt AC 3 ms 256 KiB
1_01.txt AC 3 ms 256 KiB
1_02.txt AC 3 ms 256 KiB
1_03.txt AC 3 ms 256 KiB
1_04.txt WA 3 ms 256 KiB
1_05.txt WA 3 ms 256 KiB
1_06.txt WA 3 ms 256 KiB
1_07.txt AC 3 ms 256 KiB
1_08.txt AC 3 ms 256 KiB
1_09.txt WA 824 ms 640 KiB
1_10.txt WA 838 ms 640 KiB
1_11.txt WA 835 ms 640 KiB
1_12.txt WA 827 ms 640 KiB
1_13.txt WA 826 ms 640 KiB
1_14.txt AC 3 ms 256 KiB
1_15.txt AC 3 ms 256 KiB
1_16.txt WA 482 ms 512 KiB
1_17.txt WA 806 ms 640 KiB
1_18.txt WA 342 ms 384 KiB
1_19.txt AC 3 ms 256 KiB