#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
const long long mod = 2147483647LL;
string S, T;
vector<long long> 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++) {
string G = "";
for (int j = i + 1; j <= S.size(); j++) {
G += S[j - 1];
vector<long long> V1 = get_substring(G);
for (int k = 0; k < V1.size(); k++) vec[j - i].push_back((V1[k] << 28) + 1LL * 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++) {
string G = "";
for (int j = i + 1; j <= T.size(); j++) {
G += T[j - 1];
long long v = hash_val(G);
int pos1 = lower_bound(vec[j - i].begin(), vec[j - i].end(), v << 28) - vec[j - i].begin();
if (pos1 < vec[j - i].size() && (vec[j - i][pos1] >> 28) == v) {
if (maxn < j - i) {
maxn = j - i;
maxid = make_pair(vec[j - i][pos1] % (1LL << 28) , i);
}
}
}
}
for (int i = 1; i <= T.size(); i++) {
string G = "";
for (int j = i - 1; j >= 0; j--) {
G += T[j];
long long v = hash_val(G);
int pos1 = lower_bound(vec[i - j].begin(), vec[i - j].end(), v << 28) - vec[i - j].begin();
if (pos1 < vec[i - j].size() && (vec[i - j][pos1] >> 28) == v) {
if (maxn < i - j) {
maxn = i - j;
maxid = make_pair(vec[i - j][pos1] % (1LL << 28) , j);
}
}
}
}
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:54: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((V1[k] << 28) + 1LL * i);
~~^~~~~~~~~~~
necklace.cpp:60: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:63: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] >> 28) == v) {
~~~~~^~~~~~~~~~~~~~~~~~~
necklace.cpp:79:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i <= T.size(); i++) {
~~^~~~~~~~~~~
necklace.cpp:86:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (pos1 < vec[i - j].size() && (vec[i - j][pos1] >> 28) == v) {
~~~~~^~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
2296 KB |
Output is correct |
| 2 |
Correct |
26 ms |
2424 KB |
Output is correct |
| 3 |
Correct |
16 ms |
1272 KB |
Output is correct |
| 4 |
Correct |
26 ms |
2296 KB |
Output is correct |
| 5 |
Correct |
27 ms |
2168 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
2296 KB |
Output is correct |
| 2 |
Correct |
26 ms |
2424 KB |
Output is correct |
| 3 |
Correct |
16 ms |
1272 KB |
Output is correct |
| 4 |
Correct |
26 ms |
2296 KB |
Output is correct |
| 5 |
Correct |
27 ms |
2168 KB |
Output is correct |
| 6 |
Correct |
1130 ms |
94108 KB |
Output is correct |
| 7 |
Correct |
1463 ms |
94232 KB |
Output is correct |
| 8 |
Correct |
1459 ms |
88232 KB |
Output is correct |
| 9 |
Incorrect |
1453 ms |
80676 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
2296 KB |
Output is correct |
| 2 |
Correct |
26 ms |
2424 KB |
Output is correct |
| 3 |
Correct |
16 ms |
1272 KB |
Output is correct |
| 4 |
Correct |
26 ms |
2296 KB |
Output is correct |
| 5 |
Correct |
27 ms |
2168 KB |
Output is correct |
| 6 |
Correct |
1130 ms |
94108 KB |
Output is correct |
| 7 |
Correct |
1463 ms |
94232 KB |
Output is correct |
| 8 |
Correct |
1459 ms |
88232 KB |
Output is correct |
| 9 |
Incorrect |
1453 ms |
80676 KB |
Output isn't correct |
| 10 |
Halted |
0 ms |
0 KB |
- |
