oj.uz

답안 #257279

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257279 2020-08-04T03:54:28 Z kshitij_sodani Rima (COCI17_rima) C++14
56 / 140
 475 ms 149624 KB 
#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;
	for(auto j:kk[no]){
		dfs(j);
		su+=dp[j];
	}
	ans=max(ans,su);
	if(val[no]==1){
		dp[no]=su+1;
		ans=max(ans,su+1);
	}

}
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
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 73208 KB Output is correct
2 Correct 43 ms 73216 KB Output is correct
3 Correct 44 ms 73208 KB Output is correct
4 Incorrect 475 ms 149624 KB Output isn't correct
5 Correct 68 ms 73596 KB Output is correct
6 Incorrect 98 ms 127476 KB Output isn't correct
7 Incorrect 110 ms 127432 KB Output isn't correct
8 Incorrect 103 ms 127496 KB Output isn't correct
9 Incorrect 137 ms 129028 KB Output isn't correct
10 Incorrect 105 ms 127408 KB Output isn't correct