Submission #228055

#	Time	Username	Problem	Language	Result	Execution time	Memory
228055		MohamedAhmed04	Rima (COCI17_rima)	C++14	56 / 140	344 ms	161528 KiB

rima

#include <bits/stdc++.h>

using namespace std ;

const int MAX = 3e6 + 10 ;

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

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] ;
	}
}

int query(string s)
{
	int node = 0 , cnt = Cnt[0] ;
	for(int i = 0 ; i < s.size() ; ++i)
	{
		char c = s[i] ; 
		int idx = c - 'a' ;
		if(!tree[node][idx])
			return 0 ;
		node = tree[node][idx] ;
		if(!Cnt[node] && i != s.size()-1)
			cnt = 0 ;
		else
			cnt += Cnt[node] ;
	}
	return cnt ;
}

bool cmp(string &a , string &b)
{
	if(a.size() == b.size())
		return a < b ;
	else
		return a.size() < b.size() ;
}

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()) ;
	}
	sort(arr , arr + n , cmp) ;
	int ans = 0 ;
	for(int i = 0 ; i < n ; ++i)
	{
		string s = arr[i].substr(0 , arr[i].size()-1) ;
		ans = max(ans , query(s)+1) ;
		Insert(arr[i]) ;
	}
	return cout<<ans<<"\n" , 0 ; 
}		

Compilation message (stderr)

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)
      ~~^~~~~~~~~~~~~
rima.cpp: In function 'int query(std::__cxx11::string)':
rima.cpp:31:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < s.size() ; ++i)
                  ~~^~~~~~~~~~
rima.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(!Cnt[node] && i != s.size()-1)
                    ~~^~~~~~~~~~~~~

• Subtask 1: 56 / 140