Submission #1438227
Source Code Expand
#include "iostream" #include "climits" #include "list" #include "queue" #include "stack" #include "set" #include "functional" #include "algorithm" #include "math.h" #include "utility" #include "string" #include "map" #include "unordered_map" #include "iomanip" #include "random" using namespace std; const long long int MOD = 1000000007; long long int power(long long int x, long long int n, long long int M) { long long int tmp = 1; if (n > 0) { tmp = power(x, n / 2, M); if (n % 2 == 0) tmp = (tmp*tmp) % M; else tmp = (((tmp*tmp) % M)*x) % M; } return tmp; } long long int N, M, K, Q, W, H, L, R; long long int ans; using namespace std; int main() { ios::sync_with_stdio(false); cin >> N >> M; if (M == 1 || M == 2 * N - 1) { cout << "No\n"; return 0; } cout << "Yes\n"; if (N == 2) { cout << "1 2 3\n"; return 0; } int num[500000] = {}; bool flag[500000] = {}; flag[M] = true; flag[M - 1] = true; flag[M + 1] = true; num[N] = M; num[N - 1] = M - 1; num[N + 1] = M + 1; if (M != 2 * N - 2) { num[N - 2] = M + 2; flag[M + 2] = true; } if (M != 2) { num[N + 2] = M - 2; flag[2] = true; } int box = 1; for (int i = 1; i <= N * 2 - 1; i++) { if (num[i])continue; while (flag[box])box++; num[i] = box; flag[box] = true; } for (int i = 1; i <= 2 * N - 1; i++) { cout << num[i] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | olphe |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1439 Byte |
Status | WA |
Exec Time | 300 ms |
Memory | 3968 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 | 2 ms | 2688 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 | 2 ms | 2688 KB |
1_05.txt | AC | 2 ms | 2688 KB |
1_06.txt | AC | 2 ms | 2688 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 295 ms | 3968 KB |
1_10.txt | WA | 299 ms | 3968 KB |
1_11.txt | WA | 295 ms | 3968 KB |
1_12.txt | WA | 295 ms | 3968 KB |
1_13.txt | WA | 300 ms | 3968 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 174 ms | 3328 KB |
1_17.txt | WA | 291 ms | 3968 KB |
1_18.txt | WA | 123 ms | 3200 KB |
1_19.txt | AC | 1 ms | 256 KB |