oj.uz

Submission #778029

# Submission time Handle Problem Language Result Execution time Memory
778029 2023-07-10T03:28:41 Z horiiseun Palindromes (APIO14_palindrome) C++17
100 / 100
 95 ms 78324 KB 
#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
using namespace std;
 
#define ll long long
#define f first
#define s second
 
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif
 
struct Node {
	int nxt[30], suffLink;
	ll len, cnt;
	vector<int> edges;
} tree[300005];
 
string s;
int suff, idx;
ll ans;
 
void addLetter(int pos) {
	int curr = suff, currLen = 0, let = s[pos] - 'a';
	while (true) {
		currLen = tree[curr].len;
		if (pos - 1 - currLen >= 0 && s[pos - 1 - currLen] == s[pos]) {
			break;
		}
		curr = tree[curr].suffLink;
	}
	if (tree[curr].nxt[let]) {
		suff = tree[curr].nxt[let];
		tree[suff].cnt++;
		return;
	}
	idx++;
	suff = idx;
	tree[idx].len = tree[curr].len + 2;
	tree[idx].cnt = 1;
	tree[curr].nxt[let] = idx;
	if (tree[idx].len == 1) {
		tree[idx].suffLink = 2;
		tree[2].edges.push_back(idx);
		return;
	}
	while (true) {
		curr = tree[curr].suffLink;
		currLen = tree[curr].len;
		if (pos - 1 - currLen >= 0 && s[pos - 1 - currLen] == s[pos]) {
			tree[idx].suffLink = tree[curr].nxt[let];
			tree[tree[curr].nxt[let]].edges.push_back(idx);
			break;
		}
	}
}
 
void dfs(int curr) {
	for (int i : tree[curr].edges) {
		dfs(i);
		tree[curr].cnt += tree[i].cnt;
	}
	ans = max(ans, tree[curr].cnt * tree[curr].len);
}
 
int main() {
 
	ios_base::sync_with_stdio(false);
	cin.tie(0);
 
	cin >> s;
	idx = 2, suff = 2;
	tree[1].len = -1, tree[1].suffLink = 1;
	tree[2].len = 0, tree[2].suffLink = 1;
	tree[1].edges.push_back(2);
 
	for (int i = 0; i < s.length(); i++) {
		addLetter(i);
	}
	dfs(1);
 
	cout << ans << "\n";
 
}

Compilation message

palindrome.cpp: In function 'int main()':
palindrome.cpp:179:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  179 |  for (int i = 0; i < s.length(); i++) {
      |                  ~~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 49524 KB Output is correct
2 Correct 21 ms 49636 KB Output is correct
3 Correct 21 ms 49620 KB Output is correct
4 Correct 25 ms 49588 KB Output is correct
5 Correct 21 ms 49624 KB Output is correct
6 Correct 21 ms 49516 KB Output is correct
7 Correct 21 ms 49620 KB Output is correct
8 Correct 21 ms 49636 KB Output is correct
9 Correct 22 ms 49636 KB Output is correct
10 Correct 25 ms 49636 KB Output is correct
11 Correct 24 ms 49600 KB Output is correct
12 Correct 21 ms 49576 KB Output is correct
13 Correct 22 ms 49636 KB Output is correct
14 Correct 21 ms 49496 KB Output is correct
15 Correct 21 ms 49620 KB Output is correct
16 Correct 22 ms 49608 KB Output is correct
17 Correct 21 ms 49640 KB Output is correct
18 Correct 27 ms 49748 KB Output is correct
19 Correct 22 ms 49620 KB Output is correct
20 Correct 26 ms 49588 KB Output is correct
21 Correct 23 ms 49504 KB Output is correct
22 Correct 21 ms 49640 KB Output is correct
23 Correct 21 ms 49636 KB Output is correct
24 Correct 22 ms 49620 KB Output is correct
25 Correct 21 ms 49592 KB Output is correct
26 Correct 21 ms 49572 KB Output is correct
27 Correct 20 ms 49612 KB Output is correct
28 Correct 25 ms 49624 KB Output is correct
29 Correct 22 ms 49572 KB Output is correct
30 Correct 24 ms 49624 KB Output is correct
31 Correct 23 ms 49620 KB Output is correct
32 Correct 22 ms 49620 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 49620 KB Output is correct
2 Correct 20 ms 49592 KB Output is correct
3 Correct 21 ms 49620 KB Output is correct
4 Correct 21 ms 49636 KB Output is correct
5 Correct 21 ms 49620 KB Output is correct
6 Correct 20 ms 49644 KB Output is correct
7 Correct 25 ms 49624 KB Output is correct
8 Correct 21 ms 49620 KB Output is correct
9 Correct 22 ms 49628 KB Output is correct
10 Correct 23 ms 49548 KB Output is correct
11 Correct 21 ms 49560 KB Output is correct
12 Correct 21 ms 49596 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 50196 KB Output is correct
2 Correct 21 ms 50164 KB Output is correct
3 Correct 21 ms 50536 KB Output is correct
4 Correct 23 ms 50388 KB Output is correct
5 Correct 22 ms 49748 KB Output is correct
6 Correct 21 ms 49832 KB Output is correct
7 Correct 22 ms 50044 KB Output is correct
8 Correct 22 ms 49580 KB Output is correct
9 Correct 21 ms 49564 KB Output is correct
10 Correct 21 ms 49640 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 56044 KB Output is correct
2 Correct 32 ms 54680 KB Output is correct
3 Correct 33 ms 59144 KB Output is correct
4 Correct 32 ms 56936 KB Output is correct
5 Correct 30 ms 50856 KB Output is correct
6 Correct 29 ms 51928 KB Output is correct
7 Correct 30 ms 53076 KB Output is correct
8 Correct 24 ms 49904 KB Output is correct
9 Correct 25 ms 51844 KB Output is correct
10 Correct 29 ms 50772 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 69020 KB Output is correct
2 Correct 55 ms 62220 KB Output is correct
3 Correct 60 ms 78324 KB Output is correct
4 Correct 54 ms 66328 KB Output is correct
5 Correct 95 ms 54640 KB Output is correct
6 Correct 54 ms 61396 KB Output is correct
7 Correct 52 ms 59216 KB Output is correct
8 Correct 27 ms 50524 KB Output is correct
9 Correct 27 ms 50556 KB Output is correct
10 Correct 57 ms 53756 KB Output is correct
11 Correct 61 ms 62676 KB Output is correct
12 Correct 29 ms 52708 KB Output is correct