oj.uz

Submission #165561

# Submission time Handle Problem Language Result Execution time Memory
165561 2019-11-27T12:44:05 Z Atill83 Savez (COCI15_savez) C++14
120 / 120
 378 ms 32848 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 2e6+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
string s;

map<pll, ll> mp;
ll pw[MAXN];
ll pw2[MAXN];
ll ch[MAXN];
ll bp(ll a, ll b){
    ll res  = 1;
    while(b){
        if(b % 2) res = (res * a) % mod;
        a = (a * a)%mod;
        b = b / 2;
    }
    return res;

}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n;
    pw[0] = 1;
    pw2[0] = 1;
    for(int i = 1; i < MAXN; i++){
        pw[i] = pw[i - 1]*37%mod;
        pw2[i] = pw2[i - 1]*43%mod;
    }
    ll ans = 0;
    for(int i = 0; i < n; i++){
        cin>>s;
        ll hash = 0;
        ll hash2 = 0;

        for(int j = 0; j < (int)s.length(); j++){
            hash += (int)(s[j] - 'A' + 1)*pw[j];
            hash2 += (int) (s[j] - 'A' + 1)*pw2[j];
            hash %= mod;
            hash2 %= mod;
            ch[j] = hash;
        
        }
        //cout<<"hash for: "<<s<<" "<<hash<<" "<<hash2<<endl;
        ll cur = mp[{hash, hash2}];
        ll curH = 0;
        ll curH2 = 0;
        for(int l = 0; l < (int) s.length() - 1; l++){
            ll nw = ch[l];
            ll ter = ch[(int)s.length() - 1] - ch[(int)s.length() - 2 - l] + mod;
            ter %= mod;
            ter = ter*bp(pw[(int)s.length() - l - 1], mod - 2);
            ter %= mod;
            
            curH += pw[l]*((int)(s[l] - 'A' + 1));
            curH %= mod;
            curH2 += pw2[l]*((int)(s[l] - 'A' + 1));
            curH2 %= mod;
            if(nw != ter){
                //cout<<s<<" "<<l<<endl;
                //cout<<nw<<" "<<ter<<endl;
                continue;
            }
            //cout<<nw<<" "<<curH<<" "<<curH2<<endl;
            mp[{hash, hash2}] = max(mp[{hash, hash2}], mp[{curH, curH2}] + 1);
        }
        mp[{hash, hash2}] = max(mp[{hash, hash2}], cur + 1LL);
        //cout<<s<<" "<<mp[{hash, hash2}]<<endl;
        ans = max(ans, mp[{hash, hash2}]);
    }
    cout<<ans<<endl;

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 31608 KB Output is correct
2 Correct 41 ms 31608 KB Output is correct
3 Correct 42 ms 31708 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 31740 KB Output is correct
2 Correct 43 ms 31616 KB Output is correct
3 Correct 57 ms 31820 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 346 ms 32128 KB Output is correct
2 Correct 361 ms 31996 KB Output is correct
3 Correct 378 ms 32248 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 31864 KB Output is correct
2 Correct 249 ms 32604 KB Output is correct
3 Correct 304 ms 32588 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 32244 KB Output is correct
2 Correct 277 ms 31736 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 32352 KB Output is correct
2 Correct 240 ms 32220 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 32632 KB Output is correct
2 Correct 309 ms 32696 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 289 ms 32792 KB Output is correct
2 Correct 236 ms 32596 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 32848 KB Output is correct
2 Correct 200 ms 32248 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 32548 KB Output is correct
2 Correct 198 ms 32804 KB Output is correct
3 Correct 138 ms 31992 KB Output is correct