oj.uz

Submission #220973

# Submission time Handle Problem Language Result Execution time Memory
220973 2020-04-09T11:17:19 Z nafis_shifat Palindromes (APIO14_palindrome) C++11
0 / 100
 1000 ms 36068 KB 
#include<bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
using namespace std;
const int mxn=3e5+6;

int tree[mxn][26];
int idx;
int len[mxn];
int link[mxn],t;

char s[mxn];


ll oc[mxn]={};

void init()
{
	len[1]=-1;
    len[2]=0;

    link[1]=link[2]=1;
    idx=t=2;

}
void extend(int p)
{

	while(s[p-len[t]-1]!=s[p])t=link[t];

	int x=link[t];
	int c=s[p]-'a';
    
    while(s[p-len[x]-1]!=s[p])x=link[x];


    if(!tree[t][c])
    {
    	tree[t][c]=++idx;
    	len[idx]=len[t]+2;

    	link[idx]= len[idx]==1 ? 2 : tree[x][c];
    }

    t=idx;
    oc[t]++;
  
}

 
int main()
{
    init();
	scanf("%s",s+1);



	int n=strlen(s+1);

	for(int i=1;i<=n;i++)extend(i);
	ll res=0;
	for(int i=idx;i>2;i--)
	{
		res=max(res,len[i]*oc[i]);
		oc[link[i]]+=oc[i];
	}
	cout<<res<<endl;

	return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:54:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s",s+1);
  ~~~~~^~~~~~~~~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Incorrect 6 ms 384 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 512 KB Output is correct
2 Execution timed out 1082 ms 384 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 7 ms 1536 KB Output is correct
3 Correct 6 ms 1536 KB Output is correct
4 Correct 6 ms 1536 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct
6 Correct 6 ms 1536 KB Output is correct
7 Execution timed out 1094 ms 1536 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 12288 KB Output is correct
2 Correct 15 ms 12288 KB Output is correct
3 Correct 14 ms 12284 KB Output is correct
4 Correct 18 ms 12288 KB Output is correct
5 Correct 14 ms 12288 KB Output is correct
6 Execution timed out 1090 ms 6656 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 36068 KB Output is correct
2 Execution timed out 1087 ms 17588 KB Time limit exceeded
3 Halted 0 ms 0 KB -