Submission #625003

#	Time	Username	Problem	Language	Result	Execution time	Memory
625003		MilosMilutinovic	Rima (COCI17_rima)	C++14	28 / 140	474 ms	102816 KiB

rima

/**
 *    author:  wxhtzdy
 *    created: 09.08.2022 10:49:03
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n;
  cin >> n;
  vector<string> s(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i]; 
    reverse(s[i].begin(), s[i].end());
  }
  sort(s.begin(), s.end(), [&](string a, string b) {
    if (a.size() != b.size()) {
      return a.size() < b.size();
    } else {
      return a < b;
    }
  });
  const int A = 26;
  vector<vector<int>> trie(1, vector<int>(A, -1));
  vector<int> dp(1, 0);
  for (int i = 0; i < n; i++) {
    int p = 0;          
    vector<int> v(1, p);
    for (int j = 0; j < (int) s[i].size(); j++) {
      int c = (int) (s[i][j] - 'a');
      if (trie[p][c] == -1) {
        trie[p][c] = (int) trie.size();
        trie.push_back(vector<int>(A, -1));
        dp.push_back(0);
      }
      p = trie[p][c];
      v.push_back(p);
    }    
    int sz = (int) v.size(); 
    int mx = max(dp[v[sz - 2]], dp[v[sz - 1]]) + 1;
    dp[v[sz - 2]] = max(dp[v[sz - 2]], mx);
    dp[v[sz - 1]] = max(dp[v[sz - 1]], mx);
  }
  cout << *max_element(dp.begin(), dp.end()) << '\n';                     
  return 0;
}

• Subtask 1: 28 / 140