Submission #6489181
Source Code Expand
#include <iostream> #include <queue> using namespace std; int main() { int n, x; cin >> n >> x; if (x == 1 || x == 2 * n - 1) { cout << "No" << endl; return 0; } cout << "Yes" << endl; deque<int> ret; for (int i = 1; i < 2 * n; i++)ret.push_back(i); while (ret[n - 1] != x) { ret.push_front(ret[n * 2 - 2]); ret.pop_back(); } for (auto x:ret)cout << x << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | mencotton |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 471 Byte |
Status | AC |
Exec Time | 305 ms |
Memory | 2304 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 | 299 ms | 2304 KB |
1_10.txt | AC | 301 ms | 2304 KB |
1_11.txt | AC | 302 ms | 2304 KB |
1_12.txt | AC | 305 ms | 2304 KB |
1_13.txt | AC | 300 ms | 2304 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 175 ms | 1408 KB |
1_17.txt | AC | 298 ms | 2304 KB |
1_18.txt | AC | 125 ms | 1024 KB |
1_19.txt | AC | 1 ms | 256 KB |