結果

問題 No.189 SUPER HAPPY DAY
ユーザー uwiuwi
提出日時 2015-04-22 00:41:09
言語 Java11
(openjdk 11.0.7)
結果
AC  
実行時間 135 ms / 5,000 ms
コード長 3,833 Byte
コンパイル時間 3,996 ms
使用メモリ 26,264 KB
最終ジャッジ日時 2020-06-26 22:14:29

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 83 ms
20,944 KB
testcase_01 AC 82 ms
21,016 KB
testcase_02 AC 76 ms
20,916 KB
testcase_03 AC 76 ms
20,992 KB
testcase_04 AC 79 ms
20,992 KB
testcase_05 AC 76 ms
21,004 KB
testcase_06 AC 77 ms
20,988 KB
testcase_07 AC 75 ms
21,000 KB
testcase_08 AC 77 ms
20,992 KB
testcase_09 AC 77 ms
21,000 KB
testcase_10 AC 79 ms
20,992 KB
testcase_11 AC 76 ms
20,996 KB
testcase_12 AC 75 ms
20,996 KB
testcase_13 AC 100 ms
22,448 KB
testcase_14 AC 104 ms
22,832 KB
testcase_15 AC 104 ms
22,536 KB
testcase_16 AC 110 ms
22,632 KB
testcase_17 AC 112 ms
22,904 KB
testcase_18 AC 103 ms
22,484 KB
testcase_19 AC 111 ms
23,240 KB
testcase_20 AC 94 ms
21,792 KB
testcase_21 AC 90 ms
21,976 KB
testcase_22 AC 80 ms
21,192 KB
testcase_23 AC 110 ms
22,548 KB
testcase_24 AC 115 ms
22,548 KB
testcase_25 AC 135 ms
26,264 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
package contest;

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

public class Q493 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	final int mod = 1000000009;
	
	void solve()
	{
		char[] m = ns().toCharArray();
		char[] d = ns().toCharArray();
		int[] em = freq(m);
		int[] ed = freq(d);
		long ret = 0;
		for(int i = 1;i < em.length && i < ed.length;i++){
			ret += (long)em[i]*ed[i]%mod;
		}
		out.println(ret%mod);
	}
	
	int[] freq(char[] d)
	{	
		int n = d.length;
		int[][] dp = new int[n+1][2000];
		int edge = 0;
		for(int i = 0;i < n;i++){
			for(int j = 0;j < 2000;j++){
				if(dp[i][j] == 0)continue;
				for(int k = 0;k <= 9;k++){
					dp[i+1][j+k] += dp[i][j];
					if(dp[i+1][j+k] >= mod)dp[i+1][j+k] -= mod;
				}
			}
			
			if(i == 0){
				for(int k = 1;k < d[i]-'0';k++){
					dp[i+1][k]++;
					if(dp[i+1][k] >= mod)dp[i+1][k] -= mod;
				}
			}else{
				for(int k = 1;k <= 9;k++){
					dp[i+1][k]++;
					if(dp[i+1][k] >= mod)dp[i+1][k] -= mod;
				}
				for(int k = 0;k < d[i]-'0';k++){
					dp[i+1][edge+k]++;
					if(dp[i+1][edge+k] >= mod)dp[i+1][edge+k] -= mod;
				}
			}
			edge += d[i]-'0';
		}
		
		dp[n][edge]++;
		if(dp[n][edge] >= mod)dp[n][edge] -= mod;
		return dp[n];
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q493().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