結果
問題 | No.1845 Long Substrings |
ユーザー | 37zigen |
提出日時 | 2022-02-19 00:33:30 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 585 ms / 2,000 ms |
コード長 | 3,500 bytes |
コンパイル時間 | 3,144 ms |
コンパイル使用メモリ | 75,696 KB |
実行使用メモリ | 69,592 KB |
最終ジャッジ日時 | 2023-09-11 20:21:22 |
合計ジャッジ時間 | 13,169 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 300 ms
62,652 KB |
testcase_01 | AC | 438 ms
67,664 KB |
testcase_02 | AC | 493 ms
67,636 KB |
testcase_03 | AC | 569 ms
67,720 KB |
testcase_04 | AC | 585 ms
69,592 KB |
testcase_05 | AC | 289 ms
63,344 KB |
testcase_06 | AC | 363 ms
63,128 KB |
testcase_07 | AC | 486 ms
62,840 KB |
testcase_08 | AC | 532 ms
62,296 KB |
testcase_09 | AC | 533 ms
62,952 KB |
testcase_10 | AC | 280 ms
62,808 KB |
testcase_11 | AC | 445 ms
64,480 KB |
testcase_12 | AC | 516 ms
62,764 KB |
testcase_13 | AC | 511 ms
62,348 KB |
testcase_14 | AC | 562 ms
64,304 KB |
testcase_15 | AC | 68 ms
51,628 KB |
testcase_16 | AC | 72 ms
51,664 KB |
testcase_17 | AC | 78 ms
51,408 KB |
testcase_18 | AC | 80 ms
50,804 KB |
testcase_19 | AC | 100 ms
52,856 KB |
testcase_20 | AC | 44 ms
49,200 KB |
testcase_21 | AC | 44 ms
49,356 KB |
testcase_22 | AC | 43 ms
49,504 KB |
testcase_23 | AC | 42 ms
49,448 KB |
testcase_24 | AC | 44 ms
49,216 KB |
testcase_25 | AC | 43 ms
49,192 KB |
testcase_26 | AC | 43 ms
49,196 KB |
testcase_27 | AC | 43 ms
49,216 KB |
testcase_28 | AC | 43 ms
49,340 KB |
testcase_29 | AC | 45 ms
49,336 KB |
testcase_30 | AC | 44 ms
49,200 KB |
testcase_31 | AC | 45 ms
49,248 KB |
testcase_32 | AC | 44 ms
49,208 KB |
testcase_33 | AC | 43 ms
49,428 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.Arrays; import java.util.NoSuchElementException; class Main { public static void main(String[] args) { new Main().run(); } void run() { solve(); } long mod=(long)1e9+7; int MAX=2000000; void solve() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int N=sc.nextInt(); int[] A=new int[N]; for (int i=0;i<N;++i) { A[i]=sc.nextInt(); } int m=26; ArrayDeque<Integer>[] dq=new ArrayDeque[m]; for (int i=0;i<m;++i) dq[i]=new ArrayDeque<>(); char[] cs=sc.next().toCharArray(); for (int i=0;i<N;++i) { int num=cs[i]-'a'; dq[num].addLast(i); } long[][] dp=new long[N+1][2]; dp[0][0]=1; for (int i=0;i<N;++i) { for (int j=0;j<m;++j) { while (!dq[j].isEmpty() && dq[j].peekFirst() < i) dq[j].pollFirst(); if (dq[j].isEmpty()) continue; int nxt=dq[j].peekFirst(); if (i>0 && cs[nxt]==cs[i-1]) { dp[nxt+1][0]+=dp[i][1]*(A[nxt]-1)%mod; dp[nxt+1][1]+=dp[i][1]; } else { dp[nxt+1][0]+=(dp[i][0]+dp[i][1])*(A[nxt]-1)%mod; dp[nxt+1][1]+=(dp[i][0]+dp[i][1])%mod; } dp[nxt+1][0]%=mod; dp[nxt+1][1]%=mod; } } long ans=0; for (int i=1;i<dp.length;++i) { for (int j=0;j<dp[i].length;++j) { ans+=dp[i][j]; ans%=mod; } } System.out.println(ans); pw.close(); } 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;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); 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() { return (int)nextLong(); } }