結果

問題 No.765 ukuku 2
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-12-13 03:39:23
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,145 bytes
コンパイル時間 5,359 ms
コンパイル使用メモリ 85,928 KB
実行使用メモリ 59,876 KB
最終ジャッジ日時 2023-10-25 09:05:34
合計ジャッジ時間 11,697 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 87 ms
54,380 KB
testcase_01 AC 86 ms
54,380 KB
testcase_02 AC 85 ms
54,380 KB
testcase_03 AC 86 ms
54,384 KB
testcase_04 AC 85 ms
54,420 KB
testcase_05 AC 85 ms
54,376 KB
testcase_06 AC 85 ms
54,340 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 85 ms
54,388 KB
testcase_10 AC 87 ms
54,388 KB
testcase_11 WA -
testcase_12 AC 85 ms
54,380 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 87 ms
54,380 KB
testcase_20 AC 86 ms
54,292 KB
testcase_21 AC 87 ms
54,356 KB
testcase_22 AC 86 ms
54,496 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 86 ms
54,532 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 185 ms
58,260 KB
testcase_34 AC 194 ms
59,392 KB
testcase_35 AC 194 ms
57,548 KB
testcase_36 WA -
testcase_37 AC 191 ms
59,504 KB
testcase_38 AC 192 ms
59,344 KB
testcase_39 WA -
testcase_40 AC 193 ms
59,272 KB
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

public class Main {


  private static void solve() {
    char[] s = ns();
    int max = Arrays.stream(palindrome(s)).max().getAsInt();
    
    if (max == s.length) {
      System.out.println(max - 1);
    } else {
      System.out.println(max);
    }
  }

  public static int[] palindrome(char[] str)
  {
      int n = str.length;
      int[] r = new int[2*n];
      int k = 0;
      for(int i = 0, j = 0;i < 2*n;i += k, j = Math.max(j-k, 0)){
          // normally
          while(i-j >= 0 && i+j+1 < 2*n && str[(i-j)/2] == str[(i+j+1)/2])j++;
          r[i] = j;
          
          // skip based on the theorem
          for(k = 1;i-k >= 0 && r[i]-k >= 0 && r[i-k] != r[i]-k;k++){
              r[i+k] = Math.min(r[i-k], r[i]-k);
          }
      }
      return r;
  }
  
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0