結果
| 問題 | No.599 回文かい |
| ユーザー |
 yuya178
|
| 提出日時 | 2017-11-25 00:04:37 |
| 言語 | Java21 (openjdk 21) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,910 bytes |
| コンパイル時間 | 2,912 ms |
| コンパイル使用メモリ | 84,328 KB |
| 実行使用メモリ | 95,332 KB |
| 最終ジャッジ日時 | 2024-05-05 11:48:12 |
| 合計ジャッジ時間 | 9,416 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 44 ms
42,224 KB |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | AC | 46 ms
36,552 KB |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | TLE | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| evil_0.txt | -- | - |
ソースコード
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;
List<Integer>[] adj;
void solve()
{
char[] c = ns().toCharArray();
int n = c.length;
memo = new long[n];
Arrays.fill(memo,-1);
map = new HashMap<>();
adj = new List[n];
for(int i = 0; i < n; i++){
adj[i] = new ArrayList<>();
}
for(int i = 0; i <= n/2; i++){
int flag = 0;
int s = i;
int g = n-1-i;
while(s<g && s<=n/2 && g>=n/2){
flag = 0;
while(c[s]!=c[n-1-i]) s++;
while(c[i]!=c[g]) g--;
if(s>n-1-g){
g = n-1-s;
}
if(s<n-1-g){
s = n-1-g;
}
// out.println(s+" "+g);
for(int j = i; j <= s; j++){
if(c[j]!=c[n-1-i-s+j]){
flag = 1;
break;
}
}
if(flag==0){
adj[i].add(s);
}
s++;
}
}
for(int i : adj[2]){
out.println(i);
}
long sum = f(c, 0, n-1)%MOD;
out.println(sum);
}
long f(char[] c, int s, int t){
int k = t-s;
if(s>=t) return 1;
if(memo[k]>=0){
return memo[k];
}
if(s==t-1){
if(c[s]==c[t]){
memo[k] = 2;
return 2;
}
else{
memo[k] = 1;
return 1;
}
}
int flag = 0;
long sum = 0;
for(int i : adj[s]){
if(i>=(s+t+1)/2) break;
sum += f(c, i+1, t+s-i-1)%MOD;
sum %= MOD;
}
// 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;
// }
// }
// if(flag==0){
// sum += f(c, i+1, t+s-i-1)%MOD;
// sum %= MOD;
// }
// }
sum += 1;
sum %= MOD;
memo[k] = 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);
}
}
}