Submission #1438279


Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int N, x;
int s[] = {1, 0, -1, 2}, t[] = {-1, 0, 1, -2};

signed main() {
    cin >> N >> x;
    if(x == 1 || x == 2*N-1) cout << "No" << endl;
    else {
        cout << "Yes" << endl;
        vector<int> v(2*N-1);
        int center = N-1;
        set<int> S;
        if(x == 2) {
            rep(i,0,4) {
                if(center-1+i < 0 || center-1+i >= 2*N-1) continue;
                v[center-1+i] = x-s[i];
                S.insert(x-s[i]);
            }
        }
        else {
            rep(i,0,4) {
                if(center-1+i < 0 || center-1+i >= 2*N-1) continue;
                v[center-1+i] = x-t[i];
                S.insert(x-t[i]);
            }
        }

        int val = 1;
        rep(i,0,2*N-1) {
            if(v[i] != 0) continue;
            while(S.count(val)) val++;
            v[i] = val;
            S.insert(val);
        }
        rep(i,0,2*N-1) cout << v[i] << endl;
    }
    return 0;
}

Submission Info

Submission Time
Task B - Median Pyramid Easy
User tsutaj
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2017 Byte
Status WA
Exec Time 459 ms
Memory 13184 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 19
WA × 3
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 445 ms 12416 KB
1_10.txt AC 459 ms 12416 KB
1_11.txt AC 428 ms 13184 KB
1_12.txt AC 459 ms 12416 KB
1_13.txt WA 457 ms 12416 KB
1_14.txt AC 1 ms 256 KB
1_15.txt AC 1 ms 256 KB
1_16.txt AC 245 ms 7296 KB
1_17.txt AC 419 ms 12160 KB
1_18.txt WA 171 ms 5248 KB
1_19.txt AC 1 ms 256 KB