#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
const long long mod = 2147483647LL;
string S, T;
vector<pair<long long, int>> vec[3009];
long long power[3009];
void init() {
power[0] = 1LL;
for (int i = 1; i <= 3000; i++) power[i] = (100LL * power[i - 1]) % mod;
}
long long hash_val(string U) {
long long r = 0;
for (int i = 0; i < U.size(); i++) {
r *= 100LL;
r += (long long)(U[i] - 'a' + 1LL);
r %= mod;
}
return r;
}
vector<long long> get_substring(string U) {
vector<long long> a, b, c;
a.push_back(0);
for (int i = 0; i < U.size(); i++) {
a.push_back((100LL * a[a.size() - 1] + (long long)(U[i] - 'a' + 1)) % mod);
}
b.push_back(0);
for (int i = U.size() - 1; i >= 0; i--) {
b.push_back((b[b.size() - 1] + power[U.size() - 1 - i] * (long long)(U[i] - 'a' + 1)) % mod);
}
reverse(b.begin(), b.end());
for (int i = 0; i < U.size(); i++) {
long long s = a[i] + power[i] * b[i];
s %= mod;
c.push_back(s);
}
return c;
}
int main() {
init();
cin >> S >> T;
for (int i = 0; i < S.size(); i++) {
for (int j = i + 1; j <= S.size(); j++) {
string G = S.substr(i, j - i);
vector<long long> V1 = get_substring(G); reverse(G.begin(), G.end());
vector<long long> V2 = get_substring(G);
for (int k = 0; k < V1.size(); k++) vec[j - i].push_back(make_pair(V1[k], i));
for (int k = 0; k < V2.size(); k++) vec[j - i].push_back(make_pair(V2[k], i));
}
}
for (int i = 0; i <= S.size(); i++) sort(vec[i].begin(), vec[i].end());
int maxn = 0; pair<int, int> maxid = make_pair(-1, -1);
for (int i = 0; i < T.size(); i++) {
for (int j = i + 1; j <= T.size(); j++) {
string G = T.substr(i, j - i);
long long v = hash_val(G);
int pos1 = lower_bound(vec[j - i].begin(), vec[j - i].end(), make_pair(v, 0)) - vec[j - i].begin();
if (pos1 < vec[j - i].size() && vec[j - i][pos1].first == v) {
if (maxn < j - i) {
maxn = j - i;
maxid = make_pair(vec[j - i][pos1].second, i);
}
}
}
}
cout << maxn << endl;
cout << maxid.first << " " << maxid.second << endl;
return 0;
}
Compilation message
necklace.cpp: In function 'long long int hash_val(std::__cxx11::string)':
necklace.cpp:21:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < U.size(); i++) {
~~^~~~~~~~~~
necklace.cpp: In function 'std::vector<long long int> get_substring(std::__cxx11::string)':
necklace.cpp:32:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < U.size(); i++) {
~~^~~~~~~~~~
necklace.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < U.size(); i++) {
~~^~~~~~~~~~
necklace.cpp: In function 'int main()':
necklace.cpp:52:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < S.size(); i++) {
~~^~~~~~~~~~
necklace.cpp:53:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = i + 1; j <= S.size(); j++) {
~~^~~~~~~~~~~
necklace.cpp:57:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int k = 0; k < V1.size(); k++) vec[j - i].push_back(make_pair(V1[k], i));
~~^~~~~~~~~~~
necklace.cpp:58:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int k = 0; k < V2.size(); k++) vec[j - i].push_back(make_pair(V2[k], i));
~~^~~~~~~~~~~
necklace.cpp:61:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i <= S.size(); i++) sort(vec[i].begin(), vec[i].end());
~~^~~~~~~~~~~
necklace.cpp:64:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < T.size(); i++) {
~~^~~~~~~~~~
necklace.cpp:65:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j = i + 1; j <= T.size(); j++) {
~~^~~~~~~~~~~
necklace.cpp:70:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (pos1 < vec[j - i].size() && vec[j - i][pos1].first == v) {
~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
52 ms |
7416 KB |
Output is correct |
| 2 |
Correct |
59 ms |
7416 KB |
Output is correct |
| 3 |
Correct |
35 ms |
3832 KB |
Output is correct |
| 4 |
Correct |
62 ms |
7416 KB |
Output is correct |
| 5 |
Correct |
58 ms |
7160 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
52 ms |
7416 KB |
Output is correct |
| 2 |
Correct |
59 ms |
7416 KB |
Output is correct |
| 3 |
Correct |
35 ms |
3832 KB |
Output is correct |
| 4 |
Correct |
62 ms |
7416 KB |
Output is correct |
| 5 |
Correct |
58 ms |
7160 KB |
Output is correct |
| 6 |
Execution timed out |
1603 ms |
356248 KB |
Time limit exceeded |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
52 ms |
7416 KB |
Output is correct |
| 2 |
Correct |
59 ms |
7416 KB |
Output is correct |
| 3 |
Correct |
35 ms |
3832 KB |
Output is correct |
| 4 |
Correct |
62 ms |
7416 KB |
Output is correct |
| 5 |
Correct |
58 ms |
7160 KB |
Output is correct |
| 6 |
Execution timed out |
1603 ms |
356248 KB |
Time limit exceeded |
| 7 |
Halted |
0 ms |
0 KB |
- |
