Submission #716888

#	Time	Username	Problem	Language	Result	Execution time	Memory
716888		pragmatist	Palindromes (APIO14_palindrome)	C++17	23 / 100	63 ms	3332 KiB

palindrome

#include <bits/stdc++.h>                     
  
#define ll long long 
#define pb push_back
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(v) (int)v.size()
#define x first
#define y second
#define nl "\n"
  
using namespace std;
  
const int N = (int)1e3 + 7;
const int M = (int)2e6 + 5e5 + 7;
const ll MOD = (ll)1e9;                    
const int inf = (int)1e9 + 7;
const int B = (int)390;
const ll INF = (ll)1e18 + 7;
  
pair<int, int> dir[] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
 
bool bit(int mask, int i) {
    return (mask >> i & 1);
}
  
int sum(int x, int y) {
    x += y;
    if(x >= MOD) x -= MOD;
    return x;
}
  
int mult(int x, int y) {
    return 1ll * x * y % MOD;
}

string s;
bool is[N][N];
                                 

void solve() {
	cin >> s;
	int n = sz(s);
	s = '#' + s;
	for(int i = 1; i <= n; ++i) {
		is[i][i] = 1;
		is[i][i - 1] = 1;
	}
	for(int len = 2; len <= n; ++len) {
		for(int i = 1; i <= n; ++i) {
			int j = i + len - 1;
			is[i][j] = (s[i] == s[j] && is[i + 1][j - 1]);
		}
	}
	unordered_map<string, int> cnt;
	for(int i = 1; i <= n; ++i) {
	    string t;
		for(int j = i; j <= n; ++j) {
			t += s[j]; 
			if(!is[i][j]) continue;
			cnt[t]++;
		}
	}
	int ans = 0;
	for(auto [t, y] : cnt) {
		ans = max(ans, sz(t) * y);
	}
	cout << ans << nl;
}       
 
  
signed main() {                   
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    //freopen("palindrome.in", "r", stdin);
    //freopen("palindrome.out", "w", stdout);    
    int test = 1;                       
    //cin >> test;
    for(int i = 1; i <= test; ++i) {
        //cout << "Case " << i << ":\n";
        solve();
    }
    return 0;
}                   
/*
possible causes of error :
* array  bounds
* int overflow
* special case (n == 1?)
* haven't clean something
* wrong N | M | inf | INF | MOD

* try to write brute force to find test
* don't waste time
* don't write bullshit
* solution is easy
*/

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27