Submission #1336976
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<int, int>; const ll MOD = 1000000007; int main(){ int N, x; cin >> N >> x; if(x == 1 || x == 2 * N - 1){ cout << "No" << endl; return 0; } cout << "Yes" << endl; int n = 2*N - 1; vector<int> ans(n, 0); if (N == 2){ ans = {1, 2, 3}; }else{ int nd = n / 2; ans[nd+1] = x; ans[nd] = x-1; ans[nd-1] = x+1; ans[nd+2] = x+2; int k = 1; for(int i=0;i<n;i++){ while(x-1 <= k && k <= x+2) k++; if(ans[i] == 0) ans[i] = k++; } } for(int i=0;i<n;i++){ cout << ans[i] << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | zaburo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 776 Byte |
Status | WA |
Exec Time | 308 ms |
Memory | 2304 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 | 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 | WA | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 308 ms | 2304 KB |
1_10.txt | AC | 299 ms | 2304 KB |
1_11.txt | AC | 298 ms | 2304 KB |
1_12.txt | AC | 303 ms | 2304 KB |
1_13.txt | WA | 305 ms | 2304 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 180 ms | 1408 KB |
1_17.txt | AC | 302 ms | 2176 KB |
1_18.txt | WA | 128 ms | 1024 KB |
1_19.txt | AC | 1 ms | 256 KB |