Submission #647074

#TimeUsernameProblemLanguageResultExecution timeMemory
647074googlePalindromes (APIO14_palindrome)C++17
23 / 100
1085 ms131072 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; map<string,ll> m; int main(){ cin.tie(0)->sync_with_stdio(0); string s; cin >> s; int n = int(s.size()); for (int i = 0;i<n;i++){ string t = ""; for (int j = i;j<n;j++){ t += s[j]; int sz = t.size()/2, bb = 0; for (int i = 0;i<=sz;i++){ if (t[i] != t[t.size()-i-1]) { bb = 1; break; } } if (bb) continue; m[t]++; } } ll ans = 0; for (auto [a,b]:m) ans = max(ans,b*int(a.size())); cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...