Submission #954986
Source Code Expand
#include<iostream> #include<vector> #include<iomanip> #include<algorithm> #include<numeric> #include<cmath> #include<queue> #include<set> #include<map> using namespace std; using ulong = unsigned long; using ll = long long; const int M = 1e9 + 7; #pragma unused(M) int main(){ int n, x; cin >> n >> x; int s = x - n; if(x == 1 || x == 2*n-1){ cout << "No" << endl; return 0; } cout << "Yes" << endl; for(int i=s+1;i<=2*n-1;i++){ cout << i << endl; } for(int i=1;i<s+1;i++){ cout << i << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | sumoooru |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 561 Byte |
Status | WA |
Exec Time | 1414 ms |
Memory | 2176 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 9 ms | 888 KB |
0_01.txt | AC | 3 ms | 256 KB |
1_00.txt | AC | 3 ms | 256 KB |
1_01.txt | AC | 3 ms | 256 KB |
1_02.txt | AC | 3 ms | 256 KB |
1_03.txt | AC | 3 ms | 256 KB |
1_04.txt | WA | 3 ms | 256 KB |
1_05.txt | AC | 3 ms | 256 KB |
1_06.txt | AC | 3 ms | 256 KB |
1_07.txt | AC | 3 ms | 256 KB |
1_08.txt | AC | 3 ms | 256 KB |
1_09.txt | WA | 1414 ms | 2176 KB |
1_10.txt | WA | 1394 ms | 2176 KB |
1_11.txt | AC | 945 ms | 1536 KB |
1_12.txt | AC | 958 ms | 1536 KB |
1_13.txt | AC | 975 ms | 1536 KB |
1_14.txt | AC | 3 ms | 256 KB |
1_15.txt | AC | 3 ms | 256 KB |
1_16.txt | WA | 816 ms | 1280 KB |
1_17.txt | AC | 921 ms | 1536 KB |
1_18.txt | AC | 389 ms | 768 KB |
1_19.txt | AC | 3 ms | 256 KB |