Submission #4034968
Source Code Expand
#include<iostream> using namespace std; typedef long long ll; #define fr(i,n) for(int i=0;i<n;i++) int main(){ int n,x; cin>>n>>x; if(x==1 || x==2*n-1) cout<<"No"<<endl; else{ cout<<"Yes"<<endl; if(n<3){ fr(i,3) cout<<i+1<<endl; } else if(x==2){ fr(i,n-2) cout<<i+5<<endl; cout<<3<<endl; cout<<2<<endl; cout<<1<<endl; cout<<4<<endl; fr(i,n-3) cout<<i+n+3<<endl; } else{ int j=1; fr(i,n-2){ if(j==x-2) j+=4; cout<<j<<endl; j++; } cout<<x-1<<endl; cout<<x<<endl; cout<<x+1<<endl; cout<<x-2<<endl; fr(i,n-3){ if(j==x-2) j+=4; cout<<j<<endl; j++; } } } }
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | Motsu_xe |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 773 Byte |
Status | AC |
Exec Time | 303 ms |
Memory | 1536 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 | 303 ms | 1536 KB |
1_10.txt | AC | 300 ms | 1536 KB |
1_11.txt | AC | 300 ms | 1536 KB |
1_12.txt | AC | 303 ms | 1536 KB |
1_13.txt | AC | 303 ms | 1536 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 174 ms | 896 KB |
1_17.txt | AC | 295 ms | 1408 KB |
1_18.txt | AC | 129 ms | 768 KB |
1_19.txt | AC | 1 ms | 256 KB |