fork download
copy 
  1. // ~~ icebear love attttt ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "icebearat"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 2e5 + 5;
  38. int numStr;
  39. string str[N];
  40.  
  41. struct Trie {
  42.     struct Node {
  43.         Node *child[26];
  44.         int cnt;
  45.         Node() {
  46.             REP(i, 26) child[i] = NULL;
  47.             cnt = 0;
  48.         }
  49.     };
  50.  
  51.     Node *root;
  52.     Trie() {
  53.         root = new Node();
  54.     }
  55.  
  56.     void add(string &s) {
  57.         Node *p = root;
  58.         for(char c : s) {
  59.             int pos = c - 'a';
  60.             if (p -> child[pos] == NULL) p -> child[pos] = new Node();
  61.             p = p -> child[pos];
  62.         }
  63.         p -> cnt++;
  64.     }
  65.  
  66.     int query(string &s) {
  67.         int ans = 0;
  68.         Node *p = root;
  69.         for(char c : s) {
  70.             int pos = c - 'a';
  71.             p = p -> child[pos];
  72.             ans += p -> cnt;
  73.         }
  74.         return ans;
  75.     }
  76. } trie;
  77.  
  78. void init(void) {
  79.     cin >> numStr;
  80.     FOR(i, 1, numStr) cin >> str[i];
  81. }
  82.  
  83. void process(void) {
  84.     int ans = 0;
  85.     sort(str + 1, str + numStr + 1, [&](const string &a, const string &b){
  86.         return a.size() < b.size();
  87.     });
  88.     FOR(i, 1, numStr) {
  89.         reverse(all(str[i]));
  90.         trie.add(str[i]);
  91.         maximize(ans, trie.query(str[i]));
  92.     }
  93.     cout << ans;
  94. }
  95.  
  96. int main() {
  97.     ios_base::sync_with_stdio(0);
  98.     cin.tie(0); cout.tie(0);
  99.     if (fopen(task".inp", "r")) {
  100.         freopen(task".inp", "r", stdin);
  101.         freopen(task".out", "w", stdout);
  102.     }
  103.     int tc = 1;
  104. //    cin >> tc;
  105.     while(tc--) {
  106.         init();
  107.         process();
  108.     }
  109.     return 0;
  110. }
  111.  
  112.  
Success #stdin #stdout 0.01s 9736KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/l6X3Lz
language:
C++14 (gcc 8.3)
created:
5 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!