oj.uz

답안 #994052

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994052 2024-06-07T05:11:58 Z vjudge1 Rima (COCI17_rima) C++17
14 / 140
 297 ms 134708 KB 
#include<bits/stdc++.h>

using namespace std;

struct node
{
  node * ch[26] = {NULL};
  bool e = false;
  int dp;

  int dfs()
  {
    //cerr << "I'm" << endl;
    int ans = 0;
    int mx[2] = {0};
    dp = e;
    for(int i = 0; i < 26; i++)
      {
	if(ch[i] == NULL) continue;

	// cerr << "---> " << char(i + 'a') << endl;
	ans = max(ans, ch[i]->dfs());
	// cerr << ch[i] -> dp << endl;
	// cerr << "<---" << char(i + 'a') << endl;
	if(ch[i] -> e)
	  {
	    mx[1] = max(mx[1], ch[i]->dp - 1);
	    if(mx[0] < mx[1]) swap(mx[0], mx[1]);
	    dp++;
	  }
      }
    
    dp += mx[1];
    ans = max(ans, dp + mx[0]);
    return ans;
  }
};

struct Trie
{
  node * root;
  Trie() {
    root = new node();
  }

  void insert(string &s)
  {
    node *cur = root;
    for(int i = s.size() - 1; i >= 0; i--)
      {
	int idx = s[i] - 'a';
	if(cur -> ch[idx] == NULL)
	  cur -> ch[idx] = new node();
	cur = cur -> ch[idx];
      }
    cur -> e = true;
  }

  int compute()
  {
    return root->dfs();
  }
  
} T;

int main()
{
  int n;
  cin >> n;
  for(int i = 0; i < n; i ++)
    {
      string s;
      cin >> s;
      T.insert(s);
    }
  cout << T.compute() << endl;
  return 0;
}

Subtask #1
14.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Correct 1 ms 344 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 297 ms 134708 KB Output isn't correct
5 Incorrect 41 ms 1112 KB Output isn't correct
6 Incorrect 71 ms 78776 KB Output isn't correct
7 Incorrect 66 ms 78672 KB Output isn't correct
8 Incorrect 67 ms 78536 KB Output isn't correct
9 Incorrect 112 ms 81592 KB Output isn't correct
10 Incorrect 64 ms 78276 KB Output isn't correct