Submission #47906

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
47906	2018-05-08T14:30:54 Z	square1001	Palindromes (APIO14_palindrome)	C++14	23 / 100	1000 ms	131072 KB

palindrome

#include <map>
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
string s; map<string, int> d;
int main() {
	cin >> s;
	int n = s.size();
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j <= n; j++) {
			string t = s.substr(i, j - i);
			bool ok = true;
			for (int k = 0; k < t.size(); k++) {
				if (t[k] != t[t.size() - k - 1]) ok = false;
			}
			if (ok) d[t]++;
		}
	}
	int ret = 0;
	for (pair<string, int> i : d) {
		ret = max(ret, (int)i.first.size() * i.second);
	}
	cout << ret << '\n';
	return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:15:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < t.size(); k++) {
                    ~~^~~~~~~~~~

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	444 KB	Output is correct
4	Correct	2 ms	632 KB	Output is correct
5	Correct	2 ms	632 KB	Output is correct
6	Correct	2 ms	632 KB	Output is correct
7	Correct	2 ms	632 KB	Output is correct
8	Correct	2 ms	632 KB	Output is correct
9	Correct	2 ms	632 KB	Output is correct
10	Correct	2 ms	632 KB	Output is correct
11	Correct	2 ms	632 KB	Output is correct
12	Correct	2 ms	632 KB	Output is correct
13	Correct	2 ms	660 KB	Output is correct
14	Correct	3 ms	660 KB	Output is correct
15	Correct	2 ms	660 KB	Output is correct
16	Correct	2 ms	660 KB	Output is correct
17	Correct	2 ms	676 KB	Output is correct
18	Correct	2 ms	676 KB	Output is correct
19	Correct	3 ms	684 KB	Output is correct
20	Correct	1 ms	684 KB	Output is correct
21	Correct	2 ms	684 KB	Output is correct
22	Correct	2 ms	696 KB	Output is correct
23	Correct	3 ms	696 KB	Output is correct
24	Correct	2 ms	696 KB	Output is correct
25	Correct	3 ms	696 KB	Output is correct
26	Correct	2 ms	712 KB	Output is correct
27	Correct	2 ms	716 KB	Output is correct
28	Correct	3 ms	716 KB	Output is correct
29	Correct	2 ms	724 KB	Output is correct
30	Correct	2 ms	724 KB	Output is correct
31	Correct	2 ms	724 KB	Output is correct
32	Correct	2 ms	736 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	286 ms	1252 KB	Output is correct
2	Correct	230 ms	1252 KB	Output is correct
3	Correct	389 ms	1508 KB	Output is correct
4	Correct	188 ms	1508 KB	Output is correct
5	Correct	389 ms	1508 KB	Output is correct
6	Correct	376 ms	1508 KB	Output is correct
7	Correct	185 ms	1508 KB	Output is correct
8	Correct	308 ms	1508 KB	Output is correct
9	Correct	188 ms	1508 KB	Output is correct
10	Correct	182 ms	1508 KB	Output is correct
11	Correct	188 ms	1508 KB	Output is correct
12	Correct	194 ms	1508 KB	Output is correct

Subtask #3

0 / 24.0

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

Subtask #4

0 / 26.0

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

Subtask #5

0 / 27.0

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