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;
map<string, int> mp; // the starting point of that string
int main()
{
string s, t;
cin >> s >> t;
int n = s.size(), m = t.size();
int mx = min(n, m);
for(int ans = mx; ans >= 1; ans--)
{
for(int i = 0; i < n - ans + 1; i++)
{
string v = s.substr(i, ans);
mp[v] = i + 1;
reverse(v.begin(), v.end());
mp[v] = i + 1;
}
for(int i = 0; i < m - ans + 1; i++)
{
string v = t.substr(i, ans);
for(int j = 0; j < ans; j++)
{
if(mp.find(v) != mp.end())
{
cout << ans << endl;
cout << mp[v] << ' ' << i + 1 << endl;
return 0;
}
v = v.substr(1, ans) + v.substr(0, 1);
}
}
mp.clear();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |