oj.uz

Submission #165540

# Submission time Handle Problem Language Result Execution time Memory
165540 2019-11-27T12:18:29 Z Atill83 Savez (COCI15_savez) C++14
108 / 120
 268 ms 32924 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];


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;
    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;
        }
        ll cur = mp[{hash, hash2}];
        ll curH = 0;
        ll curH2 = 0;
        for(int l = 0; l < (int) s.length() - 1; l++){
            if(s[l] != s[s.length() - 1 - l]){
                break;
            }
            curH += pw[l]*((int)(s[l] - 'A' + 1));
            curH %= mod;
            curH2 += pw2[l]*((int)(s[l] - 'A' + 1));
            curH2 %= mod;
            mp[{hash, hash2}] = max(mp[{hash, hash2}], mp[{curH, curH2}] + 1);
        }
        mp[{hash, hash2}] = max(mp[{hash, hash2}], cur + 1LL);
        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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 31608 KB Output is correct
2 Correct 91 ms 31736 KB Output is correct
3 Incorrect 100 ms 31708 KB Output isn't correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 31608 KB Output is correct
2 Correct 43 ms 31580 KB Output is correct
3 Correct 44 ms 31736 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 31864 KB Output is correct
2 Correct 201 ms 32048 KB Output is correct
3 Correct 209 ms 32092 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 31964 KB Output is correct
2 Correct 200 ms 32748 KB Output is correct
3 Correct 268 ms 32724 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 175 ms 32236 KB Output is correct
2 Correct 118 ms 31700 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 32336 KB Output is correct
2 Correct 95 ms 32140 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 32688 KB Output is correct
2 Correct 90 ms 32588 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 32700 KB Output is correct
2 Correct 88 ms 32476 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 32924 KB Output is correct
2 Correct 96 ms 32224 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 32376 KB Output is correct
2 Correct 103 ms 32716 KB Output is correct
3 Correct 149 ms 31992 KB Output is correct