oj.uz

Submission #134899

# Submission time Handle Problem Language Result Execution time Memory
134899 2019-07-23T11:52:26 Z wmrmr Palindromes (APIO14_palindrome) C++17
0 / 100
 1000 ms 3348 KB 
#include <bits/stdc++.h>
using namespace std;

long long int ans;
map<string,int> m;
map<string,int>::iterator mit;
string s;

void Insert()
{
	int tam = s.size();
	for(int i=0;i<tam;i++)
	{
		string aux;
		int maxt = min( i+1, tam-i );
		for(int j=0;j<maxt;j++)
		{
			if( s[i+j] != s[i-j] ) break;
			aux.push_back(s[i+j]);
			if(m.find(aux) == m.end()) m.insert({aux,1});
			else m[aux]++;
		}
	}
	return;
}

int main()
{
	cin >> s;
	Insert();
	for(mit = m.begin();mit!=m.end();mit++)
	{
		int tam = (mit->first).size(), qtd = mit->second;
		ans = max( ans , (long long int) qtd*(2*tam-1) );
	}
	printf("%lld",ans);
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 256 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 748 KB Output is correct
2 Correct 49 ms 504 KB Output is correct
3 Correct 116 ms 548 KB Output is correct
4 Correct 10 ms 376 KB Output is correct
5 Correct 115 ms 500 KB Output is correct
6 Incorrect 114 ms 504 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1039 ms 3020 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 3012 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 3348 KB Time limit exceeded
2 Halted 0 ms 0 KB -