답안 #718237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718237	2023-04-03T17:31:57 Z	Ahmed57	Rima (COCI17_rima)	C++14	42 / 140	332 ms	262144 KB

rima

#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][2];
long long calc(int node,int ch){
    if(dp[node][ch]!=-1)return dp[node][ch];
    long long ma = 0 , sum = 0;
    for(auto j:adj[node]){
        sum+=mark[j];
    }
    if(ch==1){
        long long su = 0;
        for(auto j:adj[node]){
            if(mark[j]>1)su+=calc(j,1);
        }
        return dp[node][ch] = su+sum;
    }
    long long su = 0;
    for(auto j:adj[node]){
        if(mark[j]>1){
            su +=calc(j,1);
        }
    }
    for(auto j:adj[node]){
        if(mark[j]==1){
            ma = max(ma,calc(j,0)+su);
        }else{
            ma = max(ma,calc(j,0)+(su-calc(j,1)));
        }
    }
    return dp[node][ch]=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 =0;
    for(int i = 0;i<=Nnode;i++){
        if(mark[i]){
            all = max(all,calc(i,0)+mark[i]);
        }
    }
    cout<<all<<endl;
    return 0 ;
}

Subtask #1

42.0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Correct	52 ms	117764 KB	Output is correct
2	Correct	53 ms	117780 KB	Output is correct
3	Correct	54 ms	117780 KB	Output is correct
4	Runtime error	332 ms	262144 KB	Execution killed with signal 9
5	Incorrect	66 ms	118604 KB	Output isn't correct
6	Incorrect	126 ms	204152 KB	Output isn't correct
7	Incorrect	121 ms	203868 KB	Output isn't correct
8	Incorrect	123 ms	203808 KB	Output isn't correct
9	Incorrect	138 ms	207176 KB	Output isn't correct
10	Incorrect	117 ms	203728 KB	Output isn't correct