結果

問題 No.315 世界のなんとか3.5
ユーザー GrenacheGrenache
提出日時 2015-12-09 01:19:09
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,635 bytes
コンパイル時間 3,948 ms
コンパイル使用メモリ 74,992 KB
実行使用メモリ 61,272 KB
最終ジャッジ日時 2023-10-12 22:37:55
合計ジャッジ時間 33,508 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,580 KB
testcase_01 AC 46 ms
49,492 KB
testcase_02 AC 84 ms
53,200 KB
testcase_03 AC 45 ms
49,472 KB
testcase_04 AC 45 ms
49,440 KB
testcase_05 AC 51 ms
49,332 KB
testcase_06 AC 97 ms
54,004 KB
testcase_07 AC 50 ms
49,540 KB
testcase_08 AC 52 ms
49,384 KB
testcase_09 AC 45 ms
49,424 KB
testcase_10 AC 46 ms
49,328 KB
testcase_11 AC 45 ms
49,388 KB
testcase_12 AC 287 ms
56,192 KB
testcase_13 AC 286 ms
56,232 KB
testcase_14 AC 647 ms
60,932 KB
testcase_15 AC 641 ms
60,824 KB
testcase_16 AC 709 ms
60,772 KB
testcase_17 AC 709 ms
60,520 KB
testcase_18 AC 408 ms
60,384 KB
testcase_19 AC 443 ms
60,684 KB
testcase_20 AC 805 ms
59,872 KB
testcase_21 AC 808 ms
60,348 KB
testcase_22 AC 1,401 ms
60,260 KB
testcase_23 AC 1,374 ms
60,292 KB
testcase_24 AC 701 ms
60,788 KB
testcase_25 AC 1,363 ms
58,756 KB
testcase_26 AC 701 ms
60,468 KB
testcase_27 AC 597 ms
60,248 KB
testcase_28 AC 1,436 ms
60,812 KB
testcase_29 TLE -
testcase_30 AC 1,095 ms
60,604 KB
testcase_31 AC 988 ms
60,784 KB
testcase_32 TLE -
testcase_33 AC 1,378 ms
59,336 KB
testcase_34 TLE -
testcase_35 TLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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;
			dp[nextj] = new int[2][d][p];
			dp2[nextj] = new int[2][d][p];
			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);
		}
	}
}
0