提出 #70627674

---

ソースコード 拡げる

#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 0
#endif
using namespace std;
using ll = long long;
using db = double;
const ll N = 1e6 + 5;
const ll md = 998244353;
const ll MOD = 1e9 + 7;
const ll INF = 0x3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db eps = 1e-6;
const db E = 2.718281828459045;
typedef pair<ll, ll> PLL;
#define fi first
#define se second
ll kmp(string text, string pattern)
{
    ll n = text.size(), m = pattern.size();
    if (m == 0)
        return 0;
    vector<ll> nxt(m);
    for (ll i = 1, j = 0; i < m; i++)
    {
        while (j > 0 && pattern[i] != pattern[j])
            j = nxt[j - 1];
        if (pattern[i] == pattern[j])
            j++;
        nxt[i] = j;
    }
    for (ll i = 0, j = 0; i < n; i++)
    {
        while (j > 0 && text[i] != pattern[j])
            j = nxt[j - 1];
        if (text[i] == pattern[j])
            j++;
        if (j == m)
            return i - m + 1;
    }
    return -1;
}
void solve()
{
    string a, b;
    cin >> a >> b;
    a=a+a;
        cout << kmp(a, b) << '\n';
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    cin>>T;
    while (T--)
    {
        solve();
    }
}

提出情報

ジャッジ結果