# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
834689 | mgl_diamond | Necklace (Subtask 4) (BOI19_necklace4) | C++17 | 282 ms | 460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
template<class T> using vec = vector<T>;
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define file "input"
void setIO() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(file".in", "r")) {
freopen(file".in", "r", stdin);
freopen(file".out", "w", stdout);
}
}
const int N = 6006;
int n, m, kmp1[N], kmp2[N];
tuple<int, int, int> ans;
string s, t, t2;
void calc(string s, int *kmp) {
kmp[sz(s)] = 0;
foru(i, 1, sz(s)-1) {
int j = kmp[i-1];
while (j > 0 && s[j] != s[i]) j = kmp[j-1];
if (s[j] == s[i]) j += 1;
kmp[i] = j;
}
}
tuple<int, int, int> solve(bool rev) {
tuple<int, int, int> ret = {0, 0, 0};
foru(i, 0, n) {
string suf = s.substr(i, n-i), pre = s.substr(0, i);
reverse(all(pre));
calc(suf + '#' + t, kmp1); calc(pre + '#' + t2, kmp2);
foru(j, 0, m) ret = max(ret, {
kmp1[n-i+j]+kmp2[i+m-j],
i - kmp2[i+m-j],
j - kmp1[n-i+j]
});
}
if (rev) {
// cout << get<1>(ret) << " " << get<2>(ret) << "\n";
get<1>(ret) = n-get<1>(ret)-1-get<0>(ret)+1;
}
// cout << get<0>(ret) << "\n";
return ret;
}
int main() {
setIO();
cin >> s >> t;
n = sz(s); m = sz(t);
t2 = t;
reverse(all(t2));
ans = solve(0);
// cout << get<0>(ans) << "\n";
reverse(all(s));
ans = max(ans, solve(1));
cout << get<0>(ans) << "\n" << get<1>(ans) << " " << get<2>(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |