Submission #696283

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
696283	2023-02-06T06:58:21 Z	bachhoangxuan	Rima (COCI17_rima)	C++17	56 / 140	288 ms	146944 KB

rima

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int mod2=1e9+7;
const int maxn=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000005;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
int res=0,cnt=0;
struct node{
    node *c[26];
    node(){
        for(int i=0;i<26;i++) c[i]=nullptr;
    }
    void cal(){
        int cur=++cnt;
        int ans=ok,Max=1;
        for(int i=0;i<26;i++){
            if(c[i]==nullptr) continue;
            //cout << cnt << ' ' << char('a'+i) << '\n';
            c[i]->cal();
            if(c[i]->ok==0) continue;
            ans++;Max=max(Max,c[i]->dp);
        }
        dp=ans+Max-1;
        //cout << cur << '*' << dp << '\n';
        res=max(res,dp);
    }
    int ok=0,dp=0;
}*root;
void add(string s){
    node *cur=root;
    for(char ch:s){
        if(cur->c[ch-'a']==nullptr) cur->c[ch-'a']=new node();
        cur=cur->c[ch-'a'];
    }
    cur->ok=1;
}
void solve(){
    root=new node();
    int n;cin >> n;
    for(int i=1;i<=n;i++){
        string s;cin >> s;reverse(s.begin(),s.end());
        add(s);
    }
    root->cal();
    cout << res << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Compilation message

rima.cpp: In member function 'void node::cal()':
rima.cpp:43:13: warning: unused variable 'cur' [-Wunused-variable]
   43 |         int cur=++cnt;
      |             ^~~

Subtask #1

56.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Incorrect	288 ms	146944 KB	Output isn't correct
5	Correct	14 ms	3752 KB	Output is correct
6	Incorrect	62 ms	84552 KB	Output isn't correct
7	Incorrect	72 ms	84484 KB	Output isn't correct
8	Incorrect	64 ms	84060 KB	Output isn't correct
9	Incorrect	81 ms	89996 KB	Output isn't correct
10	Incorrect	73 ms	84088 KB	Output isn't correct