test/cpv/library-checker-string/suffixarray.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/suffixarray | ||
| 2 | #include "../../../src/str/suffix_array/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 50 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 50 times.
✗ Branch 3 not taken.
|
50 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | 50 | strn s; | |
| 8 |
1/2✓ Branch 1 taken 50 times.
✗ Branch 2 not taken.
|
50 | std::cin >> s; |
| 9 | 50 | u32 n = (u32)s.size(); | |
| 10 |
1/2✓ Branch 1 taken 50 times.
✗ Branch 2 not taken.
|
50 | s = " " + s; |
| 11 | 50 | suffix_array sa(s); | |
| 12 |
4/6✓ Branch 2 taken 13584543 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 13584543 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 13584543 times.
✓ Branch 8 taken 50 times.
|
13584593 | flt_ (u32, i, 1, n + 1) std::cout << sa.sa[i] - 1 << " \n"[i == n]; |
| 13 | 50 | return 0; | |
| 14 | 50 | } | |
| 15 |