結果

問題 No.3136 F,B in FizzBuzzString16
コンテスト
ユーザー akiaa11
提出日時 2025-05-05 18:51:24
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 5,286 bytes
コンパイル時間 4,437 ms
コンパイル使用メモリ 266,004 KB
実行使用メモリ 7,848 KB
最終ジャッジ日時 2025-05-05 18:51:30
合計ジャッジ時間 5,861 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 7
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<int(n);++i)
#define rep2(i,a,n) for(int i=int(a);i<int(n);++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	auto f = [&](ll x){
		if(!x) return 0LL;
		auto f2 = [&](ll k){
			ll res = 0, c = 1, sz = 1;
			vecll cnt(3);
			while(c <= k){
				ll r = min(k, c * 16 - 1);
				vecll ncnt = {r / 15, r / 3 - r / 15, r / 5 - r / 15};
				ll sum = r - c + 1;
				rep(i, 3){
					res += (ncnt[i] - cnt[i]) * (!i ? 8 : 4);
					sum -= ncnt[i] - cnt[i];
				}
				res += sum * sz;
				c = r + 1;
				swap(cnt, ncnt);
				sz++;
			}
			return res;
		};
		ll p = 1;
		rep(i, 2, 270){
			ll r = f2(i);
			if(i % 15 == 0) p += 8;
			else if(i % 3 == 0) p += 4;
			else if(i % 5 == 0) p += 4;
			else{
				ll c = i;
				while(c){
					p++;
					c /= 16;
				}
			}
			assert(p == r);
		}
		ll l = 0, r = 1e12;
		while(r - l > 1){
			ll mid = (l + r) / 2;
			if(f2(mid) <= x) l = mid;
			else r = mid;
		}
		ll res = 0;
		{
			veci a;
			ll c = l;
			while(c){
				a.push_back(c % 16);
				c /= 16;
			}
			reverse(all(a));
			vector dp(a.size() + 1, vector(15, vecll(2)));
			auto Ps = [&](ll x){return x == 15 || x == 11;};
			rep(i, 1, a[0]) dp[Ps(i)][i % 15][0] = 1;
			dp[Ps(a[0])][a[0] % 15][1] = 1;
			rep(i, 1, a.size()){
				vector ndp(a.size() + 1, vector(15, vecll(2)));
				rep(j, a.size() + 1) rep(k, 15) rep(l, 2) if(dp[j][k][l]){
					assert(j + Ps(a[i]) <= a.size());
					if(l){
						ndp[j + Ps(a[i])][(k + a[i]) % 15][l] += dp[j][k][l];
						rep(r, a[i]) ndp[j + Ps(r)][(k + r) % 15][0] += dp[j][k][l];
					}else{
						rep(r, 16) ndp[j + Ps(r)][(k + r) % 15][0] += dp[j][k][l];
					}
				}
				swap(dp, ndp);
				rep(j, 1, 16) dp[Ps(j)][j % 15][0]++;
			}
			rep(i, a.size() + 1) rep(j, 15) rep(k, 2){
				if(!j) res += dp[i][j][k] * 2;
				else if(j % 3 == 0 || j % 5 == 0) res += dp[i][j][k];
				else res += dp[i][j][k] * i;
			}
		}
		{
			x -= f2(l);
			l++;
			if(l % 15 == 0) res += (x >= 5 ? 2 : (x ? 1 : 0));
			else if(l % 3 == 0 || l % 5 == 0) res += x > 0;
			else{
				veci a;
				while(l){
					a.push_back(l % 16);
					l /= 16;
				}
				reverse(all(a));
				rep(i, x) res += a[i] == 11 || a[i] == 15;
			}
		}
		return res;
	};
	ll l, r;cin>>l>>r;
	cout<<f(r) - f(l - 1)<<endl;
}
0