結果
問題 | No.962 LCPs |
ユーザー | 37zigen |
提出日時 | 2020-04-07 01:40:48 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,127 bytes |
コンパイル時間 | 3,135 ms |
コンパイル使用メモリ | 74,348 KB |
実行使用メモリ | 61,836 KB |
最終ジャッジ日時 | 2023-09-21 16:58:04 |
合計ジャッジ時間 | 13,561 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
51,176 KB |
testcase_01 | AC | 42 ms
51,392 KB |
testcase_02 | AC | 49 ms
51,280 KB |
testcase_03 | AC | 49 ms
51,264 KB |
testcase_04 | AC | 47 ms
51,212 KB |
testcase_05 | AC | 46 ms
51,208 KB |
testcase_06 | AC | 45 ms
51,440 KB |
testcase_07 | AC | 48 ms
51,244 KB |
testcase_08 | AC | 48 ms
51,172 KB |
testcase_09 | AC | 48 ms
51,296 KB |
testcase_10 | AC | 48 ms
51,296 KB |
testcase_11 | AC | 46 ms
51,160 KB |
testcase_12 | AC | 44 ms
51,352 KB |
testcase_13 | AC | 44 ms
51,080 KB |
testcase_14 | AC | 45 ms
51,216 KB |
testcase_15 | AC | 43 ms
49,232 KB |
testcase_16 | AC | 47 ms
51,180 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | AC | 89 ms
54,088 KB |
testcase_48 | AC | 89 ms
53,124 KB |
testcase_49 | AC | 88 ms
53,488 KB |
testcase_50 | AC | 88 ms
54,236 KB |
testcase_51 | AC | 77 ms
52,964 KB |
testcase_52 | AC | 85 ms
53,016 KB |
testcase_53 | AC | 89 ms
52,952 KB |
testcase_54 | AC | 87 ms
53,136 KB |
testcase_55 | AC | 83 ms
53,524 KB |
testcase_56 | AC | 90 ms
52,860 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
testcase_63 | AC | 127 ms
59,616 KB |
testcase_64 | AC | 80 ms
53,032 KB |
testcase_65 | AC | 131 ms
59,396 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.NoSuchElementException; public class Main implements Runnable{ public static void main(String[] args) { new Thread(null,new Main(), "" ,Runtime.getRuntime().maxMemory()).start(); } public void run() { FastScanner sc=new FastScanner(); int ans=0; int N=sc.nextInt(); char[][] cs=new char[N][]; int[] LCP=new int[N]; for(int i=0;i<N;++i) { cs[i]=sc.next().toCharArray(); } long cur=0,single=0; for(int L=0;L<N;++L) { cur+=cs[L].length-LCP[L]; single+=cs[L].length-LCP[L]; LCP[L]=cs[L].length; for(int R=L+1;R<N;++R) { boolean update=false; while(LCP[R]<LCP[R-1]&&LCP[R]<cs[R].length&&cs[R][LCP[R]]==cs[R-1][LCP[R]]) { ++LCP[R]; cur+=(R-L+1); ++single; update=true; } if(!update)break; } ans+=cur; cur-=single; single-=LCP[L]; } System.out.println(ans); } 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());} }