#909821 (C++23) No.2455 Numbers Dictionary

• 問題: No.2455 Numbers Dictionary
• ユーザー: risujiroh
• 提出日時: 2023-09-01 22:03:20
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 10 ms / 2,000 ms
• コード長: 2,782 bytes
• コンパイル時間: 3,464 ms
• コンパイル使用メモリ: 261,104 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-06-11 03:50:04
• 合計ジャッジ時間: 4,728 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	8 ms; 5,376 KB
testcase_03	AC	8 ms; 5,376 KB
testcase_04	AC	8 ms; 5,376 KB
testcase_05	AC	8 ms; 5,376 KB
testcase_06	AC	10 ms; 5,376 KB
testcase_07	AC	9 ms; 5,376 KB
testcase_08	AC	6 ms; 5,376 KB
testcase_09	AC	8 ms; 5,376 KB
testcase_10	AC	8 ms; 5,376 KB
testcase_11	AC	9 ms; 5,376 KB
testcase_12	AC	7 ms; 5,376 KB
testcase_13	AC	9 ms; 5,376 KB
testcase_14	AC	8 ms; 5,376 KB
testcase_15	AC	8 ms; 5,376 KB
testcase_16	AC	5 ms; 5,376 KB
testcase_17	AC	9 ms; 5,376 KB
testcase_18	AC	5 ms; 5,376 KB
testcase_19	AC	4 ms; 5,376 KB
testcase_20	AC	8 ms; 5,376 KB
testcase_21	AC	9 ms; 5,376 KB
testcase_22	AC	8 ms; 5,376 KB

ソースコード

#if __INCLUDE_LEVEL__ == 0

#include <bits/stdc++.h>

using namespace std;

#include __BASE_FILE__

namespace {

void solve() {
  static vector<int64_t> p10;
  if (p10.empty()) {
    p10 = {1};
    for (int _ = 18; _--;) {
      p10.push_back(p10.back() * 10);
    }
  }
  int64_t n, k;
  cin >> tie(n, k);
  int ki = ranges::upper_bound(p10, k) - p10.begin();
  int64_t ans = 0;
  for (int i : rep1(18)) {
    auto t = k;
    if (i < ki) {
      t /= p10[ki - i];
    }
    if (ki < i) {
      t *= p10[i - ki];
      --t;
    }
    ans += max(min(t, n) - p10[i - 1] + 1, int64_t(0));
  }
  print(ans);
}

}  // namespace

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}

#else  // __INCLUDE_LEVEL__

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = forward<U>(y), true);
}

namespace std {

template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
  return is >> p.first >> p.second;
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts...>& t) {
  return apply([&is](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

template <class... Ts>
istream& operator>>(istream& is, tuple<Ts&...>&& t) {
  return is >> t;
}

template <class R, enable_if_t<!is_convertible_v<R, string>>* = nullptr>
auto operator>>(istream& is, R&& r) -> decltype(is >> *begin(r)) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
  return os << p.first << ' ' << p.second;
}

template <class... Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
  auto f = [&os](const auto&... xs) -> ostream& {
    [[maybe_unused]] auto sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

template <class R, enable_if_t<!is_convertible_v<R, string_view>>* = nullptr>
auto operator<<(ostream& os, R&& r) -> decltype(os << *begin(r)) {
  auto sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

}  // namespace std

template <class... Ts>
void print(Ts&&... xs) {
  cout << tie(xs...) << '\n';
}

inline auto rep(int l, int r) { return views::iota(min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }
inline auto per(int l, int r) { return rep(l, r) | views::reverse; }
inline auto per(int n) { return per(0, n); }
inline auto per1(int l, int r) { return per(l, r + 1); }
inline auto per1(int n) { return per(1, n + 1); }

#endif  // __INCLUDE_LEVEL__