oj.uz

Submission #113847

# Submission time Handle Problem Language Result Execution time Memory
113847 2019-05-28T16:12:20 Z Frankenween Savez (COCI15_savez) C++17
108 / 120
 157 ms 65536 KB 
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod1 = (ll)1e9 + 7;
const ll mod2 = (ll)1e9 + 9;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;


using namespace std;


template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
    for (T &cnt : arr) {
        in >> cnt;
    }
    return in;
};


void solve() {
    ll n;
    cin >> n;
    vector<string> arr(n);
    cin >> arr;
    ll LEN = 2000000 + 1;
    vector<ll> p1(LEN);
    p1[0] = 1;
    for (int i = 1; i < LEN; i++) {
        p1[i] = (p1[i - 1] * BASE) % mod1;
    }
    vector<vector<ll>> hash1(n);
    for (int i = 0 ; i < n; i++) {
        hash1[i].pb(0);
        ll h1 = 0;
        for (auto c : arr[i]) {
            h1 = (h1 * BASE + c - 'A' + 1) % mod1;
            hash1[i].pb(h1);
        }
        hash1[i].shrink_to_fit();
    }
    map<ll, ll> dp;
    ll answer = 0;
    for (int i = 0; i < n; i++) {
        ll mx = 0;
        ll len = 1;
        while (len <= arr[i].size()) {
            ll h1 = (hash1[i].back() - hash1[i][arr[i].size() - len] * p1[len]) % mod1;
            if (h1 < 0) {
                h1 += mod1;
            }
            if (h1 == hash1[i][len] and dp.count(h1) != 0) {
                mx = max(mx, dp[h1]);
            }
            len++;
        }
        dp[hash1[i].back()] = mx + 1;
        answer = max(answer, mx + 1);
    }
    cout << answer;
}


int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
#else
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    cout.precision(30);
    ll seed = time(0);
    //cerr << "Seed: " << seed << "\n";
    srand(seed);
    solve();
    return 0;
}

Compilation message

savez.cpp: In function 'void solve()':
savez.cpp:61:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (len <= arr[i].size()) {
                ~~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 16000 KB Output is correct
2 Correct 23 ms 16000 KB Output is correct
3 Correct 24 ms 16120 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16128 KB Output is correct
2 Correct 23 ms 16000 KB Output is correct
3 Correct 25 ms 16760 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 24824 KB Output is correct
2 Correct 49 ms 24928 KB Output is correct
3 Correct 85 ms 25080 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 16632 KB Output is correct
2 Correct 54 ms 24568 KB Output is correct
3 Correct 66 ms 25000 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 25464 KB Output is correct
2 Correct 53 ms 25592 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 26488 KB Output is correct
2 Correct 56 ms 26496 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 28408 KB Output is correct
2 Correct 61 ms 28120 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 30712 KB Output is correct
2 Correct 71 ms 30552 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 42432 KB Output is correct
2 Correct 111 ms 42360 KB Output is correct

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 55036 KB Output is correct
2 Correct 139 ms 54936 KB Output is correct
3 Runtime error 121 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)