Submission #2558623

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using ll = long long;

// #undef DEBUG
// #define DEBUG
/// {{{ DEBUG --- ///
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { if(&o == &cerr) { o << '{'; for(size_t i = 0; i < v.size(); i++) o << v[i] << (i + 1 != v.size() ? ", " : ""); o << "}"; } else { for(size_t i = 0; i < v.size(); i++) o << v[i] << (i + 1 != v.size() ? " " : ""); } return o; }
#ifdef DEBUG
#define dump(...) (cerr<<"["<<__LINE__<< "] "<<#__VA_ARGS__<<" = "<<make_tuple(__VA_ARGS__)<<"\n")
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":", ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream &o, tuple<T...> const &t){ o << "("; _ot<0>(o, t); o << ")"; return o; }
#else
#define dump(...) (0)
#endif
/// }}}--- ///

const int N = 3e5 + 10;
ll a[N];

int main() {
  ios::sync_with_stdio(false), cin.tie(0);
  ll k, n; cin >> k >> n;
  a[0] = 1;
  for(int i = 1; i <= n; i++) {
    a[i] = a[i - 1] * k;
    if(a[i] > n) break;
  }
  for(int i = 1; i <= n; i++) if(a[i] != 0) a[i] += a[i - 1];
  vector<int> ans;
  if(k % 2 == 0) {
    ans.emplace_back(k / 2);
    for(int i = 0; i < n - 1; i++) ans.emplace_back(k);
  } else {
    ll bias = 0;
    for(int i = 0; i < n; i++) {
      if(a[n - 1 - i] == 0) {
        ans.emplace_back((k + 1) / 2);
        bias = -i;
      } else {
        int ok = k, ng = i ? -1 : 0;
        while(ok - ng > 1) {
          int mid = (ok + ng) >> 1;
          ll bf = !!i + a[n - 1 - i] * mid;
          ll af = bias + a[n - 1 - i] * (k - mid);
          if(bf >= af) ok = mid;
          else ng = mid;
        }
        dump(ok);
        if(ok == 0) break;
        ans.emplace_back(ok);
        ll bf = !!i + a[n - 1 - i] * ok;
        ll af = bias + a[n - 1 - i] * (k - ok);
        bias = af - (bf - a[n - 1 - i]);
      }
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result