# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
718252 |
2023-04-03T18:10:19 Z |
Ahmed57 |
Rima (COCI17_rima) |
C++14 |
|
303 ms |
239992 KB |
#include <bits/stdc++.h>
using namespace std ;
//TRIE
struct node{
node *nxt[26];
int is = 0;
node(){
is = 0;
for(int i = 0;i<26;i++){
nxt[i] = NULL;
}
}
};
void inser(string w,node *root){
for(auto ch:w){
if(root->nxt[ch-'a']==NULL){
root->nxt[ch-'a'] = new node();
}
root=root->nxt[ch-'a'];
}
root->is++;
}
int Nnode = 0;
vector<int> adj[3000001];
int mark[3000001];
void build(node *root){
int cur = Nnode;
for(int j = 0;j<26;j++){
if(root->nxt[j]!=NULL){
Nnode++;
adj[cur].push_back(Nnode);
mark[Nnode] = root->nxt[j]->is;
build(root->nxt[j]);
}
}
}
long long dp[3000001];
long long calc(int node){
if(dp[node]!=-1)return dp[node];
long long ma = 0 , sum = 0;
for(auto j:adj[node]){
sum+=mark[j];
}
for(auto j:adj[node]){
if(mark[j]>0){
ma = max(ma,calc(j));
}
}
return dp[node]=ma+sum;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n;
cin>>n;
node *root = new node();
while(n--){
string s;cin>>s;
reverse(s.begin(),s.end());
inser(s,root);
}
build(root);
memset(dp,-1,sizeof dp);
long long all =calc(0);
cout<<all<<endl;
return 0 ;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
50 ms |
94292 KB |
Output isn't correct |
2 |
Incorrect |
41 ms |
94280 KB |
Output isn't correct |
3 |
Incorrect |
43 ms |
94228 KB |
Output isn't correct |
4 |
Incorrect |
303 ms |
239992 KB |
Output isn't correct |
5 |
Correct |
52 ms |
94924 KB |
Output is correct |
6 |
Incorrect |
110 ms |
180624 KB |
Output isn't correct |
7 |
Incorrect |
105 ms |
180500 KB |
Output isn't correct |
8 |
Incorrect |
104 ms |
180304 KB |
Output isn't correct |
9 |
Incorrect |
137 ms |
183752 KB |
Output isn't correct |
10 |
Incorrect |
108 ms |
180308 KB |
Output isn't correct |