Submission #2545566
Source Code Expand
#include <iostream> #include <cstdio> #define N 200005 using namespace std; int n, x, a[N]; bool v[N]; void f(int p, int q) { a[n + p] = x + q; v[x + q] = 1; } int main() { int i, j; cin >> n >> x; if (x == 1 || x == n * 2 - 1) {cout << "No"; return 0;} cout << "Yes\n"; if (x != 2) f(-1, -1), f(0, 0), f(1, 1), f(2, -2); else f(-1, 1), f(0, 0), f(1, -1), f(2, 2); for (i = j = 1; i < 2 * n; i++) { if (!a[i]) { for (; v[j]; j++); a[i] = j++; } printf("%d\n", a[i]); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | Abra_Stone |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 538 Byte |
Status | AC |
Exec Time | 19 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 | 19 ms | 2304 KB |
1_10.txt | AC | 18 ms | 2304 KB |
1_11.txt | AC | 18 ms | 2304 KB |
1_12.txt | AC | 18 ms | 2304 KB |
1_13.txt | AC | 18 ms | 2304 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 11 ms | 1408 KB |
1_17.txt | AC | 18 ms | 2176 KB |
1_18.txt | AC | 8 ms | 1024 KB |
1_19.txt | AC | 1 ms | 256 KB |