結果
問題 | No.315 世界のなんとか3.5 |
ユーザー | Grenache |
提出日時 | 2015-12-09 01:26:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,286 ms / 2,000 ms |
コード長 | 4,725 bytes |
コンパイル時間 | 3,802 ms |
コンパイル使用メモリ | 78,500 KB |
実行使用メモリ | 48,448 KB |
最終ジャッジ日時 | 2024-09-14 20:52:02 |
合計ジャッジ時間 | 22,224 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge6 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
36,624 KB |
testcase_01 | AC | 59 ms
36,996 KB |
testcase_02 | AC | 103 ms
39,628 KB |
testcase_03 | AC | 54 ms
36,856 KB |
testcase_04 | AC | 55 ms
36,752 KB |
testcase_05 | AC | 60 ms
36,624 KB |
testcase_06 | AC | 103 ms
39,888 KB |
testcase_07 | AC | 61 ms
36,856 KB |
testcase_08 | AC | 63 ms
36,636 KB |
testcase_09 | AC | 56 ms
36,548 KB |
testcase_10 | AC | 54 ms
37,076 KB |
testcase_11 | AC | 54 ms
36,944 KB |
testcase_12 | AC | 272 ms
41,320 KB |
testcase_13 | AC | 243 ms
41,380 KB |
testcase_14 | AC | 426 ms
46,124 KB |
testcase_15 | AC | 511 ms
46,736 KB |
testcase_16 | AC | 445 ms
45,840 KB |
testcase_17 | AC | 532 ms
46,592 KB |
testcase_18 | AC | 332 ms
45,248 KB |
testcase_19 | AC | 328 ms
43,120 KB |
testcase_20 | AC | 857 ms
46,288 KB |
testcase_21 | AC | 857 ms
46,304 KB |
testcase_22 | AC | 731 ms
45,812 KB |
testcase_23 | AC | 714 ms
45,896 KB |
testcase_24 | AC | 458 ms
45,676 KB |
testcase_25 | AC | 695 ms
47,496 KB |
testcase_26 | AC | 537 ms
46,856 KB |
testcase_27 | AC | 422 ms
46,352 KB |
testcase_28 | AC | 920 ms
47,272 KB |
testcase_29 | AC | 1,160 ms
48,448 KB |
testcase_30 | AC | 732 ms
48,208 KB |
testcase_31 | AC | 639 ms
47,656 KB |
testcase_32 | AC | 1,009 ms
46,944 KB |
testcase_33 | AC | 757 ms
46,516 KB |
testcase_34 | AC | 1,192 ms
48,300 KB |
testcase_35 | AC | 1,286 ms
48,420 KB |
ソースコード
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.PrintStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.Iterator; public class Main_yukicoder315 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); Printer pr = new Printer(System.out); char[] a = sc.next().toCharArray(); char[] b = sc.next().toCharArray(); int p = sc.nextInt(); int ret = (aho(b, p) - aho(sub(a, '1'), p) + MOD) % MOD; pr.println(ret); pr.close(); sc.close(); } static final int MOD = 1_000_000_007; static int[] mod8; static final int DMAX = 5; private static int aho(char[] b, int p) { int n = b.length; if (mod8 == null) { mod8 = new int[DMAX ]; int mod = 1; for (int i = 0; i < DMAX; i++) { mod8[i] = mod % p; mod *= 10; } } int d = 3; int[][][][] dp = new int[2][2][d][p]; int[][][][] dp2 = new int[2][2][d][p]; dp[0][0][0][0] = 1; dp2[0][0][0][0] = 1; for (int j = 1; j <= n; j++) { int num = b[n - j] - '0'; int nowj = (j - 1) % 2; int nextj = j % 2; for (int l = 0; l < 2; l++) { for (int i = 0; i < d; i++) { Arrays.fill(dp[nextj][l][i], 0); Arrays.fill(dp2[nextj][l][i], 0); } } for (int l = 0; l < 2; l++) { for (int i = 0; i < d; i++) { for (int k = 0; k < 10; k++) { int nextl = l; if (k == 3) { nextl = 1; } int nexti = (i + k) % d; if (j <= DMAX) { for (int i8 = 0; i8 < p; i8++) { int nexti8 = (i8 + k * mod8[j - 1]) % p; dp[nextj][nextl][nexti][nexti8] += dp[nowj][l][i][i8]; dp[nextj][nextl][nexti][nexti8] %= MOD; if (k == num) { dp2[nextj][nextl][nexti][nexti8] += dp2[nowj][l][i][i8]; dp2[nextj][nextl][nexti][nexti8] %= MOD; } else if (k < num) { dp2[nextj][nextl][nexti][nexti8] += dp[nowj][l][i][i8]; dp2[nextj][nextl][nexti][nexti8] %= MOD; } } } else { int i8 = 0; int nexti8 = 0; dp[nextj][nextl][nexti][nexti8] += dp[nowj][l][i][i8]; dp[nextj][nextl][nexti][nexti8] %= MOD; if (k == num) { dp2[nextj][nextl][nexti][nexti8] += dp2[nowj][l][i][i8]; dp2[nextj][nextl][nexti][nexti8] %= MOD; } else if (k < num) { dp2[nextj][nextl][nexti][nexti8] += dp[nowj][l][i][i8]; dp2[nextj][nextl][nexti][nexti8] %= MOD; } } } } } if (j == DMAX) { for (int l = 0; l < 2; l++) { for (int i = 0; i < d; i++) { for (int k = 0; k < 10; k++) { dp[nextj][l][i][0] = 0; dp2[nextj][l][i][0] = 0; for (int i8 = 1; i8 < p; i8++) { dp[nextj][l][i][0] += dp[nextj][l][i][i8]; dp[nextj][l][i][0] %= MOD; dp2[nextj][l][i][0] += dp2[nextj][l][i][i8]; dp2[nextj][l][i][0] %= MOD; } } } } } } int ret = 0; for (int l = 0; l < 2; l++) { for (int i = 0; i < d; i++) { if (n <= DMAX) { for (int i8 = 0; i8 < p; i8++) { if ((l == 1 || i == 0) && i8 != 0) { ret += dp2[n % 2][l][i][i8]; ret %= MOD; } } } else { if ((l == 1 || i == 0)) { ret += dp2[n % 2][l][i][0]; ret %= MOD; } } } } return ret; } private static char[] sub(char[] a, char c) { for (int i = a.length - 1; i >= 0; i--) { if (a[i] - c < 0) { a[i] = (char)(a[i] - c + 10 + '0'); c = '1'; } else { a[i] = (char)(a[i] - c + '0'); break; } } return a; } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Iterator<String> it; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } String next() throws RuntimeException { try { if (it == null || !it.hasNext()) { it = Arrays.asList(br.readLine().split(" ")).iterator(); } return it.next(); } catch (IOException e) { throw new IllegalStateException(); } } int nextInt() throws RuntimeException { return Integer.parseInt(next()); } long nextLong() throws RuntimeException { return Long.parseLong(next()); } float nextFloat() throws RuntimeException { return Float.parseFloat(next()); } double nextDouble() throws RuntimeException { return Double.parseDouble(next()); } void close() { try { br.close(); } catch (IOException e) { // throw new IllegalStateException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }