# pragma GCC optimize("Ofast,no-stack-protector")
# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
/*
# include <ext/pb_ds/tree_policy.hpp>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/rope>
*/
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
# define int ll
using namespace std;
/*
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
Tree<int>tr;
*/
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# define LOCAL
# define sim template < class c
# define ris return * this
# define dor > debug & operator <<
# define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int gcd(int a, int b)
{
if(b) return gcd(b,a%b);
return a;
}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// 5:15 - necklace
int p[405],inv[405];
unordered_map<int,int>f[405];
const int P = 37;
const int mod = 1e9 + 9;
string a,b;
int my_pow(int x,int p){
int ans = 1;
for(int i = 0;(1 << i) <= p;i++){
if(p & (1 << i)){
ans *= x;
ans %= mod;
}
x *= x;
x %= mod;
}
return ans;
}
int check(int l,int r){
string s = "";
if(r >= sz(a)) return 0;
for(int i = l;i <= r;i++){
s += a[i];
}
int x = 0;
for(int i = 0;i < sz(s);i++){
x += (s[i] - 'a') * p[i];
x %= mod;
}
for(int i = 0;i < sz(s);i++){
int y = f[r - l + 1][x];
if(y) return y;
x -= (s[i] - 'a');
x %= mod;
if(x < 0) x += mod;
x *= inv[1];
x %= mod;
x += (s[i] - 'a') * p[sz(s) - 1];
x %= mod;
}
return 0;
}
int32_t main(){_
//freopen("input","r",stdin);
cin >> a >> b;
int n = max(sz(a),sz(b));
p[0] = 1;
for(int i = 1;i <= n;i++){
p[i] = (p[i - 1] * P) % mod;
inv[i] = my_pow(p[i],mod - 2);
}
for(int i = 0;i < sz(b);i++){
int x = 0;
for(int j = i;j < sz(b);j++){
x += (b[j] - 'a') * p[j - i];
x %= mod;
f[j - i + 1][x] = i + 1;
}
}
reverse(b.begin(),b.end());
for(int i = 0;i < sz(b);i++){
int x = 0;
for(int j = i;j < sz(b);j++){
x += (b[j] - 'a') * p[j - i];
x %= mod;
f[j - i + 1][x] = sz(b) - j;
}
}
pair<int,pair<int,int>>mxlen = mp(0,mp(0,0));
for(int i = 0;i < sz(a);i++){
for(int j = 1;j <= sz(a);j++){
int x = check(i,i + j - 1);
if(x){
mxlen = max(mxlen,mp(j,mp(i,x)));
}
}
}
cout << mxlen.first << '\n' << mxlen.second.first << ' ' << mxlen.second.second - 1;
return 0;
}
Compilation message
necklace.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
# pragma GCC optimization ("unroll-loops")
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
3960 KB |
Output is correct |
| 2 |
Correct |
21 ms |
3320 KB |
Output is correct |
| 3 |
Correct |
12 ms |
1656 KB |
Output is correct |
| 4 |
Correct |
31 ms |
4728 KB |
Output is correct |
| 5 |
Correct |
51 ms |
7292 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
3960 KB |
Output is correct |
| 2 |
Correct |
21 ms |
3320 KB |
Output is correct |
| 3 |
Correct |
12 ms |
1656 KB |
Output is correct |
| 4 |
Correct |
31 ms |
4728 KB |
Output is correct |
| 5 |
Correct |
51 ms |
7292 KB |
Output is correct |
| 6 |
Correct |
1025 ms |
92656 KB |
Output is correct |
| 7 |
Execution timed out |
1582 ms |
151608 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
3960 KB |
Output is correct |
| 2 |
Correct |
21 ms |
3320 KB |
Output is correct |
| 3 |
Correct |
12 ms |
1656 KB |
Output is correct |
| 4 |
Correct |
31 ms |
4728 KB |
Output is correct |
| 5 |
Correct |
51 ms |
7292 KB |
Output is correct |
| 6 |
Correct |
1025 ms |
92656 KB |
Output is correct |
| 7 |
Execution timed out |
1582 ms |
151608 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
