DMOJ · bf4

String Finding

This C++ solution uses z-function for DMOJ bf4 String Finding. Read the reasoning, inspect the code, or try your own test case below.

bf4StringsZ-functionC++34 lines
Solution203of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Z-function

String Finding matches first pattern occurrence, and the Z-function implementation produces the required index.

Strings

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

String_Finding.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 1e18; //❄️
    int main() {
        // z algorithm 
        ios::sync_with_stdio(0); cin.tie(0);
        string s, a; cin >> s >> a;
        string t = a + "#" + s;
        vector<int> z(t.size());
        int l = 0, r = 0;
        for (int i = 1; i < t.size(); i++) {
            if (i <= r) {
                z[i] = min(r - i + 1, z[i - l]);
            }
            while (i + z[i] < t.size() && t[z[i]] == t[i + z[i]]) {
                z[i]++;
            }
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        for (int i = a.size() + 1; i < t.size(); i++) {
            if (z[i] >= a.size()) {
                cout << i - a.size() - 1 << '\n';
                return 0;
            }
        }
        cout << -1 << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.