# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
849552 | 2023-09-15T02:22:03 Z | x0r | Rima (COCI17_rima) | C++17 | 210 ms | 118432 KB |
#include <bits/stdc++.h> #define name "" #define ll long long #define ld long double #define fi first #define se second #define pll pair < ll, ll > #define pii pair < int, int > #define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define SZE(x) ((int)(x).size()) #define pb push_back #define mp make_pair #define lnode node * 2, l, (l + r) / 2 #define rnode node * 2 + 1, (l + r) / 2 + 1, r using namespace std; const ld EPS = 1e-9; const int INF = 1e9 + 7; const ll LINF = 1E18; const int NMAX = 2e5; const ll MOD = 1e9 + 7; const ll BASE = 2309; struct Node { int cnt, nxt[26], dp; Node() { cnt = 0; dp = 0; for (int i = 0; i < 26; i++) nxt[i] = -1; } }; vector < Node > trie; int n, res = 0; void create() { trie.pb(Node()); return ; } void add(const string &s) { int cur = 0; for (auto c : s) { if (trie[cur].nxt[c - 'a'] == -1) { create(); trie[cur].nxt[c - 'a'] = SZE(trie) - 1; } cur = trie[cur].nxt[c - 'a']; } trie[cur].cnt ++; } void dfs(int u) { int total = 0; vector < int > temp; for (int i = 0; i < 26; i++) { int v = trie[u].nxt[i]; if (v == -1) continue; dfs(v); total += trie[v].cnt; temp.pb(trie[v].dp); } sort(temp.begin(), temp.end(), greater < int >()); if (trie[u].cnt != 0) { trie[u].dp = trie[u].cnt + total; if (SZE(temp)) trie[u].dp += temp[0] - 1; } res = max(res, trie[u].dp); if (SZE(temp) >= 2) res = max(res, temp[0] + temp[1] + total - 2 + trie[u].cnt); } int main() { fast; if(fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); } //int t; cin >> t; while (t --) sol(); cin >> n; create(); for (int i = 1; i <= n; i++) { string s; cin >> s; reverse(s.begin(), s.end()); add(s); } dfs(0); cout << res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 210 ms | 118432 KB | Output is correct |
5 | Incorrect | 16 ms | 3652 KB | Output isn't correct |
6 | Correct | 59 ms | 63308 KB | Output is correct |
7 | Correct | 61 ms | 63756 KB | Output is correct |
8 | Correct | 60 ms | 63004 KB | Output is correct |
9 | Correct | 76 ms | 67660 KB | Output is correct |
10 | Correct | 58 ms | 63884 KB | Output is correct |