제출 #253673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
253673		Vimmer	Savez (COCI15_savez)	C++14	0 / 120	866 ms	17016 KiB

savez

#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(998244353)
#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 <ll, int> mp;

ll pw[N];

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] = (ll(31) * pw[i]) % M;

    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;

        ll hsh = 0;

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

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

            hsh += (ll(s[j] - 'A') * pw[j]) % M;

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

        }

        mp[hsh] = val;

        ans = max(ans, val);
    }

    cout << ans << endl;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12