제출 #289758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289758		Namnamseo	회문 (APIO14_palindrome)	C++17	0 / 100	66 ms	77688 KiB

palindrome

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;
using ll=long long;
#define pb push_back
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=1;i<=n;++i)

const int maxn = int(6e5) + 10;

char s[maxn];
int n;

int nxt[maxn][27];
int fail[maxn];
int cnt[maxn], dep[maxn], par[maxn];
int myv[maxn];
int lv[maxn];

int rad[maxn], lng[maxn];
int nn, root;

int G(int v, int i) {
	if (!nxt[v][i]) {
		nxt[v][i] = ++nn;
		dep[nn] = dep[v] + 1;
		par[nn] = v;
	}
	return nxt[v][i];
}

int main() {
	scanf("%s", s);
	n = strlen(s);

	{ // inflate
		for (int i=n-1; 0<=i; --i) s[2*i+1] = s[i];
		for (int i=0; i<=n; ++i) s[2*i] = '{';
		n = 2*n+1;
	}

	root = ++nn; fail[root] = root;
	fail[lv[0] = myv[0] = G(root, s[0]-'a')] = root;
	for (int i=1; i<n; ++i) {
		int v = myv[i-1];
		while (v != root) {
			int r = dep[v], h = 2*(i-r)-i;
			if (h >= 0 && s[i] == s[h]) break;
			v = fail[v];
		}
		int h = 2*(i-dep[v])-i;
		if (h >= 0 && s[h] == s[i]) {
			v = G(v, s[i]-'a');
			fail[v] = lv[h];
		}
		myv[i] = v; lv[h] = v;
	}

	for(int i=0; i<n; ++i) ++cnt[myv[i]];
	for(int i=nn; 1<i; --i) cnt[fail[i]] += cnt[i];

	ll ans = 0;
	for (int i=1; i<=nn; ++i) ans = max(ans, (dep[i]-1)*1ll*cnt[i]);

	printf("%lld\n", ans);

	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

palindrome.cpp: In function 'int main()':
palindrome.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |  scanf("%s", s);
      |  ~~~~~^~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27