結果

問題 No.599 回文かい
ユーザー yuya178yuya178
提出日時 2017-11-24 23:23:35
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,887 bytes
コンパイル時間 2,352 ms
コンパイル使用メモリ 90,156 KB
実行使用メモリ 55,644 KB
最終ジャッジ日時 2024-05-05 11:35:56
合計ジャッジ時間 9,177 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 46 ms
42,112 KB
testcase_01 AC 44 ms
36,492 KB
testcase_02 AC 43 ms
36,724 KB
testcase_03 AC 42 ms
36,736 KB
testcase_04 AC 44 ms
36,980 KB
testcase_05 AC 49 ms
36,768 KB
testcase_06 AC 45 ms
36,844 KB
testcase_07 AC 46 ms
36,612 KB
testcase_08 AC 44 ms
36,556 KB
testcase_09 AC 48 ms
36,608 KB
testcase_10 AC 53 ms
36,736 KB
testcase_11 AC 50 ms
36,860 KB
testcase_12 AC 73 ms
37,728 KB
testcase_13 AC 81 ms
38,280 KB
testcase_14 AC 349 ms
43,736 KB
testcase_15 AC 113 ms
38,608 KB
testcase_16 TLE -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
testcase_20 -- -
evil_0.txt -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;
    long[] memo;
    HashMap<Integer, Integer> map;
    void solve()
    {
        char[] c = ns().toCharArray();
        int n = c.length;
        // memo =  new long[n*(n+1)];
        map = new HashMap<>();

        long sum = f(c, 0, n-1)%MOD;
        out.println(sum);

    }

    long f(char[] c, int s, int t){
        int k = s*10000+t;
        if(map.getOrDefault(k, -1) > -1){
            return map.getOrDefault(k, -1);
        }
        if(s==t-1){
            if(c[s]==c[t]){
                // memo[k] = 2;
                map.put(k,2);
                return 2;
            }
            else{
                map.put(k,1);
                return 1;
            }
        }
        if(s>=t) return 1;
        int flag = 0;
        long sum = 0;
        for(int i = s; i <= (s+t-1)/2; i++){
            flag = 0;
            for(int j = s; j <= i; j++){
                if(c[j]!=c[t-i+j]){
                    flag = 1;
                    break;
                }
            }
            // out.print(i);
            // out.println(flag);
            if(flag==0){
                sum += f(c, i+1, t+s-i-1)%MOD;
                sum %= MOD;
            }
        }
        sum += 1;
        sum %= MOD;
        // memo[k] = sum;
        map.put(k,(int)sum);
        return sum;
    } 
   
    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");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private 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) && 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 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[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, 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 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)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0