結果
問題 | No.1085 桁和の桁和 |
ユーザー | uwi |
提出日時 | 2020-06-19 21:37:00 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 137 ms / 2,000 ms |
コード長 | 3,808 bytes |
コンパイル時間 | 3,886 ms |
コンパイル使用メモリ | 80,704 KB |
実行使用メモリ | 43,452 KB |
最終ジャッジ日時 | 2024-04-24 10:00:43 |
合計ジャッジ時間 | 8,678 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,596 KB |
testcase_01 | AC | 49 ms
37,084 KB |
testcase_02 | AC | 54 ms
37,064 KB |
testcase_03 | AC | 52 ms
37,076 KB |
testcase_04 | AC | 81 ms
38,588 KB |
testcase_05 | AC | 50 ms
37,004 KB |
testcase_06 | AC | 50 ms
36,600 KB |
testcase_07 | AC | 52 ms
36,924 KB |
testcase_08 | AC | 50 ms
36,928 KB |
testcase_09 | AC | 50 ms
36,920 KB |
testcase_10 | AC | 51 ms
36,840 KB |
testcase_11 | AC | 51 ms
36,844 KB |
testcase_12 | AC | 51 ms
36,908 KB |
testcase_13 | AC | 92 ms
39,308 KB |
testcase_14 | AC | 115 ms
42,152 KB |
testcase_15 | AC | 123 ms
43,328 KB |
testcase_16 | AC | 119 ms
43,304 KB |
testcase_17 | AC | 103 ms
42,688 KB |
testcase_18 | AC | 91 ms
40,692 KB |
testcase_19 | AC | 113 ms
42,936 KB |
testcase_20 | AC | 92 ms
38,504 KB |
testcase_21 | AC | 104 ms
42,752 KB |
testcase_22 | AC | 111 ms
42,960 KB |
testcase_23 | AC | 71 ms
37,876 KB |
testcase_24 | AC | 52 ms
37,032 KB |
testcase_25 | AC | 124 ms
43,128 KB |
testcase_26 | AC | 128 ms
43,452 KB |
testcase_27 | AC | 113 ms
42,772 KB |
testcase_28 | AC | 130 ms
43,336 KB |
testcase_29 | AC | 106 ms
42,992 KB |
testcase_30 | AC | 123 ms
42,952 KB |
testcase_31 | AC | 117 ms
43,100 KB |
testcase_32 | AC | 107 ms
42,868 KB |
testcase_33 | AC | 133 ms
43,124 KB |
testcase_34 | AC | 132 ms
43,364 KB |
testcase_35 | AC | 134 ms
43,196 KB |
testcase_36 | AC | 132 ms
43,200 KB |
testcase_37 | AC | 137 ms
43,124 KB |
testcase_38 | AC | 137 ms
43,192 KB |
ソースコード
package contest200619; 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 E { InputStream is; PrintWriter out; String INPUT = ""; void solve() { char[] T = ns().toCharArray(); int D = ni(); int n = T.length; boolean incnz = false; for(int i = 0;i < n;i++){ if(T[i] != '?' && T[i] != '0'){ incnz = true; } } if(D == 0){ out.println(incnz ? 0 : 1); return; } long[] dp = new long[9]; dp[0] = 1; int mod = 1000000007; for(char c : T){ long[] ndp = new long[9]; if(c == '?'){ for(int i = 0;i < 9;i++){ for(int j = 0, k = i;j <= 9;j++, k++){ if(k == 9)k = 0; ndp[k] += dp[i]; if(ndp[k] >= mod)ndp[k] -= mod; } } }else{ for(int i = 0, k = (c-'0')%9;i < 9;i++,k++){ if(k == 9)k = 0; ndp[k] += dp[i]; if(ndp[k] >= mod)ndp[k] -= mod; } } dp = ndp; } if(!incnz){ dp[0] = (dp[0]+mod-1)%mod; } out.println(dp[D%9]); } 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"); // Thread t = new Thread(null, null, "~", 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 E().run(); } private byte[] inbuf = new byte[1024]; public 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 int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } 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[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } 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)); } }