algo

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub kuhaku-space/algo

:heavy_check_mark: test/yosupo/string/zalgorithm.2.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/zalgorithm
#include <iostream>
#include <string>
#include <unordered_set>
#include <vector>
#include "string/rolling_hash.hpp"

int main(void) {
    std::string s;
    std::cin >> s;

    rolling_hash rh(s);
    int n = s.size();
    std::vector<int> ans = {n};
    std::unordered_set<uint64_t> st;
    for (int i = 1; i <= n; ++i) st.emplace(rh.get(0, i));
    for (int i = 1; i < n; ++i) {
        int l = 0, r = n - i + 1;
        while (r - l > 1) {
            int m = (l + r) / 2;
            if (st.count(rh.get(i, i + m))) l = m;
            else r = m;
        }
        ans.emplace_back(l);
    }
    for (int i = 0; i < (int)ans.size(); ++i)
        std::cout << ans[i] << (i == (int)ans.size() - 1 ? '\n' : ' ');

    return 0;
}
Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 291, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 242, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 479, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 286, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: string/rolling_hash.hpp: line -1: no such header

Test cases

Env Name Status Elapsed Memory
g++ all_same_00 :heavy_check_mark: AC 621 ms 36 MB
g++ all_same_01 :heavy_check_mark: AC 589 ms 37 MB
g++ all_same_02 :heavy_check_mark: AC 576 ms 37 MB
g++ all_same_03 :heavy_check_mark: AC 570 ms 37 MB
g++ all_same_04 :heavy_check_mark: AC 593 ms 36 MB
g++ binary_carry_00 :heavy_check_mark: AC 474 ms 37 MB
g++ binary_carry_01 :heavy_check_mark: AC 438 ms 36 MB
g++ example_00 :heavy_check_mark: AC 2 ms 4 MB
g++ example_01 :heavy_check_mark: AC 2 ms 3 MB
g++ example_02 :heavy_check_mark: AC 2 ms 4 MB
g++ example_03 :heavy_check_mark: AC 2 ms 4 MB
g++ fib_str_00 :heavy_check_mark: AC 485 ms 37 MB
g++ fib_str_01 :heavy_check_mark: AC 224 ms 31 MB
g++ fib_str_02 :heavy_check_mark: AC 247 ms 27 MB
g++ fib_str_03 :heavy_check_mark: AC 232 ms 26 MB
g++ fib_str_04 :heavy_check_mark: AC 496 ms 36 MB
g++ hack606_00 :heavy_check_mark: AC 2 ms 4 MB
g++ max_random_00 :heavy_check_mark: AC 544 ms 37 MB
g++ max_random_01 :heavy_check_mark: AC 435 ms 37 MB
g++ random_00 :heavy_check_mark: AC 304 ms 32 MB
g++ random_01 :heavy_check_mark: AC 386 ms 35 MB
g++ random_02 :heavy_check_mark: AC 32 ms 7 MB
g++ random_03 :heavy_check_mark: AC 347 ms 33 MB
g++ random_04 :heavy_check_mark: AC 209 ms 24 MB
g++ random_05 :heavy_check_mark: AC 257 ms 26 MB
g++ random_06 :heavy_check_mark: AC 440 ms 35 MB
g++ random_07 :heavy_check_mark: AC 58 ms 10 MB
g++ random_08 :heavy_check_mark: AC 203 ms 24 MB
g++ random_09 :heavy_check_mark: AC 66 ms 11 MB
Back to top page