結果

問題 No.189 SUPER HAPPY DAY
ユーザー is_eri23
提出日時 2015-04-22 11:11:36
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 17 ms / 5,000 ms
コード長 4,484 bytes
コンパイル時間 1,327 ms
コンパイル使用メモリ 160,392 KB
実行使用メモリ 13,348 KB
最終ジャッジ日時 2024-07-05 00:09:00
合計ジャッジ時間 2,337 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000009LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); 
    deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << 
    (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain 
    == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << 
    "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;
bool month_memo2[205][2];
bool day_memo2[205][2];
ll month_memo[205][2][2500];
ll day_memo[205][2][2500];
string month,day;
void dp_go(int now, bool free){
  if (now == sz(month)) {
    month_memo[now][free][0] = 1;
    return;
  }
  if (month_memo2[now][free]) {
    return;
  }
  month_memo2[now][free] = true;
  dp_go(now+1, true);
  dp_go(now+1, false);
  if (free) {
    for (int j = 0; j < 2500; j++) {
      if (month_memo[now+1][true][j] > 0) {
        for (int x = 0; x < 10; x++) {//今の数字
          month_memo[now][free][j+x] += month_memo[now+1][true][j];
          month_memo[now][free][j+x] %= MOD;
        }
      }
    }
  }else{
    for (int j = 0; j < 2500; j++) {
      if (month_memo[now+1][true][j] > 0) {
        for (int x = 0; x < month[now] - '0' ; x++) {//今の数字
          month_memo[now][free][j+x] += month_memo[now+1][true][j];
          month_memo[now][free][j+x] %= MOD;
        }
      }
      if (month_memo[now+1][false][j] > 0) {
        month_memo[now][free][j+month[now]-'0'] += month_memo[now+1][false][j];
        month_memo[now][free][j+month[now]-'0'] %= MOD;
      }
    }
  }    
  return;
}
void dp_go2(int now, bool free){
  if (now == sz(day)) {
    day_memo[now][free][0] = 1;
    return;
  }
  if (day_memo2[now][free]) {
    return;
  }
  day_memo2[now][free] = true;
  dp_go2(now+1, true);
  dp_go2(now+1, false);
  if (free) {
    for (int j = 0; j < 2500; j++) {
      if (day_memo[now+1][true][j] > 0) {
        for (int x = 0; x < 10; x++) {//今の数字
          day_memo[now][free][j+x] += day_memo[now+1][true][j];
          day_memo[now][free][j+x] %= MOD;
        }
      }
    }
  }else{
    for (int j = 0; j < 2500; j++) {
      if (day_memo[now+1][true][j] > 0) {
        for (int x = 0; x < day[now] - '0'; x++) {//今の数字
          day_memo[now][free][j+x] += day_memo[now+1][true][j];
          day_memo[now][free][j+x] %= MOD;
        }
      }
      if (day_memo[now+1][false][j] > 0) {
        day_memo[now][free][j+day[now]-'0'] += day_memo[now+1][false][j];
        day_memo[now][free][j+day[now]-'0'] %= MOD;
      }
    }
  }    
  return;
}
int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> month >> day;
  dp_go(0, false);
  dp_go2(0, false);
  ll ans = 0;
  for (int j = 1; j < 2500; j++) {
    //DEBUG3(j,day_memo[0][false][j],month_memo[0][false][j]);
    ans += (day_memo[0][false][j] * month_memo[0][false][j] % MOD);
    ans %= MOD;
  }
  cout << ans << endl;
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0