結果

問題 No.189 SUPER HAPPY DAY
ユーザー heno239heno239
提出日時 2020-08-15 08:35:30
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 17 ms / 5,000 ms
コード長 3,547 bytes
コンパイル時間 1,384 ms
コンパイル使用メモリ 118,224 KB
実行使用メモリ 20,096 KB
最終ジャッジ日時 2024-10-10 17:17:10
合計ジャッジ時間 2,466 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
20,036 KB
testcase_01 AC 8 ms
20,096 KB
testcase_02 AC 7 ms
19,968 KB
testcase_03 AC 7 ms
19,968 KB
testcase_04 AC 8 ms
20,036 KB
testcase_05 AC 7 ms
20,040 KB
testcase_06 AC 9 ms
20,040 KB
testcase_07 AC 8 ms
19,968 KB
testcase_08 AC 8 ms
20,096 KB
testcase_09 AC 8 ms
20,036 KB
testcase_10 AC 8 ms
19,968 KB
testcase_11 AC 7 ms
20,036 KB
testcase_12 AC 7 ms
19,908 KB
testcase_13 AC 11 ms
20,096 KB
testcase_14 AC 12 ms
19,908 KB
testcase_15 AC 11 ms
19,968 KB
testcase_16 AC 13 ms
20,040 KB
testcase_17 AC 12 ms
19,968 KB
testcase_18 AC 12 ms
20,036 KB
testcase_19 AC 13 ms
19,968 KB
testcase_20 AC 9 ms
19,908 KB
testcase_21 AC 10 ms
19,968 KB
testcase_22 AC 8 ms
19,968 KB
testcase_23 AC 12 ms
20,096 KB
testcase_24 AC 12 ms
19,908 KB
testcase_25 AC 17 ms
19,908 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000009;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

vector<modint> calc(string s) {
	vector<vector<modint>> dp(2001, vector<modint>(2));
	vector<vector<modint>> cop = dp;
	dp[0][0] = 1;
	rep(i, s.size()) {
		int val = s[i] - '0';
		rep(j, 2001)rep(k, 2)cop[j][k] = 0;
		rep(j, 2001)rep(k,2) {
			if (dp[j][k] == (modint)0)continue;
			rep(to, 10) {
				int nj = j + to;
				int nk = k;
				if (k == 0 && val < to)continue;
				if (to < val)nk = 1;
				cop[nj][nk] += dp[j][k];
			}
		}
		swap(dp, cop);
	}
	vector<modint> res(2001);
	rep(i, 2001) {
		res[i] = dp[i][0] + dp[i][1];
	}
	return res;
}
void solve() {
	string s, t; cin >> s >> t;
	vector<modint> a = calc(s), b = calc(t);
	modint ans = 0;
	rep(i, 2001)ans += a[i] * b[i]; ans -= 1;
	cout << ans << "\n";
}





signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0