oj.uz

Submission #829104

# Submission time Handle Problem Language Result Execution time Memory
829104 2023-08-18T04:30:29 Z NhanBeoo Palindromes (APIO14_palindrome) C++17
23 / 100
 1000 ms 22276 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")

#include <bits/stdc++.h>
using namespace std;

#define int ll
#define MAX LLONG_MAX
#define st first
#define nd second
#define endl '\n'
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef pair< int, int > ii;
typedef pair< int, ii > iii;
typedef vector< int > vi;
typedef vector< ii > vii;
typedef vector< iii > viii;
typedef vector< vi > vvi;
typedef vector< vii > vvii;
typedef vector< viii > vviii;

const int N = 3e5 + 5;
int n;
int base = 311;
int mod[] = {1000000007, 100313, 500249};
string s, t;
int hashS[3][N], hashT[3][N], power[3][N];
map<int, int> m;
int ans = 0;

int palind(int l, int r){
	int ans;
	for(int k=0; k<3; k++){
		int tmp1 = (hashS[k][r] - hashS[k][l-1] * power[k][r-l+1] + mod[k] * mod[k]) % mod[k];
		int tmp2 = (hashT[k][n-l+1] - hashT[k][n-r] * power[k][r-l+1] + mod[k] * mod[k]) % mod[k];
		// cout << k << ' ' << tmp1 << ' ' << tmp2 << endl;
		if(tmp1 != tmp2) return -1;
		if(k == 2) ans = tmp1;
	}
	return ans;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin >> s;
	t = s; reverse(ALL(t));
	n = SZ(s);
	s = ' ' + s;
	t = ' ' + t;
	for(int i=0; i<3; i++){
		power[i][0] = 1;
		for(int j=1; j<=n; j++) power[i][j] = (power[i][j-1] * base) % mod[i];
		hashS[i][0] = s[0];
		for(int j=1; j<=n; j++) hashS[i][j] = (hashS[i][j-1] * base + s[j]) % mod[i];
		hashT[i][0] = t[0];
		for(int j=1; j<=n; j++) hashT[i][j] = (hashT[i][j-1] * base + t[j]) % mod[i];
	}
	// cout << s.substr(1, 2) << endl;
	// cout << t.substr(2, 3) << endl;
	// palind(1, 2);
	for(int len=1; len<=n; len++){
		for(int i=1; i+len-1<=n; i++){
			int hashed = palind(i, i+len-1);
			if(hashed != -1) m[hashed]++;
		}
		for(auto tmp: m){
			// int i = tmp.st.st, j = tmp.st.nd;
			// string str = tmp.st;
			int cnt = tmp.nd;
			// cout << str << ' ' << cnt << endl;
			ans = max(ans, len * cnt);
		}
		m.clear();
	}
	cout << ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 340 KB Output is correct
2 Correct 12 ms 464 KB Output is correct
3 Correct 23 ms 456 KB Output is correct
4 Correct 11 ms 468 KB Output is correct
5 Correct 23 ms 340 KB Output is correct
6 Correct 24 ms 468 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 16 ms 464 KB Output is correct
9 Correct 10 ms 464 KB Output is correct
10 Correct 9 ms 468 KB Output is correct
11 Correct 9 ms 468 KB Output is correct
12 Correct 10 ms 468 KB Output is correct

Subtask #3
0 / 24.0

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

Subtask #4
0 / 26.0

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

Subtask #5
0 / 27.0

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