답안 #257285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
257285	2020-08-04T04:18:21 Z	kshitij_sodani	Rima (COCI17_rima)	C++14	70 / 140	418 ms	149624 KB

rima

#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
int co=0;
int n;
int pre[3100001][26];
vector<int> kk[3100001];
int val[3100001];
int dp[3100001];
void insert(string s){
	int cur=0;
	for(int i=s.size()-1;i>=0;i--){
		if(pre[cur][s[i]-'a']==0){
			co+=1;
			pre[cur][s[i]-'a']=co;
			kk[cur].pb(co);
		}
		cur=pre[cur][s[i]-'a'];
	}
	val[cur]+=1;
}
int ans=0;
void dfs(int no){
	int su=0;
	int ma=0;
	vector<int> mm;
	for(auto j:kk[no]){
		dfs(j);
		su+=min(dp[j],1);
		ma=max(ma,dp[j]);
		mm.pb(-dp[j]);
	}
	sort(mm.begin(),mm.end());
	int su2=su;
	for(int i=0;i<min((int)mm.size(),(int)2);i++){
		if(mm[i]<0){
			su2+=-mm[i]-1;
		}
	}
	if(ma){
		su+=ma-1;
	}
	ans=max(ans,su);
	ans=max(ans,su2);
	if(val[no]==1){
		dp[no]=su+1;
		ans=max(ans,dp[no]);
	}

}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n;
	for(int i=0;i<n;i++){
		string s;
		cin>>s;
		//	int x=s.size();
		insert(s);
	}
	dfs(0);
	cout<<ans<<endl;



	return 0;
}

Subtask #1

70.0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Correct	42 ms	73208 KB	Output is correct
2	Correct	47 ms	73208 KB	Output is correct
3	Correct	43 ms	73216 KB	Output is correct
4	Correct	418 ms	149624 KB	Output is correct
5	Correct	61 ms	73980 KB	Output is correct
6	Incorrect	130 ms	146392 KB	Output isn't correct
7	Incorrect	135 ms	146236 KB	Output isn't correct
8	Incorrect	129 ms	146184 KB	Output isn't correct
9	Incorrect	150 ms	147832 KB	Output isn't correct
10	Incorrect	118 ms	146132 KB	Output isn't correct