結果

問題 No.3136 F,B in FizzBuzzString16
ユーザー mihhiael
提出日時 2025-05-03 13:11:28
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 8,543 bytes
コンパイル時間 2,472 ms
コンパイル使用メモリ 168,788 KB
実行使用メモリ 6,272 KB
最終ジャッジ日時 2025-05-03 13:11:33
合計ジャッジ時間 3,506 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 7
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#if __has_include("all.h")
#include "all.h"
#else
// necessary for snippet
#include <algorithm>
#include <concepts>
#include <cstdint>
#include <ios>
#include <iostream>
#include <istream>
#include <limits>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <stdexcept>
#include <string>
#include <type_traits>
#include <utility>
#include <vector>
#include <atcoder/modint.hpp>
// often use
#include <map>
#endif

inline namespace {

using namespace std;
using ll = long long;
using pall = pair<ll, ll>;
template<class T> using vec = vector<T>;
template<class T> using veve = vec<vec<T>>;
using vell = vec<ll>;
using vest = vec<string>;
using vebo = basic_string<bool>;
using vevell = veve<ll>;
template<class T> using mset = multiset<T>;
template<class T> using priority_queue_ascend = priority_queue<T, vec<T>, decltype([](const T a, const T b) { return a > b; })>;
const ll inf = numeric_limits<ll>::max();
const string sp = " ";
const string lf = "\n";
const auto &npos = string::npos;
const vec<pall> grid_move4 = {
	{0, 1},
	{-1, 0},
	{0, -1},
	{1, 0}
};
const vec<pall> grid_move8 = [] {
	auto ret = grid_move4;
	ret.insert(ret.end(), {
		{-1, 1},
		{-1, -1},
		{1, -1},
		{1, 1}
	});
	return ret;
}();
constexpr ll MOD = 998244353;
// constexpr ll MOD = 1e9 + 7;
#define cont continue
#define br break
#define auot auto
#define whlie while
auto &ciN = cin;
auto &icn = cin;
auto &icN = cin;
constexpr bool ture = true;

using namespace atcoder;
using mint = static_modint<MOD>;

#define times(N) static_assert(is_integral_v<decltype((N) + 0)>, "times(): N must be integral"); for(typedef decltype((N) + 0) _int; [[maybe_unused]] const _int _i: views::iota((_int)0, (N)))
#define tiems times
#define itmes times

template<int M>
istream &operator>>(istream &in, static_modint<M> &i) {
	intmax_t tmp;
	in >> tmp;
	i = tmp;
	return in;
}
template<int M>
ostream &operator<<(ostream &out, const static_modint<M> &i) {
	return out << i.val();
}

template<class T, class U>
istream &operator>>(istream &in, pair<T, U> &p) {
	return in >> p.first >> p.second;
}
template<class T, class U>
ostream &operator<<(ostream &out, const pair<T, U> &p) {
	return out << p.first << sp << p.second;
}

template<class T>
istream &operator>>(istream &in, vec<T> &v) {
	for(auto &&e: v) {
		in >> e;
	}
	return in;
}

namespace myinput {
	template<class... Ts>
	istream &in(Ts&... vecs) {
		static_assert(sizeof...(vecs) != 0, "myfunc::in(): At least one vector must be provided");
		const set sizes = { vecs.size()... };
		if(sizes.size() > 1) {
			throw invalid_argument("myfunc::in(): All vectors must have the same size");
		}
		times(*sizes.begin()) {
			((cin >> vecs[_i]), ...);
		}
		return cin;
	}
}
using myinput::in;

ostream &out(const ranges::range auto &v, const string &delim, ostream &out = cout) {
	for(const auto &e: v) {
		out << e << delim;
	}
	return out;
}

[[nodiscard]] const string &yesno(const bool cond, const string &yes = "Yes", const string &no = "No") noexcept {
	if(cond) return yes;
	return no;
}

// [mi, ma)
[[nodiscard]] uint64_t randint(const uint64_t mi, const uint64_t ma) noexcept {
	static random_device seed;
	static mt19937_64 mt(seed());
	if(mi > ma) [[unlikely]] return randint(ma, mi);
	if(mi == ma) [[unlikely]] return mi;
	const uint64_t w = ma - mi;
	uint64_t r;
	do {
		r = mt();
	} while(mt.max() - mt.max() % w <= r);
	return r % w + mi;
}

template<class T, class U>
requires common_with<T, U>
[[nodiscard]] constexpr auto min(T &&a, U &&b) noexcept {
	return std::min<common_type_t<T, U>>(std::forward<T>(a), std::forward<U>(b));
}
template<class T, class U>
requires common_with<T, U>
[[nodiscard]] constexpr auto max(T &&a, U &&b) noexcept {
	return std::max<common_type_t<T, U>>(std::forward<T>(a), std::forward<U>(b));
}

template<class T>
[[nodiscard]] const T &min(const vec<T> &v) {
	return *ranges::min_element(v);
}
template<class T>
[[nodiscard]] const T &max(const vec<T> &v) {
	return *ranges::max_element(v);
}
template<class... Args>
[[nodiscard]] auto reduce(const ranges::range auto &v, Args... args) {
	return reduce(v.begin(), v.end(), args...);
}

[[nodiscard]] constexpr ll powll(ll a, ll b, const ll m = inf) {
	if(b < 0) [[unlikely]] throw invalid_argument("powll(): exponent less than zero");
	if(m < 1) [[unlikely]] throw invalid_argument("powll(): modulo less than one");
	a %= m;
	ll ret = 1;
	while(b) {
		if(b % 2) ret *= a, ret %= m;
		a *= a, a %= m;
		b /= 2;
	}
	return ret;
}

template<class T, class U>
requires assignable_from<T&, U> && totally_ordered_with<T, U>
bool mini(T &var, U &&val) noexcept {
	const bool cmp = var > val;
	if(cmp) var = val;
	return cmp;
}
template<class T, class U>
requires assignable_from<T&, U> && totally_ordered_with<T, U>
bool maxi(T &var, U &&val) noexcept {
	const bool cmp = var < val;
	if(cmp) var = val;
	return cmp;
}

namespace myclass {
	class [[nodiscard]] grid_base {
		public:
		grid_base(const ll h, const ll w) noexcept : height(h), width(w) {}

		[[nodiscard]] ll operator()(const ll i, const ll j) const noexcept {
			if(!isvalid(i, j)) return -1;
			return i * width + j;
		}

		[[nodiscard]] ll operator()(const pall &p) const noexcept {
			return (*this)(p.first, p.second);
		}

		protected:
		bool isvalid(const ll i, const ll j) const noexcept {
			return 0 <= i && 0 <= j && i < height && j < width;
		}
		const ll height, width;
	};

	class [[nodiscard]] grid_seen : public myclass::grid_base {
		public:
		grid_seen(const ll h, const ll w) : grid_base(h, w) {
			visited = vebo(h * w, false);
		}

		[[nodiscard]] bool &seen(const ll i, const ll j) & {
			if(!isvalid(i, j)) [[unlikely]] throw out_of_range("grid::seen(): out of range");
			return visited[i * width + j];
		}

		[[nodiscard]] bool &seen(const pall &p) & {
			return seen(p.first, p.second);
		}

		private:
		vebo visited;
	};
}

using grid_lite = myclass::grid_base;
using myclass::grid_seen;

template<class T>
auto erase_single(mset<T> &mset, T &&v) {
	const auto it = mset.find(v);
	if(it == mset.end()) [[unlikely]] throw invalid_argument("erase_single(): why v not in mset!?!?");
	return mset.erase(it);
}

}

void solve();

int main(void) {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	solve();
	return 0;
}

#include <sstream>

std::string to_hex_string(int64_t i) {
    std::stringstream s;
    s << std::uppercase << std::hex << i;
    return s.str();
}

std::string FizzBuzz16(int64_t i) {
    if (i % 15 == 0) {
        return "FizzBuzz";
    } else if (i % 3 == 0) {
        return "Fizz";
    } else if (i % 5 == 0) {
        return "Buzz";
    } else {
        return to_hex_string(i);
    }
}

ll mulcnt(const ll k, const ll mi, const ll ma) {
	return ma / k - (mi - 1) / k;
}

void solve() {
	ll x, y;
	cin >> x >> y;
	const auto cnt = [](const ll n) {
		if(n == 0) return 0ll;
		ll ans = 0;
		ll ok = 0, ng = 1e12;
		ll lstl = n;
		while(abs(ok - ng) > 1) {
			const ll mid = midpoint(ok, ng);
			ll l = 0;
			l += 4 * (mid / 3); // fizz
			l += 4 * (mid / 5); // buzz
			for(intmax_t i=1;i<=intmax_t(12);i++) {
				if(powll(16, i - 1) > mid) br;
				const ll cnt = mulcnt(1, powll(16, i - 1), min(mid, powll(16, i) - 1))
				             - mulcnt(3, powll(16, i - 1), min(mid, powll(16, i) - 1))
				             - mulcnt(5, powll(16, i - 1), min(mid, powll(16, i) - 1))
				             + mulcnt(15, powll(16, i - 1), min(mid, powll(16, i) - 1));
				l += i * cnt;
			}
			if(l <= n) {
				ok = mid;
				lstl = n - l;
			} else {
				ng = mid;
			}
		}
		const string lst = FizzBuzz16(ng);
		ans += ok / 3 + ok / 5;
		tiems(lstl) ans += ll(lst[_i] == 'F' || lst[_i] == 'B');
		{
			vec dp(11, vec(151, vell(11)));
			{
				ll js = 0, ks = 0;
				for(intmax_t i=1;i<=intmax_t(10);i++) {
					const ll d = (ok >> (4 * (10 - i))) % 16;
					for(intmax_t l=0;l<intmax_t(d);l++) {
						dp[i][js + l][ks + ll(l == 0xB)]++;
					}
					js += d;
					ks += d == 0xB || d == 0xF;
				}
				dp[10][js][ks]++;
			}
			for(intmax_t i=0;i<intmax_t(10);i++) {
				for(intmax_t j=0;j<intmax_t(150);j++) {
					for(intmax_t k=0;k<intmax_t(10);k++) {
						for(intmax_t d=0;d<intmax_t(0x10);d++) {
							if(j + d > 150) br;
							dp[i + 1][j + d][k + (d == 0xB || d == 0xF)] += dp[i][j][k];
						}
					}
				}
			}
			for(intmax_t j=0;j<=intmax_t(150);j++) {
				if(j % 3 == 0 || j % 5 == 0) cont;
				for(intmax_t k=1;k<=intmax_t(10);k++) {
					ans += dp[10][j][k] * k;
				}
			}
		}
		return ans;
	};
	// clog << cnt(y) << sp << cnt(x - 1) << endl;
	cout << cnt(y) - cnt(x - 1);
}
0