結果
| 問題 | No.315 世界のなんとか3.5 |
| ユーザー |
 shimomire
|
| 提出日時 | 2015-12-08 03:57:44 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 1,103 ms / 2,000 ms |
| コード長 | 10,866 bytes |
| コンパイル時間 | 1,488 ms |
| コンパイル使用メモリ | 139,104 KB |
| 実行使用メモリ | 19,696 KB |
| 最終ジャッジ日時 | 2024-09-14 19:14:59 |
| 合計ジャッジ時間 | 16,354 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 7 ms
18,684 KB |
| testcase_01 | AC | 6 ms
18,688 KB |
| testcase_02 | AC | 7 ms
18,740 KB |
| testcase_03 | AC | 7 ms
18,776 KB |
| testcase_04 | AC | 6 ms
18,732 KB |
| testcase_05 | AC | 7 ms
18,792 KB |
| testcase_06 | AC | 6 ms
18,716 KB |
| testcase_07 | AC | 7 ms
18,788 KB |
| testcase_08 | AC | 7 ms
18,812 KB |
| testcase_09 | AC | 6 ms
18,788 KB |
| testcase_10 | AC | 8 ms
18,692 KB |
| testcase_11 | AC | 6 ms
18,796 KB |
| testcase_12 | AC | 258 ms
18,948 KB |
| testcase_13 | AC | 257 ms
18,984 KB |
| testcase_14 | AC | 501 ms
19,164 KB |
| testcase_15 | AC | 503 ms
19,120 KB |
| testcase_16 | AC | 511 ms
19,256 KB |
| testcase_17 | AC | 507 ms
19,104 KB |
| testcase_18 | AC | 256 ms
18,948 KB |
| testcase_19 | AC | 260 ms
18,936 KB |
| testcase_20 | AC | 260 ms
19,024 KB |
| testcase_21 | AC | 252 ms
18,980 KB |
| testcase_22 | AC | 499 ms
19,188 KB |
| testcase_23 | AC | 507 ms
19,268 KB |
| testcase_24 | AC | 510 ms
19,336 KB |
| testcase_25 | AC | 510 ms
19,128 KB |
| testcase_26 | AC | 509 ms
19,212 KB |
| testcase_27 | AC | 510 ms
19,112 KB |
| testcase_28 | AC | 503 ms
19,128 KB |
| testcase_29 | AC | 950 ms
19,624 KB |
| testcase_30 | AC | 963 ms
19,696 KB |
| testcase_31 | AC | 941 ms
19,616 KB |
| testcase_32 | AC | 1,011 ms
19,612 KB |
| testcase_33 | AC | 517 ms
19,312 KB |
| testcase_34 | AC | 1,001 ms
19,636 KB |
| testcase_35 | AC | 1,103 ms
19,584 KB |
コンパイルメッセージ
main.cpp: In function ‘ll Main::cnt(std::string, int)’:
main.cpp:179:56: warning: ‘pw’ may be used uninitialized in this function [-Wmaybe-uninitialized]
179 | vector<vector<vector<vector<ll>>>> ndp; ll pw;
| ^~
ソースコード
#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ALL(c) (begin(c)),(end(c))
#define REP(i,n) FOR(i,0,n)
#define REPr(i,n) FORr(i,0,n)
#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)
#define FORr(i,l,r) for(int i=(int)(r)-1;i>=(int)(l);--i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end())
//debug
#define DUMP(x) cerr << #x << " = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"
class range {
private:
struct Iter{
int v;
int operator*(){return v;}
bool operator!=(Iter& itr) {return v < itr.v;}
void operator++() {++v;}
};
Iter i, n;
public:
range(int n) : i({0}), n({n}) {}
range(int i, int n) : i({i}), n({n}) {}
Iter& begin() {return i;}
Iter& end() {return n;}
};
//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){is>>p.first>>p.second;return is;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){is >> get<0>(t);return is;}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){is >> get<0>(t) >> get<1>(t);return is;}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){is >>get<0>(t)>>get<1>(t)>>get<2>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t);return is;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> istream& operator >> (istream& is, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t) >> get<4>(t) >> get<5>(t) >> get<6>(t);return is;}
template<typename T> istream& operator >> (istream& is,vector<T>& as){REP(i,as.size())is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){os<<p.first<<" "<<p.second;return os;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){os << get<0>(t);return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){os << get<0>(t)<<" "<<get<1>(t);return os;}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t);return os;}
template<typename T1,typename T2,typename T3,typename T4,typename T5,typename T6,typename T7> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4,T5,T6,T7>& t){os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t)<<" "<<get<4>(t)<<" "<<get<5>(t)<<" "<<get<6>(t);return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){REP(i,as.size()){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){REP(i,as.size()){if(i!=0)os<<endl; os<<as[i];}return os;}
//input
char tmp[1000];
#define nextInt(n) scanf("%d",&n)
#define nextLong(n) scanf("%lld",&n) //I64d
#define nextDouble(n) scanf("%lf",&n)
#define nextChar(n) scanf("%c",&n)
#define nextString(n) scanf("%s",tmp);n=tmp
// values
template<typename T> T INF(){assert(false);};
template<> int INF<int>(){return 1<<28;};
template<> ll INF<ll>(){return 1LL<<58;};
template<> double INF<double>(){return 1e16;};
template<> long double INF<long double>(){return 1e16;};
template<class T> T EPS(){assert(false);};
template<> int EPS<int>(){return 1;};
template<> ll EPS<ll>(){return 1LL;};
template<> double EPS<double>(){return 1e-8;};
template<> long double EPS<long double>(){return 1e-8;};
template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}
template <ll M=(ll)1e9+7> class modU{
public:
inline ll pmod(ll v){return (v%M+M)%M;}
inline ll ainv(ll a){return pmod(-a);}
inline ll add(ll a,ll b){return pmod(a+b);}
inline ll mul(ll a,ll b){return pmod(a*b);}
ll pow(ll x, ll N){
ll res=1;
while(N>0){
if(N%2)res=mul(res,x);
x=mul(x,x);
N/=2;
}
return res;
}
//O(logM)
inline ll minv(ll a){return pow(a,M-2);}
// O(M)
vector<ll> minvs(){
vector<ll> inv(M + 1);inv[1] = 1;
for (int i = 2; i <= M; ++i)inv[i] = mul(inv[M % i],M - M / i);
return inv;
}
//O(N) 条件 N>=0
vector<ll> factmemo=vector<ll>(2000050,-1);
inline ll fact(const int N){
factmemo[0]=1;
int l = N; while(factmemo[l]==-1)l--;
for(int v:range(l,N)) factmemo[v+1]=mul(v+1,factmemo[v]);
return factmemo[N];
}
//条件 N>=0
inline ll nPr(const int N,const int r){
if(r>N)return 0;
return mul(fact(N),minv(fact(N-r)));
}
inline ll nCr(const int N,const int r){
if(N<0){
if(0 <= r) return (r%2?-1:+1)*nCr(-N +r-1,r);
else if(r<=N) return ((N-r)%2?-1:+1)*nCr(-r-1,N-r);
else return 0;
}
if(0<= r && r<=N) return mul(mul(fact(N),minv(fact(r))),minv(fact(N-r)));
return 0;
}
// O(N^2) (no mod N<=66)
vector<vector<ll>> nCrs(const int N){
vector<vector<ll>> c(N,vector<ll>(N,0));for(int i:range(0,N))c[i][0]=1;
for(int i :range(1,N))for(int j:range(1,N))
c[i][j] = add(c[i-1][j-1],c[i-1][j]);
return c;
}
};
ll MOD = 1e9+7;
// 下三桁
class Main{
public:
modU<> mu;
ll cnt(string s,int p){
// bounded されている？
vector<vector<vector<vector<ll>>>> dp(2,vector<vector<vector<ll>>>(3,vector<vector<ll>>(2,vector<ll>(8))));
dp[1][0][0][0]=1;
ll res = 0;
for(int i=0;i<s.size();i++){
if(i+p == s.size()){
for(int b=0;b<2;b++)for(int m3=0;m3<3;m3++)for(int ex3=0;ex3<2;ex3++)for(int m8=0;m8<8;m8++){
if((m3==0 || ex3) && m8==0)res+= MOD - dp[b][m3][ex3][m8],res%=MOD;
}
}
vector<vector<vector<vector<ll>>>> ndp; ll pw;
if(s.size()-p - 1 - i <=3 || i+p >= s.size()-1){
pw = mu.pow(10,min<int>(s.size()-p - 1 - i,3));
ndp = vector<vector<vector<vector<ll>>>>(2,vector<vector<vector<ll>>>(3,vector<vector<ll>>(2,vector<ll>(8))));
}else{
ndp = vector<vector<vector<vector<ll>>>>(2,vector<vector<vector<ll>>>(3,vector<vector<ll>>(2,vector<ll>(1))));
}
for(int v=0;v<=9;v++){
for(int b=0;b<2;b++)for(int m3=0;m3<3;m3++)for(int ex3=0;ex3<2;ex3++){
if(s.size()-p - 1 - i <=3 || i+p >= s.size()-1)for(int m8=0;m8<8;m8++){
if(v < s[i]-'0'){
ndp[0][(m3+v)%3][ex3 || v==3][(m8+v*pw)%8]+= dp[b][m3][ex3][m8];
ndp[0][(m3+v)%3][ex3 || v==3][(m8+v*pw)%8]%=MOD;
}else if(v == s[i]-'0'){
ndp[b][(m3+v)%3][ex3 || v==3][(m8+v*pw)%8]+= dp[b][m3][ex3][m8];
ndp[b][(m3+v)%3][ex3 || v==3][(m8+v*pw)%8]%=MOD;
}else if(v > s[i]-'0' && !b){
ndp[b][(m3+v)%3][ex3 || v==3][(m8+v*pw)%8]+= dp[b][m3][ex3][m8];
ndp[b][(m3+v)%3][ex3 || v==3][(m8+v*pw)%8]%=MOD;
}
}else{
if(v < s[i]-'0'){
ndp[0][(m3+v)%3][ex3 || v==3][0]+= dp[b][m3][ex3][0];
ndp[0][(m3+v)%3][ex3 || v==3][0]%=MOD;
}else if(v == s[i]-'0'){
ndp[b][(m3+v)%3][ex3 || v==3][0]+= dp[b][m3][ex3][0];
ndp[b][(m3+v)%3][ex3 || v==3][0]%=MOD;
}else if(v > s[i]-'0' && !b){
ndp[b][(m3+v)%3][ex3 || v==3][0]+= dp[b][m3][ex3][0];
ndp[b][(m3+v)%3][ex3 || v==3][0]%=MOD;
}
}
}
}
dp = ndp;
}
if(p == 0){
for(int b=0;b<2;b++)for(int m3=0;m3<3;m3++)for(int ex3=0;ex3<2;ex3++)for(int m8=0;m8<8;m8++){
if((m3==0 || ex3) && m8==0)res+= MOD - dp[b][m3][ex3][m8],res%=MOD;
}
}
for(int b=0;b<2;b++)for(int m3=0;m3<3;m3++)for(int ex3=0;ex3<2;ex3++)for(int m8=0;m8<8;m8++){
if((m3==0 || ex3)) res+= dp[b][m3][ex3][m8],res%=MOD;
}
return res;
}
void run(){
string a,b;cin >> a >> b; int p;cin >> p;
int d = p==800?2:p==80?1:0;
// -1
for(int i=a.size()-1;i>=0;i--){
if(a[i]=='0')a[i]='9';
else{
a[i]--;break;
}
}
cout << mu.pmod(cnt(b,d)-cnt(a,d))<<endl;
}
};
int main(){
cout <<fixed<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
Main().run();
return 0;
}