結果
問題 | No.2019 Digits Filling for All Substrings |
ユーザー | 37zigen |
提出日時 | 2022-02-07 08:00:21 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 162 ms / 2,000 ms |
コード長 | 3,808 bytes |
コンパイル時間 | 2,348 ms |
コンパイル使用メモリ | 74,728 KB |
実行使用メモリ | 55,084 KB |
最終ジャッジ日時 | 2023-09-02 19:16:14 |
合計ジャッジ時間 | 7,148 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 41 ms
47,388 KB |
testcase_01 | AC | 41 ms
49,572 KB |
testcase_02 | AC | 42 ms
49,372 KB |
testcase_03 | AC | 41 ms
49,364 KB |
testcase_04 | AC | 135 ms
54,680 KB |
testcase_05 | AC | 142 ms
54,716 KB |
testcase_06 | AC | 129 ms
54,828 KB |
testcase_07 | AC | 98 ms
54,504 KB |
testcase_08 | AC | 158 ms
55,008 KB |
testcase_09 | AC | 160 ms
55,084 KB |
testcase_10 | AC | 151 ms
54,776 KB |
testcase_11 | AC | 154 ms
54,948 KB |
testcase_12 | AC | 162 ms
55,060 KB |
testcase_13 | AC | 147 ms
55,048 KB |
testcase_14 | AC | 50 ms
49,184 KB |
testcase_15 | AC | 51 ms
49,148 KB |
testcase_16 | AC | 73 ms
51,944 KB |
testcase_17 | AC | 52 ms
49,328 KB |
testcase_18 | AC | 55 ms
49,568 KB |
testcase_19 | AC | 43 ms
49,220 KB |
testcase_20 | AC | 42 ms
49,016 KB |
testcase_21 | AC | 45 ms
49,160 KB |
testcase_22 | AC | 44 ms
49,016 KB |
testcase_23 | AC | 43 ms
49,172 KB |
testcase_24 | AC | 122 ms
54,692 KB |
testcase_25 | AC | 148 ms
54,668 KB |
testcase_26 | AC | 130 ms
54,372 KB |
testcase_27 | AC | 72 ms
51,732 KB |
testcase_28 | AC | 70 ms
51,728 KB |
testcase_29 | AC | 126 ms
54,736 KB |
testcase_30 | AC | 157 ms
55,016 KB |
testcase_31 | AC | 140 ms
54,976 KB |
testcase_32 | AC | 116 ms
54,200 KB |
testcase_33 | AC | 144 ms
54,664 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; class Main { public static void main(String[] args) { new Main().run(); } final long mod=998244353; long f(char[] a, int id) { int n=a.length; if (id == n) { int sum=0; for (char c : a) { sum+=c-'0'; } if (sum%3==0) return 1; else return 0; } long ret=0; if (a[id]=='?') { a[id]='0'; ret+=4*f(a, id+1); ret%=mod; a[id]='1'; ret+=3*f(a, id+1); ret%=mod; a[id]='2'; ret+=3*f(a, id+1); ret%=mod; a[id]='?'; } else { ret=f(a, id+1); } return ret; } void brute(int N, char[] str) { long ans=0; for (int L=0;L<N;++L) { for (int R=L;R<N;++R) { ans+=f(Arrays.copyOfRange(str, L, R+1), 0); ans%=mod; } } System.out.println(ans); } void solve() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int N=sc.nextInt(); char[] str=sc.next().toCharArray(); //brute(N, str); long[] cnt=new long[3]; cnt[0]=0; long ans=0; for (int i=0;i<N;++i) { long[] ncnt=new long[3]; for (int pre=0;pre<3;++pre) { for (int add=0;add<=9;++add) { if (str[i]!='?' && add != str[i]-'0') continue; ncnt[(pre+add)%3]+=cnt[pre]; ncnt[(pre+add)%3]%=mod; } } for (int add=0;add<=9;++add) { if (str[i]!='?' && add != str[i]-'0') continue; ncnt[add%3]++; ncnt[add%3]%=mod; } ans=(ans+ncnt[0])%mod; cnt=ncnt; } System.out.println(ans); pw.close(); } void run() { solve(); } static void tr(Object...objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }