oj.uz

Submission #104482

# Submission time Handle Problem Language Result Execution time Memory
104482 2019-04-07T06:04:13 Z E869120 Palindromes (APIO14_palindrome) C++14
23 / 100
 1000 ms 3108 KB 
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;

map<long long, long long>Map;
long long maxn = 0; string S;

bool ispalindrome(string V) {
	for (int i = 0; i < V.size(); i++) {
		if (V[i] != V[V.size() - 1 - i]) return false;
	}
	return true;
}

int main() {
	cin >> S;
	for (int i = 0; i < S.size(); i++) {
		long long r = 0;
		for (int j = i; j < S.size(); j++) {
			r *= 311; r += (long long)(S[j] - 'a' + 1);
			if (ispalindrome(S.substr(i, j - i + 1)) == false) continue;
			Map[r] += 1LL * (j - i + 1);
			maxn = max(maxn, Map[r]);
		}
	}
	cout << maxn << endl;
	return 0;
}

Compilation message

palindrome.cpp: In function 'bool ispalindrome(std::__cxx11::string)':
palindrome.cpp:11:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < V.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp: In function 'int main()':
palindrome.cpp:19:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i; j < S.size(); j++) {
                   ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 416 KB Output is correct
2 Correct 76 ms 428 KB Output is correct
3 Correct 256 ms 504 KB Output is correct
4 Correct 52 ms 376 KB Output is correct
5 Correct 253 ms 504 KB Output is correct
6 Correct 202 ms 504 KB Output is correct
7 Correct 51 ms 384 KB Output is correct
8 Correct 122 ms 428 KB Output is correct
9 Correct 44 ms 384 KB Output is correct
10 Correct 42 ms 384 KB Output is correct
11 Correct 46 ms 384 KB Output is correct
12 Correct 58 ms 384 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 988 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 1074 ms 2804 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 1072 ms 3108 KB Time limit exceeded
2 Halted 0 ms 0 KB -