Submission #1027687

#	Time	Username	Problem	Language	Result	Execution time	Memory
1027687		earlyamazon	Savez (COCI15_savez)	C++14	96 / 120	110 ms	65536 KiB

savez

#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mn = 2e5+7;
const int mod1 = 1e9+7;
const int mod2 = 1e9+9;
const int p1 = 269;
const int p2 = 271;
int32_t n,wyn;
string t[mn];
vector<pair<int,int>> hpref[mn];
map<pair<int32_t ,int32_t>, int32_t> dp;
pair<int,int> pot[mn];

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n;
    pot[0] = {1,1};
    for (int i = 1; i < mn; i++){
        pot[i] = {pot[i-1].first*p1%mod1, pot[i-1].second*p2%mod2};
    }
    for (int i = 0; i < n; i++){
        cin>>t[i];
        hpref[i].push_back({0, 0});
        for (int j = 1; j <= (int)t[i].size(); j++){
            hpref[i].push_back({(hpref[i].back().first*p1+t[i][j-1])%mod1, (hpref[i].back().second*p2+t[i][j-1])%mod2});
        }
        int32_t mx = 0;
        for (int j = 1; j <= (int)t[i].size(); j++){
            pair<int,int> h = hpref[i][j];
            if (h == make_pair((hpref[i][t[i].size()].first-((hpref[i][t[i].size()-j].first*pot[j].first)%mod1)+mod1)%mod1, (hpref[i][t[i].size()].second-((hpref[i][t[i].size()-j].second*pot[j].second)%mod2)+mod2)%mod2)){
                mx = max(mx, dp[h]);
            }
        }
        mx++;
        wyn = max(wyn, mx);
        dp[hpref[i].back()] = mx;
        // cout<<hpref[i].size()<<" "<<hpref[i].back().first<<" "<<hpref[i].back().second<<" "<<mx<<"\n";
    }
    cout<<wyn<<"\n";
}

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 12 / 12
• Subtask 5: 12 / 12
• Subtask 6: 12 / 12
• Subtask 7: 12 / 12
• Subtask 8: 12 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12