oj.uz

Submission #1043047

# Submission time Handle Problem Language Result Execution time Memory
1043047 2024-08-03T19:21:15 Z earlyamazon Savez (COCI15_savez) C++14
120 / 120
 80 ms 33620 KB 
//wzorcowka podwojne hasze

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

#define int long long

const int mn = 2e6+7;
const int mod1 = 1e9+7;
const int mod2 = 1e9+9;
const int p1 = 269;
const int p2 = 271;
int n,wyn;
map<pair<int, int>, int> 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};
    }
    string s;
    vector<pair<int,int>> hpref;
    for (int i = 0; i < n; i++){
        hpref.clear();
        cin>>s;
        hpref.push_back({0, 0});
        for (int j = 1; j <= (int)s.size(); j++){
            hpref.push_back({(hpref.back().first*p1+s[j-1])%mod1, (hpref.back().second*p2+s[j-1])%mod2});
        }
        int mx = 0;
        for (int j = 1; j <= (int)s.size(); j++){
            pair<int,int> h = hpref[j];
            if (h == make_pair((hpref[s.size()].first-((hpref[s.size()-j].first*pot[j].first)%mod1)+mod1)%mod1, (hpref[s.size()].second-((hpref[s.size()-j].second*pot[j].second)%mod2)+mod2)%mod2)){
                mx = max(mx, dp[h]);
            }
        }
        mx++;
        wyn = max(wyn, mx);
        dp[hpref.back()] = mx;
        // cout<<hpref.size()<<" "<<hpref.back().first<<" "<<hpref.back().second<<" "<<mx<<"\n";
    }
    cout<<wyn<<"\n";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 31580 KB Output is correct
2 Correct 16 ms 31568 KB Output is correct
3 Correct 16 ms 31580 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31624 KB Output is correct
2 Correct 17 ms 31580 KB Output is correct
3 Correct 19 ms 31832 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 32592 KB Output is correct
2 Correct 80 ms 32612 KB Output is correct
3 Correct 77 ms 32580 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 31732 KB Output is correct
2 Correct 38 ms 32592 KB Output is correct
3 Correct 48 ms 32824 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 32596 KB Output is correct
2 Correct 38 ms 32596 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 32592 KB Output is correct
2 Correct 36 ms 32604 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 32604 KB Output is correct
2 Correct 36 ms 32604 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 32372 KB Output is correct
2 Correct 36 ms 32820 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 32460 KB Output is correct
2 Correct 42 ms 32772 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 32592 KB Output is correct
2 Correct 49 ms 32900 KB Output is correct
3 Correct 70 ms 33620 KB Output is correct