oj.uz

Submission #1028076

# Submission time Handle Problem Language Result Execution time Memory
1028076 2024-07-19T13:04:58 Z earlyamazon Savez (COCI15_savez) C++14
0 / 120
 77 ms 47344 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int mn = 5e5+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<int> hpref[mn];
map<int32_t, int32_t> dp;
int pot[mn];

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie();
    cin>>n;
    pot[0] = 1;
    for (int i = 1; i < mn; i++){
        pot[i] = pot[i-1]*p1%mod1;
    }
    for (int i = 0; i < n; i++){
        cin>>t[i];
        hpref[i].resize(t[i].size()+1);
        hpref[i][0] = 0;
        for (int j = 1; j <= (int)t[i].size(); j++){
            hpref[i][j] = (hpref[i].back()*p1+t[i][j-1])%mod1;
        }
        int32_t mx = 0;
        for (int j = 1; j <= (int)t[i].size(); j++){
            int h = hpref[i][j];
            if (h == (hpref[i][t[i].size()]-((hpref[i][t[i].size()-j]*pot[j])%mod1)+mod1)%mod1){
                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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 31580 KB Output is correct
2 Incorrect 16 ms 31576 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 31576 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 40536 KB Output is correct
2 Incorrect 21 ms 40540 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 32344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 40532 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 40948 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 41508 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 42344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 44 ms 44880 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 77 ms 47344 KB Output isn't correct
2 Halted 0 ms 0 KB -