Submission #1572391
Source Code Expand
#include "bits/stdc++.h" using namespace std; #ifdef _DEBUG #include "dump.hpp" #else #define dump(...) #endif //#define int long long #define rep(i,a,b) for(int i=(a);i<(b);i++) #define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--) #define all(c) begin(c),end(c) const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f; const int MOD = (int)(1e9) + 7; const double PI = acos(-1); const double EPS = 1e-9; template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; } template<class T> bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; } signed main() { cin.tie(0); ios::sync_with_stdio(false); int N, x; cin >> N >> x; if (x == 1 || x == 2 * N - 1)cout << "No" << endl; else { cout << "Yes" << endl; if (N == 2) { cout << 1 << endl << 2 << endl << 3 << endl; } else { set<int>s; rep(i, 1, 2 * N)s.insert(i); s.erase(x + 2); s.erase(x - 1); s.erase(x); s.erase(x + 1); dump(s); rep(i, 1, 2 * N) { if (i == N - 2)cout << x + 2 << endl; else if (i == N - 1)cout << x - 1 << endl; else if (i == N)cout << x << endl; else if (i == N + 1)cout << x + 1 << endl; else { auto y = s.begin(); cout << *y << endl; s.erase(y); } } } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Median Pyramid Easy |
User | norma |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1352 Byte |
Status | WA |
Exec Time | 368 ms |
Memory | 11904 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 | 368 ms | 10880 KB |
1_10.txt | AC | 362 ms | 10880 KB |
1_11.txt | AC | 365 ms | 10880 KB |
1_12.txt | AC | 365 ms | 11904 KB |
1_13.txt | WA | 367 ms | 10880 KB |
1_14.txt | AC | 1 ms | 256 KB |
1_15.txt | AC | 1 ms | 256 KB |
1_16.txt | AC | 205 ms | 6400 KB |
1_17.txt | AC | 353 ms | 10624 KB |
1_18.txt | WA | 147 ms | 4608 KB |
1_19.txt | AC | 1 ms | 256 KB |