oj.uz

답안 #77647

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
77647 2018-09-29T09:39:57 Z samuelfgs96 회문 (APIO14_palindrome) C++11
73 / 100
 73 ms 55944 KB 
#include<bits/stdc++.h>

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back

using namespace std;

const int N = 212345;
typedef pair<int, int> pii;
typedef long long ll;
 
int bit[N];
struct treez {
	struct Node { 
		int start, end; 
		int length; 
		int insertEdg[26]; 
		int suffixEdg; 
		int qtd;
	}; 
	Node root1, root2; 
	Node tree[N]; 
	int currNode; 
	string s; 
	int ptr; 
	treez () { }
	treez (string s) : s(s) { 
		root1.length = -1; 
		root1.suffixEdg = 1; 
		root2.length = 0; 
		root2.suffixEdg = 1; 
		memset (tree, 0, sizeof tree);
		tree[1] = root1; 
		tree[2] = root2; 
		ptr = 2; 
		currNode = 1; 
		for (int i = 0; i < s.size(); i++) insert(i);
	}
	  
	void insert(int idx) { 
		int tmp = currNode;
		while (true) { 
			int curLength = tree[tmp].length; 
			if (idx - curLength >= 1 and s[idx] == s[idx-curLength-1]) 
				break; 
			tmp = tree[tmp].suffixEdg; 
		} 
	  
		if(tree[tmp].insertEdg[s[idx]-'a'] != 0) { 
			currNode = tree[tmp].insertEdg[s[idx]-'a']; 
			tree[currNode].qtd++;
			return; 
		} 
		ptr++; 
		tree[tmp].insertEdg[s[idx]-'a'] = ptr; 
		tree[ptr].length = tree[tmp].length + 2; 
		tree[ptr].end = idx; 
		tree[ptr].start = idx - tree[ptr].length + 1; 
		tree[ptr].qtd = 1;
	  
		tmp = tree[tmp].suffixEdg; 
		currNode = ptr; 
		if (tree[currNode].length == 1) { 
			tree[currNode].suffixEdg = 2; 
			return; 
		} 
		while (true) { 
			int curLength = tree[tmp].length; 
			if (idx-curLength >= 1 and s[idx] == s[idx-curLength-1]) 
				break; 
			tmp = tree[tmp].suffixEdg; 
		} 
	  
		tree[currNode].suffixEdg = tree[tmp].insertEdg[s[idx]-'a']; 
	} 
};
treez t1;
string s;
ll ans;
int sz[N];
void dfs (int u) {
	for (int i = t1.ptr; i >= 3; i--) {
		sz[i] += t1.tree[i].qtd;
		sz[t1.tree[i].suffixEdg] += sz[i];
	}
}
void dfs2 (int u) {
	for (int i = 0; i < 26; i++)
		if (t1.tree[u].insertEdg[i])
			dfs2(t1.tree[u].insertEdg[i]);
	if (u >= 3) {
		ans = max(ans, ll(sz[u]) * (t1.tree[u].end - t1.tree[u].start + 1));
	}

}
int main (void) {
	cin >> s;
	t1 = treez(s);
	dfs(1);
	dfs2(1);
	dfs2(2);
	cout << ans << endl;
	return 0;
}

Compilation message

palindrome.cpp: In constructor 'treez::treez(std::__cxx11::string)':
palindrome.cpp:40:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < s.size(); i++) insert(i);
                   ~~^~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 51960 KB Output is correct
2 Correct 48 ms 52024 KB Output is correct
3 Correct 48 ms 52032 KB Output is correct
4 Correct 47 ms 52032 KB Output is correct
5 Correct 48 ms 52036 KB Output is correct
6 Correct 48 ms 52092 KB Output is correct
7 Correct 48 ms 52092 KB Output is correct
8 Correct 48 ms 52092 KB Output is correct
9 Correct 50 ms 52264 KB Output is correct
10 Correct 48 ms 52264 KB Output is correct
11 Correct 48 ms 52264 KB Output is correct
12 Correct 48 ms 52264 KB Output is correct
13 Correct 48 ms 52264 KB Output is correct
14 Correct 50 ms 52264 KB Output is correct
15 Correct 49 ms 52264 KB Output is correct
16 Correct 52 ms 52264 KB Output is correct
17 Correct 52 ms 52280 KB Output is correct
18 Correct 49 ms 52280 KB Output is correct
19 Correct 56 ms 52280 KB Output is correct
20 Correct 50 ms 52304 KB Output is correct
21 Correct 47 ms 52304 KB Output is correct
22 Correct 49 ms 52304 KB Output is correct
23 Correct 49 ms 52304 KB Output is correct
24 Correct 49 ms 52304 KB Output is correct
25 Correct 59 ms 52304 KB Output is correct
26 Correct 50 ms 52304 KB Output is correct
27 Correct 48 ms 52304 KB Output is correct
28 Correct 48 ms 52304 KB Output is correct
29 Correct 48 ms 52304 KB Output is correct
30 Correct 49 ms 52304 KB Output is correct
31 Correct 48 ms 52304 KB Output is correct
32 Correct 49 ms 52308 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 52312 KB Output is correct
2 Correct 49 ms 52320 KB Output is correct
3 Correct 49 ms 52320 KB Output is correct
4 Correct 49 ms 52336 KB Output is correct
5 Correct 53 ms 52352 KB Output is correct
6 Correct 50 ms 52352 KB Output is correct
7 Correct 49 ms 52460 KB Output is correct
8 Correct 50 ms 52460 KB Output is correct
9 Correct 49 ms 52460 KB Output is correct
10 Correct 49 ms 52460 KB Output is correct
11 Correct 48 ms 52460 KB Output is correct
12 Correct 48 ms 52460 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 52612 KB Output is correct
2 Correct 49 ms 52612 KB Output is correct
3 Correct 50 ms 52676 KB Output is correct
4 Correct 59 ms 52676 KB Output is correct
5 Correct 49 ms 52744 KB Output is correct
6 Correct 48 ms 52744 KB Output is correct
7 Correct 50 ms 52744 KB Output is correct
8 Correct 49 ms 52744 KB Output is correct
9 Correct 49 ms 52744 KB Output is correct
10 Correct 49 ms 52744 KB Output is correct

Subtask #4
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 55712 KB Output is correct
2 Correct 71 ms 55712 KB Output is correct
3 Correct 63 ms 55944 KB Output is correct
4 Correct 64 ms 55944 KB Output is correct
5 Correct 62 ms 55944 KB Output is correct
6 Correct 57 ms 55944 KB Output is correct
7 Correct 59 ms 55944 KB Output is correct
8 Correct 54 ms 55944 KB Output is correct
9 Correct 61 ms 55944 KB Output is correct
10 Correct 61 ms 55944 KB Output is correct

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 73 ms 55944 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -