結果

問題 No.260 世界のなんとか3
ユーザー uwiuwi
提出日時 2015-08-04 02:20:56
言語 Java21
(openjdk 21)
結果
MLE  
(最新)
AC  
(最初)
実行時間 -
コード長 4,686 bytes
コンパイル時間 3,700 ms
コンパイル使用メモリ 85,652 KB
実行使用メモリ 72,392 KB
最終ジャッジ日時 2024-05-22 04:11:21
合計ジャッジ時間 15,425 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 MLE -
testcase_01 MLE -
testcase_02 MLE -
testcase_03 MLE -
testcase_04 MLE -
testcase_05 MLE -
testcase_06 MLE -
testcase_07 MLE -
testcase_08 MLE -
testcase_09 MLE -
testcase_10 MLE -
testcase_11 MLE -
testcase_12 MLE -
testcase_13 MLE -
testcase_14 MLE -
testcase_15 MLE -
testcase_16 MLE -
testcase_17 MLE -
testcase_18 MLE -
testcase_19 MLE -
testcase_20 MLE -
testcase_21 MLE -
testcase_22 MLE -
testcase_23 MLE -
testcase_24 MLE -
testcase_25 MLE -
testcase_26 MLE -
testcase_27 MLE -
testcase_28 MLE -
testcase_29 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q6xx;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q612XX {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int mod = 1000000007;
	int[][][][] mem = new int[10002][24][2][2];
	char[] str;
	int pos;
	
	int dfs(int m, int aho, int edge) {
		if(pos == str.length)return ((aho == 1 || m % 3 == 0) && m % 8 != 0) ? 1 : 0;
		if(mem[pos][m][aho][edge] != -1){
			return mem[pos][m][aho][edge];
		}
		long ret = 0;
		pos++;
		for(int i = 0;i <= (edge == 1 ? str[pos-1]-'0' : 9);i++){
			ret += dfs( 
					(m*10+i)%24, 
					aho | (i == 3 ? 1 : 0), 
					edge & (i == str[pos-1]-'0' ? 1 : 0)
					);
		}
		pos--;
		return mem[pos][m][aho][edge] = (int)(ret % mod);
	}
	
	void solve()
	{
		char[] s = ns().toCharArray();
		char[] t = ns().toCharArray();
		long ret = 0;
		fill(mem, -1);
		str = t;
		pos = 0;
		ret += dfs(0, 0, 1);
		fill(mem, -1);
		str = minus1(s);
		ret -= dfs(0, 0, 1);
		if(ret < 0)ret += mod;
		out.println(ret);
	}
	
	public static void fill(Object o, Object v)
	{
		Class<?> comp = o.getClass().getComponentType();
		if(comp != null){
			if(comp.isArray()){
				for(Object c : (Object[])o)fill(c, v);
			}else{
				int len = Array.getLength(o);
				for(int i = 0;i < len;i++)Array.set(o, i, v);
			}
		}
	}
	
	public static char[] minus1(char[] a)
	{
		if(a.length == 1 && a[0] == '0')throw new RuntimeException();
		for(int i = a.length-1;i >= 0;i--){
			if(--a[i] < '0'){
				a[i] = '9';
			}else{
				break;
			}
		}
		if(a[0] == '0'){
			return Arrays.copyOfRange(a, 1, a.length);
		}else{
			return a;
		}
	}

	public void run() throws Exception
	{
//		int n = 100000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(10));
//		}
//		sb.append(" ");
//		for (int i = 0; i < n+1; i++) {
//			sb.append(gen.nextInt(10));
//		}
//		INPUT = sb.toString();
		
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		Thread t = new Thread(null, null, "faa", Runtime.getRuntime().maxMemory()){
			@Override
			public void run() {
				long s = System.currentTimeMillis();
				solve();
				out.flush();
				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
			}
		};
		t.start();
		t.join();
	}
	
	public static void main(String[] args) throws Exception { 
		new Q612XX().run();
	}
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0