#169990 (C++14) No.372 It's automatic

• 問題: No.372 It's automatic
• ユーザー: 小指が強い人
• 提出日時: 2017-04-30 15:18:09
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 2,747 ms / 6,000 ms
• コード長: 2,549 bytes
• コンパイル時間: 2,052 ms
• コンパイル使用メモリ: 175,244 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-13 23:48:56
• 合計ジャッジ時間: 36,425 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2,708 ms; 5,376 KB
testcase_05	AC	2,738 ms; 5,376 KB
testcase_06	AC	2,726 ms; 5,376 KB
testcase_07	AC	2,744 ms; 5,376 KB
testcase_08	AC	2,747 ms; 5,376 KB
testcase_09	AC	2,740 ms; 5,376 KB
testcase_10	AC	2,740 ms; 5,376 KB
testcase_11	AC	2,707 ms; 5,376 KB
testcase_12	AC	2,744 ms; 5,376 KB
testcase_13	AC	2,714 ms; 5,376 KB
testcase_14	AC	2,740 ms; 5,376 KB
testcase_15	AC	2,747 ms; 5,376 KB
testcase_16	AC	2 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	2 ms; 5,376 KB
testcase_21	AC	140 ms; 5,376 KB
testcase_22	AC	140 ms; 5,376 KB
testcase_23	AC	138 ms; 5,376 KB
testcase_24	AC	139 ms; 5,376 KB
testcase_25	AC	139 ms; 5,376 KB

ソースコード

#include "bits/stdc++.h"
#include <gmp.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<ll> vecll;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < (ll)n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= (ll)a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T, class ...Args> void read(T& a, Args&... args){cin >> a; read(args...);} 
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<char c = ' ',class T> void write(T a){cout << setprecision(12) << a << endl;}
template<char c = ' ',class T,class ...Args> void write(T a, Args... args){cout << setprecision(12) << a << c; write<c>(args...);}
template<class T> void warr(vector<T> a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;}
template<class T> void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}

int main(void)
{
    string s;
    int m,n;
    read(s,m);
    n=s.size();
    ll res=0;
    vector<int> dp(m+5);
    vector<int> tmp(m+5);
    rep(i,n){
        int ci=s[i]-'0';
        fill(tmp.begin(),tmp.end(),0);
        rep(j,m){
            int &t1=tmp[(j*10+ci)%m];
            int &t2=tmp[j];
            t1=(t1+dp[j])%MD;
            t2=(t2+dp[j])%MD;
            if(t1>=MD)t1-=MD;
            if(t2>=MD)t2-=MD;
        }
        if(ci>0)tmp[ci%m]+=1;
        else res++;
        swap(dp,tmp);
    }
    write((dp[0]+res)%MD);
    return 0;
}