oj.uz

답안 #113845

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
113845 2019-05-28T16:08:49 Z Frankenween Savez (COCI15_savez) C++17
96 / 120
 137 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), p2(LEN);
    p1[0] = 1;
    p2[0] = 1;
    for (int i = 1; i < LEN; i++) {
        p1[i] = (p1[i - 1] * BASE) % mod1;
        p2[i] = (p2[i - 1] * BASE) % mod2;

    }
    vector<vector<ll>> hash1(n), hash2(n);
    for (int i = 0 ; i < n; i++) {
        hash1[i].pb(0);
        hash2[i].pb(0);
        ll h1 = 0, h2 = 0;
        for (auto c : arr[i]) {
            h1 = (h1 * BASE + c - 'A' + 1) % mod1;
            h2 = (h2 * BASE + c - 'A' + 1) % mod2;
            hash1[i].pb(h1);
            hash2[i].pb(h2);
        }
    }
    map<pair<ll, 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;
            ll h2 = (hash2[i].back() - hash2[i][arr[i].size() - len] * p2[len]) % mod2;
            if (h1 < 0) {
                h1 += mod1;
            }
            if (h2 < 0) {
                h2 += mod2;
            }
            if (h1 == hash1[i][len] and h2 == hash2[i][len] and dp.count({h1, h2}) != 0) {
                mx = max(mx, dp[{h1, h2}]);
            }
            len++;
        }
        dp[{hash1[i].back(), hash2[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:66:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (len <= arr[i].size()) {
                ~~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 31744 KB Output is correct
2 Correct 36 ms 31744 KB Output is correct
3 Correct 37 ms 31744 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 31744 KB Output is correct
2 Correct 35 ms 31872 KB Output is correct
3 Correct 37 ms 33144 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 48888 KB Output is correct
2 Correct 72 ms 48776 KB Output is correct
3 Correct 105 ms 51324 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 33272 KB Output is correct
2 Correct 79 ms 50956 KB Output is correct
3 Correct 89 ms 52344 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 56056 KB Output is correct
2 Correct 86 ms 56568 KB Output is correct

Subtask #6
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 57364 KB Output is correct
2 Correct 94 ms 57156 KB Output is correct

Subtask #7
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 59556 KB Output is correct
2 Correct 102 ms 59352 KB Output is correct

Subtask #8
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 62928 KB Output is correct
2 Correct 122 ms 63104 KB Output is correct

Subtask #9
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 114 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 104 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -