oj.uz

Submission #48006

# Submission time Handle Problem Language Result Execution time Memory
48006 2018-05-09T11:21:33 Z E869120 Palindromes (APIO14_palindrome) C++14
8 / 100
 817 ms 17584 KB 
#include <iostream>
#include <string>
#include <algorithm>
#include <map>
using namespace std;

long long roll1[1009][1009], roll2[1009][1009]; string S;
map<long long, long long>M;

int main() {
	cin >> S;
	for (int i = 0; i < S.size(); i++) {
		for (int j = i; j < S.size(); j++) {
			if (j != 0) roll1[i][j] = roll1[i][j - 1] * 31LL;
			roll1[i][j] += (S[j] - 'a' + 1);
		}
	}
	for (int i = 0; i < S.size(); i++) {
		for (int j = i; j >= 0; j--) {
			roll2[i][j] = roll2[i][j + 1] * 31LL;
			roll2[i][j] += (S[j] - 'a' + 1);
		}
	}
	long long maxn = 0;
	for (int i = 0; i < S.size(); i++) {
		for (int j = i; j < S.size(); j++) {
			if (roll1[i][j] != roll2[j][i]) continue;
			M[roll1[i][j]] += (j - i + 1);
			maxn = max(maxn, M[roll1[i][j]]);
		}
	}
	cout << maxn << endl;
	return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:12:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp:13:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = i; j < S.size(); j++) {
                   ~~^~~~~~~~~~
palindrome.cpp:18:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
palindrome.cpp:26: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 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 412 KB Output is correct
5 Correct 2 ms 412 KB Output is correct
6 Correct 2 ms 536 KB Output is correct
7 Correct 2 ms 536 KB Output is correct
8 Correct 2 ms 536 KB Output is correct
9 Correct 2 ms 544 KB Output is correct
10 Correct 2 ms 672 KB Output is correct
11 Correct 2 ms 672 KB Output is correct
12 Correct 2 ms 672 KB Output is correct
13 Correct 2 ms 876 KB Output is correct
14 Correct 3 ms 876 KB Output is correct
15 Correct 12 ms 876 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 2 ms 876 KB Output is correct
18 Correct 2 ms 876 KB Output is correct
19 Correct 3 ms 1404 KB Output is correct
20 Correct 3 ms 1404 KB Output is correct
21 Correct 3 ms 1404 KB Output is correct
22 Correct 3 ms 1404 KB Output is correct
23 Correct 3 ms 1404 KB Output is correct
24 Correct 3 ms 1404 KB Output is correct
25 Correct 3 ms 1404 KB Output is correct
26 Correct 3 ms 1452 KB Output is correct
27 Correct 3 ms 1452 KB Output is correct
28 Correct 3 ms 1452 KB Output is correct
29 Correct 3 ms 1452 KB Output is correct
30 Correct 3 ms 1452 KB Output is correct
31 Correct 3 ms 1452 KB Output is correct
32 Correct 3 ms 1452 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 14492 KB Output is correct
2 Correct 31 ms 14492 KB Output is correct
3 Correct 81 ms 14564 KB Output is correct
4 Correct 22 ms 14564 KB Output is correct
5 Correct 82 ms 14564 KB Output is correct
6 Correct 82 ms 14564 KB Output is correct
7 Correct 21 ms 14564 KB Output is correct
8 Correct 56 ms 14564 KB Output is correct
9 Correct 23 ms 14564 KB Output is correct
10 Correct 20 ms 14564 KB Output is correct
11 Correct 19 ms 14564 KB Output is correct
12 Incorrect 20 ms 14564 KB Output isn't correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Runtime error 50 ms 16764 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 365 ms 17192 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 817 ms 17584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -