Submission #967426

#	Time	Username	Problem	Language	Result	Execution time	Memory
967426		Halym2007	Palindromes (APIO14_palindrome)	C++17	23 / 100	1073 ms	131072 KiB

palindrome

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sz size()
#define ff first
#define ss second
const int N = 1e5 + 5;
map <string, int> m;
string s;
int n, jog;
int main () {
//	freopen ("polindrome.in", "r", stdin);
//	freopen ("polindrome.out", "w", stdout);
//	freopen ("input.txt", "r", stdin);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> s;
	int n = (int)s.sz;
	string t;
	for (int i = 0; i < n; ++i) {
		t = "";
		for (int j = i; j < n; ++j) {
			t += s[j];
			bool tr = 0;
			for (int k = 0; k < (int)t.sz / 2; ++k) {
				if (t[k] != t[(int)t.sz - k - 1]) {
					tr = 1;
//					break;
				}
			}
			if (!tr) {
				m[t]++;
			}
		}
	}
	for (auto i : m) {
		int x = (int)i.ff.sz;
		int y = m[i.ff];
		jog = max (jog, x * y);
//		if (x == 14) {
//			cout << x << " " << m[i.ff] << " " << i.ff << " " << m[i.ff] << " " << (int)i.ff.sz<< "\n";
//		}
	}
	cout << jog;
}

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