結果
問題 | No.315 世界のなんとか3.5 |
ユーザー | holeguma |
提出日時 | 2015-12-10 00:26:07 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 751 ms / 2,000 ms |
コード長 | 4,654 bytes |
コンパイル時間 | 2,213 ms |
コンパイル使用メモリ | 75,432 KB |
実行使用メモリ | 59,084 KB |
最終ジャッジ日時 | 2023-10-13 09:46:44 |
合計ジャッジ時間 | 15,495 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,308 KB |
testcase_01 | AC | 43 ms
49,304 KB |
testcase_02 | AC | 43 ms
49,392 KB |
testcase_03 | AC | 42 ms
49,232 KB |
testcase_04 | AC | 43 ms
49,128 KB |
testcase_05 | AC | 43 ms
49,308 KB |
testcase_06 | AC | 43 ms
49,140 KB |
testcase_07 | AC | 43 ms
49,664 KB |
testcase_08 | AC | 44 ms
49,536 KB |
testcase_09 | AC | 43 ms
49,552 KB |
testcase_10 | AC | 43 ms
49,180 KB |
testcase_11 | AC | 43 ms
49,316 KB |
testcase_12 | AC | 316 ms
56,124 KB |
testcase_13 | AC | 225 ms
53,760 KB |
testcase_14 | AC | 442 ms
56,344 KB |
testcase_15 | AC | 407 ms
56,360 KB |
testcase_16 | AC | 392 ms
56,304 KB |
testcase_17 | AC | 404 ms
56,292 KB |
testcase_18 | AC | 286 ms
55,548 KB |
testcase_19 | AC | 312 ms
56,292 KB |
testcase_20 | AC | 320 ms
56,292 KB |
testcase_21 | AC | 364 ms
56,524 KB |
testcase_22 | AC | 460 ms
57,268 KB |
testcase_23 | AC | 358 ms
54,288 KB |
testcase_24 | AC | 462 ms
56,736 KB |
testcase_25 | AC | 450 ms
56,620 KB |
testcase_26 | AC | 527 ms
56,880 KB |
testcase_27 | AC | 468 ms
56,324 KB |
testcase_28 | AC | 448 ms
57,356 KB |
testcase_29 | AC | 622 ms
58,412 KB |
testcase_30 | AC | 651 ms
58,980 KB |
testcase_31 | AC | 583 ms
57,712 KB |
testcase_32 | AC | 721 ms
59,084 KB |
testcase_33 | AC | 368 ms
55,720 KB |
testcase_34 | AC | 529 ms
56,584 KB |
testcase_35 | AC | 751 ms
59,056 KB |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static final long MOD=(long)1e9+7; static void solve(){ char[] a=minusOne(ir.next().toCharArray()); char[] b=ir.next().toCharArray(); int p=ir.nextInt(); out.println((calc(b,p)-calc(a,p)+MOD)%MOD); } public static long calc(char[] s,int p){ int dig=Integer.toString(p).length(); long[][][][][] dp=new long[2][2][2][3][9]; dp[0][0][0][0][8]=1; for(int i=0;i<s.length;i++){ int now=i%2,next=now^1,num=s[i]-'0'; for(int j=0;j<2;j++){ for(int k=0;k<=(j==0?num:9);k++){ for(int l=0;l<2;l++){ int next_j=j|((k==num)?0:1),next_l=l|((k==3)?1:0); for(int m3=0;m3<3;m3++){ int nm3=(m3+k)%3; if(i>s.length-dig-3){ for(int m8=0;m8<=8;m8++){ if(i>s.length-dig){ if(m8==0&&k==0) dp[next][next_j][next_l][nm3][0]=(dp[next][next_j][next_l][nm3][0]+dp[now][j][l][m3][0])%MOD; else dp[next][next_j][next_l][nm3][1]=(dp[next][next_j][next_l][nm3][1]+dp[now][j][l][m3][m8])%MOD; } else{ int nm8=(m8+(int)Math.pow(10,s.length-dig-i)*k)%8; dp[next][next_j][next_l][nm3][nm8]=(dp[next][next_j][next_l][nm3][nm8]+dp[now][j][l][m3][m8])%MOD; } } } else dp[next][next_j][next_l][nm3][8]=(dp[next][next_j][next_l][nm3][8]+dp[now][j][l][m3][8])%MOD; } } } } for(int j=0;j<2;j++){ for(int k=0;k<2;k++){ for(int l=0;l<3;l++){ Arrays.fill(dp[now][j][k][l],0); } } } } long ret=0; for(int i=0;i<2;i++){ for(int j=0;j<2;j++){ for(int k=0;k<3;k++){ for(int l=0;l<=8;l++){ if((j==1||k==0)&&l!=0) ret=(ret+dp[s.length%2][i][j][k][l])%MOD; } } } } return (int)(ret+(MOD-1))%MOD; } public static char[] minusOne(char[] s){ char[] ret=new char[s.length]; boolean f=false; for(int i=s.length-1;i>=0;i--){ if(!f){ if(s[i]!='0'){ ret[i]=(char)(s[i]-1); f=true; } else ret[i]='9'; } else ret[i]=s[i]; } return ret; } public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=nextInt(); return a; } public long[] nextLongArray(int n){ long[] a=new long[n]; for(int i=0;i<n;i++) a[i]=nextLong(); return a; } public char[][] nextCharMap(int n,int m){ char[][] map=new char[n][m]; for(int i=0;i<n;i++) map[i]=next().toCharArray(); return map; } } }