oj.uz

답안 #184085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
184085 2020-01-10T12:48:35 Z awlintqaa Rima (COCI17_rima) C++14
56 / 140
 587 ms 156764 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 500
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;//998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n,MX;
string x;
struct NODE{
        int dp,yes;
        NODE *ch[29];
        NODE(){
                dp=yes=0;
                for(int i=0;i<26;i++)ch[i]=NULL;
        }
}*root=new NODE;
void add(NODE *node,int pos,int end){
        if(pos==end){
                node->yes=1;
                return ;
        }
        int id=x[pos]-'a';
        if(node->ch[id]==NULL)node->ch[id]=new NODE;
        add(node->ch[id],pos+1,end);
}
void query(NODE *node){
        int sum=0;
        for(int i=0;i<26;i++){
                if(node->ch[i]==NULL)C;
                query(node->ch[i]);
                sum+=node->ch[i]->dp;
        }
        if(node->yes)sum++,node->dp=sum;
        MX=max(MX,sum);
}
int main(){
        cin>>n;
        for(int i=0;i<n;i++){
                cin>>x;
                reverse(x.begin(),x.end());
                add(root,0,x.size());
        }
        query(root);
        cout<<MX<<endl;
}

Subtask #1
56.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 632 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 587 ms 156764 KB Output isn't correct
5 Correct 202 ms 3900 KB Output is correct
6 Incorrect 143 ms 91288 KB Output isn't correct
7 Incorrect 136 ms 90904 KB Output isn't correct
8 Incorrect 146 ms 90756 KB Output isn't correct
9 Incorrect 333 ms 96988 KB Output isn't correct
10 Incorrect 134 ms 90636 KB Output isn't correct