oj.uz

Submission #731111

# Submission time Handle Problem Language Result Execution time Memory
731111 2023-04-27T03:19:22 Z Cutebol Palindromes (APIO14_palindrome) C++17
8 / 100
 1000 ms 131072 KB 
#include <bits/stdc++.h>
   
using namespace std;
#define Nilou ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
#define int long long
#define ff first
#define ss second

const int N = 2e5 + 5 ;
const int mod = 1e9 + 7 ;
const int inf = 1e15 ;

int n , k ;
string s ;
map <string , int> mp ;
bool a[10003][10003] ;

void solve(){
	
	cin >> s ;
	n = s.size() ; int ans = 0 ;
	for ( int i = 0 ; i < n ; i ++ ){
		string x , z ;
		for ( int j = i ; j < n ; j ++ ){
			x += s[j] ;
			z = s[j]+z ;
			if ( z == x ) a[i][j] = 1 ;
			mp[x] ++ ;
		}
	}
	for ( int i = 0 ; i < n ; i ++ ){
		string x ;
		for ( int j = i ; j < n ; j ++ ){
			x += s[j] ;
			if ( a[i][j] ) ans = max ( ans , mp[x]*(j-i+1) ) ; 
		}
	}
	cout << ans ;
}

signed main(){
	Nilou ;
	int t = 1 ;
//	cin >> t ;
	while ( t -- ) solve() ;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 456 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 2 ms 724 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 3 ms 1108 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 724 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 3 ms 1108 KB Output is correct
27 Correct 4 ms 1108 KB Output is correct
28 Correct 4 ms 1108 KB Output is correct
29 Correct 4 ms 1236 KB Output is correct
30 Correct 3 ms 1308 KB Output is correct
31 Correct 2 ms 1236 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 5996 KB Output is correct
2 Runtime error 209 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

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

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 161 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 148 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -