# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1030419 |
2024-07-22T04:58:19 Z |
caterpillow |
Savez (COCI15_savez) |
C++17 |
|
106 ms |
65536 KB |
#include <bits/stdc++.h>
using namespace std;
using db = long double;
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;
/*
if a < b and b < c, then a < c
use string hashing
*/
const int m = 27;
const ll mod = 1e6 + 7;
const ll mx = 2e6 + 1;
ll powm(ll y) {
ll x = m;
ll res = 1;
while (y) {
if (y & 1) res = (res * x) % mod;
y >>= 1;
x = (x * x) % mod;
}
return res;
}
int n;
vt<vt<int>> adj;
vt<int> dp;
void push_back(pl& hash, int c) {
hash = {(hash.f * m + c + 1) % mod, hash.s + 1};
}
void push_front(pl& hash, int c) {
hash = {(powm(hash.s) * (c + 1) + hash.f) % mod, hash.s + 1};
}
const pl hid = {0, 0};
int dfs(int u) {
if (dp[u] != -1) return dp[u];
int res = 0;
for (int v : adj[u]) {
res = max(res, dfs(v));
}
return dp[u] = res + 1;
}
int arr[mod];
main() {
cin.tie(0)->sync_with_stdio(0);
memset(arr, -1, sizeof(arr));
cin >> n;
adj.resize(n);
dp.resize(n, -1);
F0R (i, n) {
pl lhs = hid, rhs = hid;
string st; cin >> st;
F0R (j, size(st)) {
push_back(lhs, st[j] - 'A');
push_front(rhs, st[size(st) - j - 1] - 'A');
if (lhs.f == rhs.f) {
if (arr[lhs.f] != -1) {
adj[arr[lhs.f]].pb(i);
}
}
}
arr[lhs.f] = i;
}
F0R (i, n) dfs(i);
cout << *max_element(all(dp)) << endl;
}
Compilation message
savez.cpp:69:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
69 | main() {
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4184 KB |
Output is correct |
2 |
Correct |
2 ms |
4188 KB |
Output is correct |
3 |
Correct |
2 ms |
4188 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
4184 KB |
Output is correct |
2 |
Correct |
2 ms |
4184 KB |
Output is correct |
3 |
Correct |
4 ms |
4392 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
4188 KB |
Output is correct |
2 |
Correct |
47 ms |
4440 KB |
Output is correct |
3 |
Correct |
52 ms |
4692 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
4188 KB |
Output is correct |
2 |
Correct |
53 ms |
4688 KB |
Output is correct |
3 |
Correct |
70 ms |
4640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
35 ms |
5868 KB |
Output is correct |
2 |
Correct |
37 ms |
6232 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
7648 KB |
Output is correct |
2 |
Correct |
30 ms |
8624 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
8568 KB |
Output is correct |
2 |
Correct |
30 ms |
10316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
10428 KB |
Output is correct |
2 |
Correct |
34 ms |
13284 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
48 ms |
24116 KB |
Output is correct |
2 |
Correct |
44 ms |
30096 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
71 ms |
37200 KB |
Output is correct |
2 |
Correct |
96 ms |
47204 KB |
Output is correct |
3 |
Runtime error |
106 ms |
65536 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |