oj.uz

Submission #48019

# Submission time Handle Problem Language Result Execution time Memory
48019 2018-05-09T11:54:34 Z E869120 Palindromes (APIO14_palindrome) C++14
32 / 100
 1000 ms 11800 KB 
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

string S; int L[100009], N, col[100009], cnts; vector<int>x[100009], y[100009];

long long Get(int pos) {
	if (pos < 0) return -1;
	if (pos >= N) return -2;
	return L[pos];
}

int main() {
	cin >> S; N = S.size(); if (S.size() == 1) { cout << "1" << endl; return 0; }
	for (int i = 0; i < N; i++) L[i] = (S[i] - 'a');
	for (int i = 0; i < N; i++) x[0].push_back(i);

	long long maxn = 0; cnts = 1;

	for (int i = 0; i <= N / 2 + 1; i++) {
		int cnt = 0;
		for (int j = 0; j < cnts; j++) {
			if (x[j].size() == 1) { int to = x[j][0]; if (Get(to - i) == Get(to + i)) { y[cnt] = x[j]; cnt++; } continue; }
			
			vector<int>H[26];
			for (int k = 0; k < x[j].size(); k++) {
				int to = x[j][k];
				if (Get(to - i) != Get(to + i)) continue;
				H[Get(to + i)].emplace_back(to);
			}
			for (int k = 0; k < 26; k++) {
				if (H[k].size() >= 1) { y[cnt] = H[k]; cnt++; }
			}
		}
		for (int j = 0; j < cnt; j++) { x[j] = y[j]; maxn = max(maxn, 1LL * (long long)x[j].size()*(i * 2 + 1)); } cnts = cnt;
	}

	for (int i = 0; i < 100009; i++) x[i].clear(); cnts = 1;
	for (int i = 0; i < N; i++) x[0].push_back(i);

	for (int i = 0; i <= N / 2 + 1; i++) {
		int cnt = 0;
		for (int j = 0; j < cnts; j++) {
			if (x[j].size() == 1) { int to = x[j][0]; if (Get(to - i) == Get(to + i)) { y[cnt] = x[j]; cnt++; } continue; }

			vector<int>H[26];
			for (int k = 0; k < x[j].size(); k++) {
				int to = x[j][k];
				if (Get(to - i) != Get(to + i + 1)) continue;
				H[Get(to + i)].emplace_back(to);
			}
			for (int k = 0; k < 26; k++) {
				if (H[k].size() >= 1) { y[cnt] = H[k]; cnt++; }
			}
		}
		for (int j = 0; j < cnt; j++) { x[j] = y[j]; maxn = max(maxn, 1LL * (long long)x[j].size()*(i * 2 + 2)); }
		cnts = cnt;
	}
	cout << maxn << endl;
	return 0;
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:28:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < x[j].size(); k++) {
                    ~~^~~~~~~~~~~~~
palindrome.cpp:40:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for (int i = 0; i < 100009; i++) x[i].clear(); cnts = 1;
  ^~~
palindrome.cpp:40:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  for (int i = 0; i < 100009; i++) x[i].clear(); cnts = 1;
                                                 ^~~~
palindrome.cpp:49:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < x[j].size(); k++) {
                    ~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5356 KB Output is correct
2 Correct 7 ms 5356 KB Output is correct
3 Correct 9 ms 5356 KB Output is correct
4 Correct 6 ms 5356 KB Output is correct
5 Correct 9 ms 5356 KB Output is correct
6 Correct 9 ms 5356 KB Output is correct
7 Correct 5 ms 5356 KB Output is correct
8 Correct 7 ms 5356 KB Output is correct
9 Correct 5 ms 5356 KB Output is correct
10 Correct 5 ms 5356 KB Output is correct
11 Correct 5 ms 5356 KB Output is correct
12 Incorrect 5 ms 5356 KB Output isn't correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 215 ms 5500 KB Output is correct
2 Correct 98 ms 5500 KB Output is correct
3 Correct 338 ms 5684 KB Output is correct
4 Correct 245 ms 5756 KB Output is correct
5 Correct 8 ms 5756 KB Output is correct
6 Correct 16 ms 5756 KB Output is correct
7 Correct 44 ms 5756 KB Output is correct
8 Correct 6 ms 5756 KB Output is correct
9 Correct 6 ms 5756 KB Output is correct
10 Correct 10 ms 5756 KB Output is correct

Subtask #4
0 / 26.0

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

Subtask #5
0 / 27.0

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