結果

問題 No.1651 Removing Cards
ユーザー ir5ir5
提出日時 2024-06-23 02:42:40
言語 C++23(gcc13)
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 562 ms / 2,000 ms
コード長 3,763 bytes
コンパイル時間 4,960 ms
コンパイル使用メモリ 150,780 KB
実行使用メモリ 8,536 KB
最終ジャッジ日時 2024-06-23 02:42:59
合計ジャッジ時間 18,288 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 116 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 182 ms
5,376 KB
testcase_10 AC 187 ms
5,376 KB
testcase_11 AC 175 ms
5,376 KB
testcase_12 AC 180 ms
5,376 KB
testcase_13 AC 183 ms
5,376 KB
testcase_14 AC 181 ms
5,376 KB
testcase_15 AC 546 ms
8,412 KB
testcase_16 AC 514 ms
8,284 KB
testcase_17 AC 545 ms
8,416 KB
testcase_18 AC 503 ms
8,304 KB
testcase_19 AC 536 ms
8,412 KB
testcase_20 AC 515 ms
8,412 KB
testcase_21 AC 532 ms
8,408 KB
testcase_22 AC 530 ms
8,288 KB
testcase_23 AC 185 ms
5,376 KB
testcase_24 AC 143 ms
5,376 KB
testcase_25 AC 509 ms
8,284 KB
testcase_26 AC 467 ms
8,288 KB
testcase_27 AC 557 ms
8,416 KB
testcase_28 AC 531 ms
8,284 KB
testcase_29 AC 547 ms
8,416 KB
testcase_30 AC 562 ms
8,280 KB
testcase_31 AC 555 ms
8,536 KB
testcase_32 AC 162 ms
5,376 KB
testcase_33 AC 158 ms
5,376 KB
testcase_34 AC 166 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <functional>
#include <iomanip>
using namespace std;
using ll = long long;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n_):i({0}),n({n_}){}range(int i_,int n_):i({i_}),n({n_}){}I& begin(){return i;}I& end(){return n;}};

template<typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> void take(vector<T>& vec, int n) { vec.resize(n); for (int i = 0; i < n; ++i) cin >> vec[i]; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

namespace solver {

template<typename T1, typename T2> struct In2 {
  T1 a; T2 b;
  friend std::istream& operator>>(std::istream& is, In2& obj) { T1 t1; T2 t2; is >> t1 >> t2; obj = {t1, t2}; return is; }
};

template<typename T1, typename T2, typename T3> struct In3 {
  T1 a; T2 b; T3 c;
  friend std::istream& operator>>(std::istream& is, In3& obj) { T1 t1; T2 t2; T3 t3; is >> t1 >> t2 >> t3; obj = {t1, t2, t3}; return is; }
};

map<ll, ll> memo;
ll f(ll n, ll k) {
  if (memo.count(n)) return memo[n];
  if (n == 1) return 0;
  ll t = f(n - ((n - 1) / k) - 1, k);
  // return memo[n] = t + (t / (k - 1)) + 1;
  return memo[n] = (k * t / (k - 1)) + 1;
}

ll naive(ll n, ll k) {
  vector<ll> vs(n);
  for (ll i : range(n)) vs[i] = i;
  while (vs.size() > 1) {
    vector<ll> next;
    for (ll i : range(vs.size())) if (i % k != 0) next.push_back(vs[i]);
    vs = next;
  }
  return vs[0];
}

void experiment() {
  ll k = 3000;
  vector<ll> jumps;
  for (ll n : range(1, 100000)) {
    if (f(n, k) == n - 1) {
      jumps.push_back(n);
    }
  }
  dump(jumps.size());
  // for (ll i : range(jumps.size() - 1)) dump(jumps[i + 1] / k + 1 << " " << (jumps[i + 1] - jumps[i]));
  // for (ll i : range(jumps.size() - 1)) dump(i << " " << jumps[i + 1] - jumps[i]);

  // for (ll n : range(1, 100)) dump(n << " " << f(n, k) << " " << naive(n, k));
}

ll k, q;
vector<ll> vs;

void read() {
  cin >> k >> q;
  take(vs, q);
}

using RetType = void;

RetType run() {
  vector<ll> ns = {1};
  ll nmax = 1LL << 60;
  while (1) {
    ll nprev = ns.back();

    ll lo = nprev, hi = nmax;
    if (hi - hi / k <= nprev) break;
    while (hi - lo > 1) {
      ll n = (hi + lo) / 2;
      if (n - 1 - (n - 1) / k < nprev) lo = n;
      else hi = n;
    }
    ns.push_back(hi);
  }
  dump(ns.size());

  dump(ns);

  for (ll x : vs) {
    auto it = lower_bound(ns.begin(), ns.end(), x + 1);
    it--;
    cout << *it << endl;
  }
}

}  // namespace

template <typename F>
void run(F f) { if constexpr (std::is_same_v<decltype(f()), void>) f(); else cout << f() << endl; }

int main(int argc, char** argv) {
  // solver::experiment();
  cerr << fixed << setprecision(12);
  cout << fixed << setprecision(12);
  int testcase = 1;
  if (argc > 1) testcase = atoi(argv[1]);
  while (testcase--) {
    solver::read();
  }
  run(solver::run);
}
0