oj.uz

답안 #229922

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
229922 2020-05-07T06:42:59 Z mohamedsobhi777 Rima (COCI17_rima) C++14
56 / 140
 401 ms 250016 KB 
#include<bits/stdc++.h>

using namespace std ; 


const int N = 3e6 + 7 ; 

int n  ; 
string ss[N] ; 

struct trie{
    int nxt[N][27] ; 
    int cnt[N] ; 
    int t = 1 ; 
    int dp[N][2] ; 
    void add(string &add_ ){
        int cur = 1 ; 
        int sz = add_.size() ; 
        for(int i = 0 ;i < sz ;i++ ){
            int c = add_[i] - 'a' ; 
            if(!nxt[cur][c])nxt[cur][c] = ++t ;
            cur = nxt[cur][c] ;
        }
        cnt[cur] ++ ; 
    }

    int solve(int i , bool flag){
        if(dp[i][flag]!=-1) return dp[i][flag] ;
        if(flag && !cnt[i]) return -1e8 ; 
        int ret = 0 ; 
        int kids = 0 ; 
        
        for(int j = 0 ;j < 26 ;j ++){
            kids +=cnt[nxt[i][j]] ; 
        }

        for(int j = 0 ;j < 26 ; j++){
            if(nxt[i][j]){
                ret = max(ret ,  solve(nxt[i][j] , flag )  ) ; 
                ret = max(ret , solve(nxt[i][j] , 1) + kids ) ; 
            }
        }
        return dp[i][flag] =ret ; 
    }

} tr; 

int main(){
    ios_base::sync_with_stdio(0) ; 
    cin.tie(0) ; 
    //freopen("in.in" , "r" , stdin) ; 
    memset(tr.dp , -1 , sizeof tr.dp) ; 
    cin>>n ; 
    for(int i = 0 ; i < n ;i++){
        string x ; 
        cin>>x ; 
        reverse( x .begin() , x.end()) ; 
        tr.add(x) ; 
    }
    cout<< tr.solve(1 , 0) ;  
    return 0 ;
}

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 117880 KB Output is correct
2 Correct 76 ms 117880 KB Output is correct
3 Correct 66 ms 117880 KB Output is correct
4 Incorrect 401 ms 185132 KB Output isn't correct
5 Correct 91 ms 118904 KB Output is correct
6 Incorrect 181 ms 248480 KB Output isn't correct
7 Incorrect 179 ms 248676 KB Output isn't correct
8 Incorrect 177 ms 248740 KB Output isn't correct
9 Incorrect 212 ms 250016 KB Output isn't correct
10 Incorrect 177 ms 248652 KB Output isn't correct