oj.uz

답안 #229674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229674 2020-05-05T19:58:50 Z MohamedAhmed04 Rima (COCI17_rima) C++14
140 / 140
 304 ms 166648 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 3e6 + 10 ;

string arr[MAX] ;
int n ;
int tree[MAX][27] , Cnt[MAX] , dp[MAX] , finished[MAX] ;

int last = 0 ;

void Insert(string s)
{
	int node = 0 ;
	for(int i = 0 ; i < s.size() ; ++i)
	{
		if(i == s.size()-1)
			Cnt[node]++ ;
		char c = s[i] ;
		int idx = c - 'a' ;
		if(!tree[node][idx])
			tree[node][idx] = ++last ;
		node = tree[node][idx] ;
	}
	finished[node] = 1 ;
}

int ans = 0 ;

void solve(int node)
{
	pair<int , int>p = {0 , 0} ;
	pair<int , int>p2 ;
	for(int i = 0 ; i < 26 ; ++i)
	{
		if(!tree[node][i])
			continue ;
		int child = tree[node][i] ;
		solve(child) ;
		p2 = {max(p.first, dp[child]), min(p.first, dp[child])} ;
		p = max(p , p2) ;
	}
	ans = max(ans , p.first+p.second+Cnt[node]+finished[node]) ;
	dp[node] = p.first + Cnt[node] ;
	if(!finished[node])
		dp[node] = 0 ;
	return ;
}

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 0 ; i < n ; ++i)
	{
		cin>>arr[i] ;
		reverse(arr[i].begin() , arr[i].end()) ;
		Insert(arr[i]) ;
	}
	solve(0) ;
	return cout<<ans<<"\n" , 0 ;
}

Compilation message

rima.cpp: In function 'void Insert(std::__cxx11::string)':
rima.cpp:16:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < s.size() ; ++i)
                  ~~^~~~~~~~~~
rima.cpp:18:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i == s.size()-1)
      ~~^~~~~~~~~~~~~

Subtask #1
140.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 57 ms 94328 KB Output is correct
2 Correct 58 ms 94328 KB Output is correct
3 Correct 56 ms 94328 KB Output is correct
4 Correct 304 ms 166648 KB Output is correct
5 Correct 80 ms 98040 KB Output is correct
6 Correct 115 ms 152212 KB Output is correct
7 Correct 113 ms 151920 KB Output is correct
8 Correct 107 ms 151724 KB Output is correct
9 Correct 135 ms 158572 KB Output is correct
10 Correct 109 ms 151892 KB Output is correct