Submission #33270633

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
template<typename A> inline void rd(A &a) {
  cin >> a;
}
template<typename A, typename ...B> inline void rd(A &a, B &...b) {
  cin >> a;
  rd(b...);
}
template<typename A> inline void O(const A &a) {
  cout << a << '\n';
}
template<typename A, typename ...B> inline void O(const A &a, const B &...b) {
  cout << a << ' ';
  O(b...);
}
template<typename T> inline void ckmin(T &x, const T &a) {
  x = min(x, a);
}
template<typename T> inline void ckmax(T &x, const T &a) {
  x = max(x, a);
}
#ifdef MISAKA
#define err(...) fprintf(stderr, __VA_ARGS__)
#else
#define err(...)
#endif
#define FOR(i,j,k) for (int i = (j); i <= (k); ++i)
#define ROF(i,j,k) for (int i = (k); i >= (j); --i)
typedef unsigned u32;
typedef long long i64;
typedef unsigned long long u64;
typedef pair<int ,int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
// #define IOFILE "filename"
// #define MULTI
const int N = 3e5+5;
int p[N];
int vis[N];

inline void sol() {
  int n, k;
  rd(n, k);
  if (2*k>n) {
    O(-1);
    return;
  }
  int i = 0;
  for (; n - i >= 4 * k; i += 2*k) {
    FOR(j,k,2*k-1) cout << i+j+1 <<' ';
    FOR(j,0,k-1) cout << i + j + 1 << ' ';
  }
  if (n-i < 3 * k) {
  FOR(j,i+k,n-1) cout << j+1 << ' ';
  FOR(j,i,i+k-1) cout << j+1 << ' ';
  } else {
    FOR(j,i,i+k-1) p[j] = j + k, vis[j+k]=1;
    FOR(j,n-2*k,n-k-1) p[j] = j + k, vis[j+k]=1;
    int r = i;
    FOR(j,i,n-1) {
      if (!p[j]) {
        while (vis[r]) ++r;
        p[j] = r++;
      }
    }
    FOR(j,i,n-1) cout << p[j]+1 << ' ';
  }
  cout << '\n';
}

int main() {
#ifndef MISAKA
  cin.tie(0);
  ios::sync_with_stdio(false);
#ifdef IOFILE
  freopen(IOFILE ".in", "r", stdin);
  freopen(IOFILE ".out", "w", stdout);
#endif
#endif
#ifdef MULTI
  int T;
  rd(T);
  while (T--)
#endif
  sol();
  return 0;
}

Submission Info

Judge Result