Submission #474432

#TimeUsernameProblemLanguageResultExecution timeMemory
474432Lam_lai_cuoc_doiRima (COCI17_rima)C++17
14 / 140
317 ms134716 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using ull = unsigned long long; template <class T> void read(T &x) { x = 0; register int c; while ((c = getchar()) && (c > '9' || c < '0')) ; for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0'; } constexpr bool typetest = 0; constexpr int N = 5e5 + 5; constexpr int Inf = 1e9 + 7; struct node { node *child[26]; int v; node() { for (int i = 0; i < 26; ++i) child[i] = NULL; v = 0; } }; struct trie { node root; void Update(const string &s, int v) { node *a = &root; int id(0); while (1) { if (id == (int)s.size()) { a->v = max(a->v, v); return; } if (!(a->child[s[id] - 'a'])) a->child[s[id] - 'a'] = new node; a = a->child[s[id] - 'a']; ++id; } } int Get(const string &s) { int ans(0), id(0); node *a = &root; while (1) { if (id >= (int)s.size() - 1) { ans = max(ans, a->v); for (int i = 0; i < 26; ++i) if ((id != (int)s.size() - 1 || i != s[id] - 'a') && a->child[i]) ans = max(ans, a->child[i]->v); } if (id == (int)s.size()) break; if (!(a->child[s[id] - 'a'])) break; a = a->child[s[id] - 'a']; ++id; } return ans; } } f; int n; void Read() { cin >> n; } void Solve() { int ans(0); for (int i = 1; i <= n; ++i) { string s; cin >> s; reverse(s.begin(), s.end()); int x = f.Get(s) + 1; ans = max(ans, x); f.Update(s, x); } cout << ans; } int32_t main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t(1); if (typetest) cin >> t; for (int _ = 1; _ <= t; ++_) { //cout << "Case #" << _ << ": "; Read(); Solve(); } //cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n"; }

Compilation message (stderr)

rima.cpp: In function 'void read(T&)':
rima.cpp:12:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   12 |     register int c;
      |                  ^
#Verdict Execution timeMemoryGrader output
Fetching results...