oj.uz

Submission #47999

# Submission time Handle Problem Language Result Execution time Memory
47999 2018-05-09T11:04:18 Z E869120 Palindromes (APIO14_palindrome) C++14
8 / 100
 1000 ms 131072 KB 
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

bool pal(string S) {
	string T = S; reverse(T.begin(), T.end());
	if (S == T) return true;
	return false;
}

string S; vector<string>A; map<string, int>M; int maxn = 0;

int main() {
	cin >> S;
	for (int i = 0; i < S.size(); i++) {
		for (int j = i; j < S.size(); j++) {
			string G = S.substr(i, j - i + 1); if (pal(G) == false) continue;
			A.push_back(G); M[G] += G.size();
		}
	}
	for (int i = 0; i < A.size(); i++) maxn = max(maxn, M[A[i]]);
	cout << maxn << endl;
	return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:18:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp:19:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i; j < S.size(); j++) {
                   ~~^~~~~~~~~~
palindrome.cpp:24:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < A.size(); i++) maxn = max(maxn, M[A[i]]);
                  ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 560 KB Output is correct
9 Correct 2 ms 572 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 572 KB Output is correct
12 Correct 2 ms 572 KB Output is correct
13 Correct 2 ms 572 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 2 ms 592 KB Output is correct
16 Correct 2 ms 592 KB Output is correct
17 Correct 2 ms 592 KB Output is correct
18 Correct 2 ms 592 KB Output is correct
19 Correct 3 ms 764 KB Output is correct
20 Correct 4 ms 764 KB Output is correct
21 Correct 3 ms 764 KB Output is correct
22 Correct 3 ms 764 KB Output is correct
23 Correct 4 ms 1020 KB Output is correct
24 Correct 3 ms 1020 KB Output is correct
25 Correct 4 ms 1020 KB Output is correct
26 Correct 3 ms 1020 KB Output is correct
27 Correct 3 ms 1020 KB Output is correct
28 Correct 3 ms 1020 KB Output is correct
29 Correct 4 ms 1020 KB Output is correct
30 Correct 3 ms 1020 KB Output is correct
31 Correct 3 ms 1020 KB Output is correct
32 Correct 3 ms 1020 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 572 ms 93636 KB Output is correct
2 Correct 335 ms 93636 KB Output is correct
3 Execution timed out 1102 ms 131072 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1069 ms 131072 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 1098 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 1068 ms 131072 KB Time limit exceeded
2 Halted 0 ms 0 KB -