oj.uz

Submission #253679

# Submission time Handle Problem Language Result Execution time Memory
253679 2020-07-28T14:01:31 Z Vimmer Savez (COCI15_savez) C++14
120 / 120
 940 ms 17272 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 2000050
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;

//typedef tree <ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


gp_hash_table <int, int> mp;

ll pw[N];

ll mult(ll x, ll y) {return (x * y) % M;}

ll sm(ll x, ll y) {return (x + y) % M;}

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    pw[0] = 1;

    for (register int i = 1; i < N; i++) pw[i] = mult(pw[i - 1], 31);

    int n;

    cin >> n;

    int ans = 0;

    for (int i = 0; i < n; i++)
    {
        string s;

        cin >> s;

        deque <char> l, r; l.clear(); r.clear();

        int val = 1;

        int hsh = 0;

        for (int j = 0; j < sz(s); j++)
        {
            l.pb(s[j]);

            r.pf(s[sz(s) - j - 1]);

            hsh = sm(hsh, mult(s[j] - 'A' + 1, pw[j]));

            if (l == r) val = max(val, mp[hsh] + 1);

        }

        mp[hsh] = val;

        ans = max(ans, val);
    }

    cout << ans << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 16000 KB Output is correct
2 Correct 17 ms 15932 KB Output is correct
3 Correct 18 ms 16000 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 16000 KB Output is correct
2 Correct 18 ms 16000 KB Output is correct
3 Correct 18 ms 16000 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 904 ms 16140 KB Output is correct
2 Correct 940 ms 16136 KB Output is correct
3 Correct 928 ms 16240 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16000 KB Output is correct
2 Correct 500 ms 16120 KB Output is correct
3 Correct 609 ms 16232 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 16052 KB Output is correct
2 Correct 77 ms 16044 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15992 KB Output is correct
2 Correct 59 ms 16000 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 15992 KB Output is correct
2 Correct 58 ms 15992 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 16000 KB Output is correct
2 Correct 71 ms 16000 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 16164 KB Output is correct
2 Correct 111 ms 16000 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 16000 KB Output is correct
2 Correct 170 ms 17272 KB Output is correct
3 Correct 400 ms 17272 KB Output is correct