oj.uz

답안 #556058

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
556058 2022-05-02T09:29:48 Z MurotY 회문 (APIO14_palindrome) C++14
8 / 100
 1000 ms 131072 KB 
// author : Murot_06
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ff first
#define ll long long
#define ss second
using namespace std;
const int N=1e6+7, M=1e9+7;

void solve()
{
	string s;
	cin >> s;
	int n=s.size();
	map <string, ll> mp;
	
	for (int i=0;i<n;i++){
		string a="";
		for (int j=i;j<n;j++){
			a=a+s[j];
			mp[a]++;
		}
	}
	ll ans=0;
	for (int i=0;i<n;i++){
		int pos=i, len=0;
		string a="";
		for (int j=i-1;j>=0;j--){
			if (s[j] == s[pos]) len+=2, a=s[j]+a+s[pos], pos++;
			ans=max(ans, len*mp[a]); 
		}
		pos=i+1, len=1;
		a=s[i];
		for (int j=i-1;j>=0;j--){
			if (s[j] == s[pos]) len+=2, a=s[j]+a+s[pos], pos++;
			ans=max(ans, len*mp[a]);
		}
		ans=max(ans, len*mp[a]);
	//	if (i == 3) cout << a <<" ";
	}
	cout << ans;
	return ;
}
int main()
{
	ios;
	int t=1;
//	cin >> t;
	while (t--){
	     solve();
	}
	return 0;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 320 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 724 KB Output is correct
23 Correct 2 ms 212 KB Output is correct
24 Correct 3 ms 724 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 3 ms 724 KB Output is correct
29 Correct 5 ms 896 KB Output is correct
30 Correct 4 ms 832 KB Output is correct
31 Correct 3 ms 852 KB Output is correct
32 Correct 5 ms 980 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 443 ms 2108 KB Output is correct
2 Runtime error 263 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1101 ms 100068 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 149 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 153 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -