oj.uz

Submission #542522

# Submission time Handle Problem Language Result Execution time Memory
542522 2022-03-26T20:50:17 Z Olympia Savez (COCI15_savez) C++17
108 / 120
 124 ms 65536 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <queue>
#include <limits.h>
using namespace std;

int64_t binPow (int64_t x, int64_t y, int64_t MOD) {
    x %= MOD;
    int64_t res = x;
    int64_t ans = 1;
    while (y > 0) {
        if (y & 1) {
            ans *= res, ans %= MOD;
        }
        res *= res, res %= MOD;
        y /= 2;
    }
    return ans;
}
int64_t inv (int64_t x, int64_t MOD) {
    return binPow(x, MOD - 2, MOD);
}
vector<int64_t> powr = {1};
vector<int64_t> ipowr = {1};
struct Hasher {
    void resz (int mod, int base, string str) {
        int n = str.size();
        this->sz = n;
        this->MOD = mod, this->BASE = base;
        this->pref.assign(n + 1, 0);
        for (int i = 1; i <= n; i++) {
            pref[i] = (pref[i - 1] + (powr[n - i] * (str[i - 1] - 'A' + 1)) % MOD) % MOD;
            pref[i] %= MOD;
        }
    }
    int sz;
    int MOD;
    int BASE;
    vector<int64_t> pref;
    int64_t query (int l, int r) {
        return (ipowr[sz - r - 1] * (pref[r + 1] - pref[l] + MOD) % MOD) % MOD;
    }
};
vector<int> dp;
vector<vector<int>> adj;
int myMax = 0;
void rec (int curNode) {
    if (dp[curNode] != 0) {
        return;
    }
    dp[curNode] = 0;
    for (int i: adj[curNode]) {
        rec(i);
        dp[curNode] = max(dp[curNode], dp[i]);
    }
    dp[curNode] ++;
    myMax = max(myMax, dp[curNode]);
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    while (powr.size() != 1e6 + 5) {
        powr.push_back(powr.back() * 31);
        powr.back() %= (int)1e9 + 9;
    }
    ipowr.resize(powr.size());
    ipowr[0] = 1; ipowr[1] = inv(powr[1], 1e9 + 9);
    for (int i = 2; i < powr.size(); i++) {
        ipowr[i] = (ipowr[i - 1] * ipowr[1]) % ((int)1e9 + 9);
    }
    int N;
    cin >> N;
    vector<string> vec(N);
    for (int i = 0; i < N; i++) {
        cin >> vec[i];
    }
    map<int64_t,int> myMap;
    adj.resize(N);
    dp.assign(N, 0);
    for (int i = 0; i < N; i++) {
        Hasher h1; h1.resz(1e9 + 9, 31, vec[i]);
        for (int l = 1; l <= vec[i].size(); l++) {
            if (h1.query(0, l - 1) == h1.query(vec[i].size() - l, vec[i].size() - 1)) {
                if (myMap.count(h1.query(0, l - 1))) {
                    adj[i].push_back(myMap[h1.query(0, l - 1)]);
                    //cout << i << " " << myMap[h1.query(0, l - 1)] << '\n';
                }
            }
        }
        myMap[h1.query(0, vec[i].size() - 1)] = i;
    }
    for (int i = 0; i < N; i++) {
        rec(i);
    }
    cout << myMax;


}

Compilation message

savez.cpp: In function 'int main()':
savez.cpp:76:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for (int i = 2; i < powr.size(); i++) {
      |                     ~~^~~~~~~~~~~~~
savez.cpp:90:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |         for (int l = 1; l <= vec[i].size(); l++) {
      |                         ~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 16056 KB Output is correct
2 Correct 23 ms 16068 KB Output is correct
3 Correct 24 ms 16068 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 16068 KB Output is correct
2 Correct 25 ms 16056 KB Output is correct
3 Correct 27 ms 16128 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 17092 KB Output is correct
2 Correct 55 ms 17104 KB Output is correct
3 Correct 78 ms 17396 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 16144 KB Output is correct
2 Correct 58 ms 17372 KB Output is correct
3 Correct 67 ms 17352 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 21360 KB Output is correct
2 Correct 62 ms 21276 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 22852 KB Output is correct
2 Correct 63 ms 22772 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 24724 KB Output is correct
2 Correct 68 ms 24780 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 37544 KB Output is correct
2 Correct 90 ms 37588 KB Output is correct

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 51960 KB Output is correct
2 Correct 117 ms 51884 KB Output is correct
3 Runtime error 94 ms 65536 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -