結果

問題 No.260 世界のなんとか3
ユーザー tanzakutanzaku
提出日時 2015-08-01 00:10:06
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,694 bytes
コンパイル時間 2,816 ms
コンパイル使用メモリ 76,652 KB
実行使用メモリ 54,856 KB
最終ジャッジ日時 2023-09-24 23:54:25
合計ジャッジ時間 9,960 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,632 KB
testcase_01 AC 45 ms
49,656 KB
testcase_02 AC 45 ms
49,792 KB
testcase_03 AC 347 ms
54,436 KB
testcase_04 AC 333 ms
54,288 KB
testcase_05 WA -
testcase_06 AC 138 ms
54,316 KB
testcase_07 AC 267 ms
54,312 KB
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 275 ms
54,228 KB
testcase_12 WA -
testcase_13 AC 128 ms
53,460 KB
testcase_14 AC 189 ms
52,996 KB
testcase_15 AC 148 ms
54,108 KB
testcase_16 WA -
testcase_17 AC 255 ms
54,180 KB
testcase_18 AC 203 ms
54,380 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 157 ms
53,276 KB
testcase_22 AC 191 ms
53,168 KB
testcase_23 WA -
testcase_24 AC 210 ms
53,960 KB
testcase_25 AC 202 ms
53,972 KB
testcase_26 AC 176 ms
53,384 KB
testcase_27 AC 44 ms
49,812 KB
testcase_28 AC 316 ms
54,856 KB
testcase_29 AC 337 ms
54,488 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int[] A = next();
			int[] B = next();
			
			A[A.length - 1]--;
			for(int i = A.length - 1; A[i] < 0; i--) {
				A[i] += 10;
				A[i-1]--;
			}
			
			io.out.println((doit(B) - doit(A) + mod) % mod);
		}
	}
	
	long doit(int[] A) {
		long[][][][] dp = new long[2][2][2][24];
		dp[0][1][0][0] = 1;
		for(int i = 0; i < A.length; i++) {
			int c = i & 1;
			for(int f = 0; f < 2; f++) {
				for(int j = 0; j < 2; j++) {
					for(int k = 0; k < 24; k++) {
						dp[c^1][f][j][k] = 0;
					}
				}
			}
			for(int f = 0; f < 2; f++) {
				for(int v = 0; v < 10; v++) {
					if(f == 1 && v > A[i]) continue;
					int nf = f & (v == A[i] ? 1 : 0);
					for(int j = 0; j < 2; j++) {
						for(int k = 0; k < 24; k++) if(dp[c][f][j][k] != 0) {
							int x = (k*10 + v) % 24;
							int y = j | (v == 3 ? 1 : 0);
							dp[c^1][nf][y][x] += dp[c][f][j][k];
							if(dp[c^1][nf][y][x] >= mod) dp[c^1][nf][y][x] -= mod;
//							if(dp[c^1][nf][y][x] != 0) {
//								System.err.println(i + " " + nf + " " + y + " " + x + " " + dp[c^1][nf][y][x]);
//							}
						}
					}
				}
			}
		}
		long ans = 0;
		for(int i = A.length & 1, j = 0; j < 2; j++) {
			for(int k = 0; k < 24; k++) {
				for(int f = 0; f < 2; f++) {
					if((j == 1 || k % 3 == 0) && k % 8 != 0) {
						ans += dp[i][f][j][k];
					}
				}
			}
		}
//		System.err.println(Arrays.toString(A) + " " + ans);
		return ans;
	}
	
	int[] next() throws IOException {
		char[] cs = io.next();
		int[] A = new int[cs.length];
		for(int i = 0; i < cs.length; i++) {
			A[i] = cs[i] - '0';
		}
		return A;
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0