# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
701215 | 2023-02-20T14:45:26 Z | Do_you_copy | Rima (COCI17_rima) | C++17 | 337 ms | 205160 KB |
#include <bits/stdc++.h> #define fi first #define se second #define pb push_back #define faster ios_base::sync_with_stdio(0); cin.tie(0); using namespace std; using ll = long long; using pii = pair <int, int>; const int maxN = 3e6 + 10; const int inf = 0x3f3f3f3f; int n; string s[maxN]; struct TNode{ int a[26]; bool ok; TNode(){ memset(a, 0, sizeof(a)); ok = 0; } }; vector <TNode> S(1); int dp[maxN]; void add(int id, int cur, int pos){ if (pos == signed(s[cur].length())){ S[id].ok = 1; return; } if (!S[id].a[s[cur][pos] - 'a']){ S[id].a[s[cur][pos]- 'a'] = S.size(); S.pb(TNode()); } add(S[id].a[s[cur][pos] - 'a'], cur, pos + 1); } int ans = 0; void dfs(int u){ pii maxx = {0, 0}; int sum = S[u].ok; for (int i = 0; i < 26; ++i){ if (S[u].a[i]){ dfs(S[u].a[i]); sum += dp[S[u].a[i]]; } } ans = max(ans, sum); if (S[u].ok){ dp[u] = sum; } } void Init(){ cin >> n; for (int i = 1; i <= n; ++i){ cin >> s[i]; reverse(s[i].begin(), s[i].end()); add(0, i, 0); } dfs(0); cout << ans; } #define taskname "test" signed main(){ if (fopen(taskname ".inp", "r")){ freopen(taskname ".inp", "r", stdin); freopen(taskname ".out", "w", stdout); } int tt = 1; //cin >> tt; while (tt--){ Init(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 45 ms | 94244 KB | Output is correct |
2 | Correct | 40 ms | 94228 KB | Output is correct |
3 | Correct | 41 ms | 94220 KB | Output is correct |
4 | Incorrect | 337 ms | 205160 KB | Output isn't correct |
5 | Correct | 109 ms | 98836 KB | Output is correct |
6 | Incorrect | 111 ms | 150152 KB | Output isn't correct |
7 | Incorrect | 109 ms | 150040 KB | Output isn't correct |
8 | Incorrect | 112 ms | 150172 KB | Output isn't correct |
9 | Incorrect | 178 ms | 153060 KB | Output isn't correct |
10 | Incorrect | 106 ms | 150304 KB | Output isn't correct |