oj.uz

답안 #1027684

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027684 2024-07-19T09:02:05 Z earlyamazon Savez (COCI15_savez) C++14
96 / 120
 189 ms 65536 KB 
#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;
int n,wyn;
string t[mn];
vector<pair<int,int>> hpref[mn];
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};
    }
    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});
        }
        int 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.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 14424 KB Output is correct
2 Correct 6 ms 14428 KB Output is correct
3 Correct 7 ms 14496 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 14428 KB Output is correct
2 Correct 7 ms 14500 KB Output is correct
3 Correct 10 ms 15964 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 85 ms 32592 KB Output is correct
2 Correct 90 ms 32628 KB Output is correct
3 Correct 91 ms 34280 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 16216 KB Output is correct
2 Correct 41 ms 33364 KB Output is correct
3 Correct 58 ms 34644 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 39000 KB Output is correct
2 Correct 43 ms 39508 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 38992 KB Output is correct
2 Correct 43 ms 38996 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 39420 KB Output is correct
2 Correct 44 ms 39212 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 40024 KB Output is correct
2 Correct 47 ms 40380 KB Output is correct

Subtask #9
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 189 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 62 ms 61524 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -