#660036 (C++17) No.1417 100の倍数かつ正整数(2)

提出ソース

結果

問題	No.1417 100の倍数かつ正整数(2)
ユーザー	tkmst201
提出日時	2021-05-23 09:38:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	154 ms / 3,000 ms
コード長	4,223 bytes
コンパイル時間	2,119 ms
コンパイル使用メモリ	203,676 KB
実行使用メモリ	59,628 KB
最終ジャッジ日時	2024-04-19 20:27:43
合計ジャッジ時間	3,971 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	2 ms 6,812 KB
testcase_02	AC	3 ms 6,816 KB
testcase_03	AC	1 ms 6,944 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	2 ms 6,944 KB
testcase_09	AC	2 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	2 ms 6,940 KB
testcase_12	AC	2 ms 6,940 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	2 ms 6,940 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,940 KB
testcase_17	AC	2 ms 6,944 KB
testcase_18	AC	3 ms 6,944 KB
testcase_19	AC	3 ms 6,940 KB
testcase_20	AC	3 ms 6,940 KB
testcase_21	AC	3 ms 6,940 KB
testcase_22	AC	3 ms 6,944 KB
testcase_23	AC	3 ms 6,940 KB
testcase_24	AC	2 ms 6,944 KB
testcase_25	AC	3 ms 6,940 KB
testcase_26	AC	3 ms 6,940 KB
testcase_27	AC	3 ms 6,940 KB
testcase_28	AC	3 ms 6,940 KB
testcase_29	AC	3 ms 6,940 KB
testcase_30	AC	12 ms 7,808 KB
testcase_31	AC	13 ms 9,216 KB
testcase_32	AC	29 ms 14,720 KB
testcase_33	AC	70 ms 31,744 KB
testcase_34	AC	137 ms 58,328 KB
testcase_35	AC	141 ms 59,616 KB
testcase_36	AC	142 ms 59,624 KB
testcase_37	AC	154 ms 59,496 KB
testcase_38	AC	131 ms 59,628 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

/**
 * @brief https://tkmst201.github.io/Library/Mathematics/ModInt.hpp
 */
template<int M>
struct ModInt {
	static_assert(M > 0);
	
	using value_type = int;
	using calc_type = std::int_fast64_t;
	
private:
	value_type val_;
	
public:
	constexpr ModInt(calc_type val = 0) : val_(val < 0 ? (val % M + M) % M : val % M) {}
	constexpr value_type val() const noexcept { return val_; }
	constexpr static decltype(M) mod() noexcept { return M; }
	
	explicit constexpr operator bool() const noexcept { return val_; }
	constexpr bool operator !() const noexcept { return !static_cast<bool>(*this); }
	constexpr ModInt operator +() const noexcept { return *this; }
	constexpr ModInt operator -() const noexcept { return ModInt(-val_); }
	constexpr ModInt operator ++(int) noexcept { ModInt res = *this; ++*this; return res; }
	constexpr ModInt operator --(int) noexcept { ModInt res = *this; --*this; return res; }
	constexpr ModInt & operator ++() noexcept { val_ = val_ + 1 == M ? 0 : val_ + 1; return *this; }
	constexpr ModInt & operator --() noexcept { val_ = val_ == 0 ? M - 1 : val_ - 1; return *this; }
	constexpr ModInt & operator +=(const ModInt & rhs) noexcept { val_ += val_ < M - rhs.val_ ? rhs.val_ : rhs.val_ - M; return *this; }
	constexpr ModInt & operator -=(const ModInt & rhs) noexcept { val_ += val_ >= rhs.val_ ? -rhs.val_ : M - rhs.val_; return *this; }
	constexpr ModInt & operator *=(const ModInt & rhs) noexcept { val_ = static_cast<calc_type>(val_) * rhs.val_ % M; return *this; }
	constexpr ModInt & operator /=(const ModInt & rhs) noexcept { return *this *= rhs.inv(); }
	friend constexpr ModInt operator +(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) += rhs; }
	friend constexpr ModInt operator -(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) -= rhs; }
	friend constexpr ModInt operator *(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) *= rhs; }
	friend constexpr ModInt operator /(const ModInt & lhs, const ModInt & rhs) noexcept { return ModInt(lhs) /= rhs; }
	friend constexpr bool operator ==(const ModInt & lhs, const ModInt & rhs) noexcept { return lhs.val_ == rhs.val_; }
	friend constexpr bool operator !=(const ModInt & lhs, const ModInt & rhs) noexcept { return !(lhs == rhs); }
	friend std::ostream & operator <<(std::ostream & os, const ModInt & rhs) { return os << rhs.val_; }
	friend std::istream & operator >>(std::istream & is, ModInt & rhs) { calc_type x; is >> x; rhs = ModInt(x); return is; }
	
	constexpr ModInt pow(calc_type n) const noexcept {
		ModInt res = 1, x = val_;
		if (n < 0) { x = x.inv(); n = -n; }
		while (n) { if (n & 1) res *= x; x *= x; n >>= 1; }
		return res;
	}
	
	constexpr ModInt inv() const noexcept {
		value_type a = val_, a1 = 1, b = M, b1 = 0;
		while (b > 0) {
			value_type q = a / b, r = a % b;
			value_type nb1 = a1 - q * b1;
			a = b; b = r;
			a1 = b1; b1 = nb1;
		}
		assert(a == 1);
		return a1;
	}
};
using mint = ModInt<MOD>;

int main() {
	string S;
	cin >> S;
	const int N = S.size();
	
	// [i][mod100 (100: leading-zero, 101: zero)][ismax]
	vector dp(N + 1, vector(102, vector<mint>(2)));
	dp[N][0][true] = 1;
	dp[N][0][false] = 1;
	
	for (int i = N - 1; i >= 0; --i) {
		REP(m, 102) {
			REP(ism, 2) {
				const int ma = ism ? S[i] - '0' : 9;
				REP(k, ma + 1) {
					mint & cur = dp[i][m][ism];
					if (m == 100) cur += dp[i + 1][k == 0 ? 100 : k][ism & (k == ma)];
					else if (m == 101) cur += dp[i + 1][m][ism & (k == ma)];
					else cur += dp[i + 1][k == 0 ? 101 : (m * k) % 100][ism & (k == ma)];
				}
			}
		}
	}
	cout << dp[0][100][true] << endl;
}

yukicoder

結果

テストケース

ソースコード