제출 #368166

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
368166		Nima_Naderi	회문 (APIO14_palindrome)	C++14	0 / 100	307 ms	32324 KiB

palindrome

/** Im the best because i work as hard as i possibly can **/

//#pragma GCC optimize("Ofast, unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include <bits/stdc++.h>
using namespace std;

typedef long long                   ll;
typedef long double                 ld;
typedef pair<int,int>               pii;
typedef pair<ll,ll>                 pll;
#define all(x)                      (x).begin(),(x).end()
#define F                           first
#define S                           second
#define Mp                          make_pair
#define fast_io                     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io                     freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);
#define endl                        "\n"

const int N = 3e5 + 10;
const ll mod = 884577481;
const ll mod2 = 998244353;
const ll inf = 8e18;
const int LOG = 22;
const ll base = 609859;

string s;

char C[N];

int n, T, P[N];
//int rnk[LOG][N];
int seg[N << 2];

ll PW[N], hshL[N], hshR[N];
/*
bool cmp(int i, int j)
{
	int t = T - 1;
	if(rnk[t][i] == rnk[t][j])
	{
		if(max(i, j) + (1 << t) > n) return i > j;
		return rnk[t][i + (1 << t)] < rnk[t][j + (1 << t)];
	}
	return rnk[t][i] < rnk[t][j];
}
*/
inline ll baze(int l, int r)
{
	return (hshL[r] - (hshL[l - 1] * PW[r - l + 1] % mod) + mod) % mod;
}

inline ll baze2(int l, int r)
{
	return (hshR[l] - (hshR[r + 1] * PW[r - l + 1] % mod) + mod) % mod;
}
/*
inline void SA()
{
	pw[0] = 1;
	for(int i = 1; i < N; i ++) pw[i] = pw[i - 1] * base % mod;
	for(int i = 1; i <= n; i ++)
	{
		hshL[i] = (hshL[i - 1] * base + s[i] - 'a' + 1) % mod;
		P[i] = i;
		rnk[0][i] = s[i] - 'a' + 1;
	}
	for(int i = n; i >= 1; i --)
	{
		hshR[i] = (hshR[i + 1] * base + s[i] - 'a' + 1) % mod;
	}
	for(T = 1; T < LOG; T ++)
	{
		sort(P + 1, P + n + 1, cmp);
		rnk[T][P[1]] = 1;
		for(int i = 2; i <= n ;i ++)
		{
			rnk[T][P[i]] = rnk[T][P[i - 1]] + cmp(P[i - 1], P[i]);
		}
	}
}

int lcp(int i, int j)
{
	int ret = 0;
	for(T = LOG - 1; ~T; T --)
	{
		if(max(i, j) + (1 << T) - 1 > n || rnk[T][i] != rnk[T][j]) continue;
		ret ^= 1 << T;
		i += 1 << T;
		j += 1 << T;
	}
	return ret;
}
*/
const ll MXN = N;
int pw;
int rnk[MXN], SA[MXN], lcp[MXN], tmp[MXN], Cnt[MXN];
int rmq[LOG][MXN], lg[MXN];
inline void BuildSuffixArray(const string &s){
    assert((s[0] == '$') && (n + 1 == (int)s.size()));
    iota(SA + 1, SA + n + 1, 1), SA[0] = n + 1;
    for(int i = 1; i <= n; i ++) rnk[i] = s[i];
    int _Max = 'z', p = 1, k;
    for(pw = 0; p < n; pw ++){
        k = ((1LL << pw) >> 1), p = 1;
        for(int i = n - k + 1; i <= n; i ++){
            tmp[p ++] = i;
        }
        for(int i = 1; i <= n; i ++){
            if(SA[i] > k) tmp[p ++] = SA[i] - k;
        }
        for(int i = 0; i <= _Max; i ++) Cnt[i] = 0;
        for(int i = 1; i <= n; i ++) Cnt[rnk[i]] ++;
        for(int i = 1; i <= _Max; i ++){
            Cnt[i] += Cnt[i - 1];
        }
        for(int i = n; i; i --){
            SA[Cnt[rnk[tmp[i]]] --] = tmp[i];
        }
        swap(rnk, tmp);
        rnk[SA[1]] = p = 1;
        for(int i = 2; i <= n; i ++){
            if(tmp[SA[i - 1]] != tmp[SA[i]] || SA[i - 1] + k > n || tmp[SA[i - 1] + k] != tmp[SA[i] + k]){
                p ++;
            }
            rnk[SA[i]] = p;
        }
        _Max = p;
    }
    SA[0] = n + 1;
}
inline void BuildLcpTable(const string &s){
    assert((s[0] == '$') && (n + 1 == (int)s.size()));
    for(int i = 1, k = 0; i <= n; i ++){
        if(rnk[i] == n) continue;
        if(k) k --;
        while(s[i + k] == s[SA[rnk[i] + 1] + k]){
            k ++;
        }
        lcp[rnk[i] + 1] = k;
    }
}
inline void BuildRmqLcp(){
    for(int i = 0; (1LL << i) < MXN; i ++) lg[(1LL << i)] = i;
    for(int i = 1; i < MXN; i ++)          lg[i] = max(lg[i - 1], lg[i]);
    for(int i = 1; i <= n; i ++) rmq[0][i] = lcp[i];
    for(int j = 1; j < LOG; j ++){
        for(int i = 1; i <= n; i ++){
            if(i < (1LL << j)) continue;
            rmq[j][i] = max(rmq[j - 1][i], rmq[j - 1][i - (1LL << (j - 1))]);
        }
    }
}
inline int LCP(int l, int r){//! index in suffix array
    if(l == r) return n - SA[l] + 1;
    if(r < l) swap(l, r);
    l ++;
    return min(rmq[lg[r - l + 1]][r], rmq[lg[r - l + 1]][l + (1LL << lg[r - l + 1]) - 1]);
}
void build(int v = 1, int tl = 1, int tr = n)
{
	if(tl == tr)
	{
		seg[v] = LCP(tl, tl + 1);
		return;
	}
	int mid = (tl + tr) >> 1;
	build(v << 1, tl, mid), build(v << 1 | 1, mid + 1, tr);
	seg[v] = min(seg[v << 1], seg[v << 1 | 1]);
}

int find_nxt(int p, int x, int v = 1, int tl = 1, int tr = n)
{
	if(p > n) return n + 1;
	if(tr < p) return -1;
	if(seg[v] >= x)
	{
		if(tr == n) return n + 1;
		return -1;
	}
	if(tl == tr) return tl;
	int mid = (tl + tr) >> 1;
	int cu = find_nxt(p, x, v << 1, tl, mid);
	if(cu == -1) cu = find_nxt(p, x, v << 1 | 1, mid + 1, tr);
	return cu;
}

int find_prv(int p, int x, int v = 1, int tl = 1, int tr = n)
{
	if(tl > p) return -1;
	if(seg[v] >= x)
	{
		if(tl == 1) return 0;
		return -1;
	}
	if(tl == tr) return tl;
	int mid = (tl + tr) >> 1;
	int cu = find_prv(p, x, v << 1 | 1, mid + 1, tr);
	if(cu == -1) cu = find_prv(p, x, v << 1, tl, mid);
	return cu;
}

ll calc(int l, int r)
{
	int sz = r - l + 1, id = rnk[l];
	int L = find_prv(id, sz);
	int R = find_nxt(id + 1, sz);
	return R - L;
}

int main()
{
    scanf("%s", C);
	n = strlen(C);
	s = C;
	s = "$" + s;
	BuildSuffixArray(s);
	BuildLcpTable(s);
    BuildRmqLcp();
	build();
	ll tot = 0;
	for(int i = 1; i <= n; i ++)
	{
		int d = 0, up = min(i - 1, n - i) + 1;
		while(up - d > 1)
		{
			int mid = (up + d) >> 1;
			if(baze(i, i + mid) == baze2(i - mid, i)) d = mid;
			else up = mid;
		}
		tot = max(tot, calc(i - d, i + d) * (2 * d + 1));
	}
	for(int i = 1; i < n; i ++)
	{
		if(s[i] != s[i + 1]) continue;
		int d = 0, up = min(i - 1, n - i - 1) + 1;
		while(up - d > 1)
		{
			int mid = (up + d) >> 1;
			if(baze(i + 1, i + 1 + mid) == baze2(i - mid, i)) d = mid;
			else up = mid;
		}
		tot = max(tot, calc(i - d, i + d + 1) * (2 *  d + 2));
	}
	printf("%lld", tot);
	return 0;
}

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

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

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