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>
#pragma GCC optimize("O3")
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define MAX ((ll)(1e12+100))
#define MX ((ll)(1e6+100))
#define ARRS ((ll)(2e6+100))
#define HS ((ll)(1049))
#define MOD ((ll)(1000000861))
#define EP ((double)(1e-9))
#define LG 21
#define mul(a,b) a=((a)*(b))%MOD
using namespace std;
string s,t;
ll pw[50][2000];
vector<ll> mp[2000];
vector<ll> mp1[2000];
ll ct[50];
int main(){
#ifdef KHOKHO
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
cin>>s>>t;
for(int i=0; i<40; i++)
for(int j=0; j<1600; j++)
pw[i][j]=(((ll)rand()<<48ll)+((ll)rand()<<32ll)+((ll)rand()<<16ll)+(ll)rand());
int pas=0;
for(int i=0; i<s.size(); i++){
ll hs=0;
for(int i=0; i<40; i++)ct[i]=0;
for(int j=i; j<s.size(); j++){
hs^=pw[s[j]-'a'][ct[s[j]-'a']++];
mp[j-i].pb(hs);
// mp[hs]=j-i+1;
}
}
for(int i=0; i<t.size(); i++){
ll hs=0;
for(int i=0; i<40; i++)ct[i]=0;
for(int j=i; j<t.size(); j++){
hs^=pw[t[j]-'a'][ct[t[j]-'a']++];
mp1[j-i].pb(hs);
//if(mp[j-i].find(hs)!=mp[j-i].end())
//pas=max(pas,j-i+1);
}
}
for(int i=1600; i>=0; i--){
sort(mp[i].begin(),mp[i].end());
sort(mp1[i].begin(),mp1[i].end());
ll j=0;
for(int k=0; k<mp[i].size(); k++){
while(j<mp1[i].size()&&mp1[i][j]<mp[i][k])j++;
//cout<<mp[i][k]<<" "<<mp1[i][j]<<endl;
if(j<mp1[i].size()&&mp[i][k]==mp1[i][j])pas=max(pas,i+1);
}
if(pas)break;
}
cout<<pas;
}
Compilation message (stderr)
interval.cpp: In function 'int main()':
interval.cpp:35:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<s.size(); i++){
~^~~~~~~~~
interval.cpp:38:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=i; j<s.size(); j++){
~^~~~~~~~~
interval.cpp:45:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<t.size(); i++){
~^~~~~~~~~
interval.cpp:48:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=i; j<t.size(); j++){
~^~~~~~~~~
interval.cpp:59:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int k=0; k<mp[i].size(); k++){
~^~~~~~~~~~~~~
interval.cpp:60:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(j<mp1[i].size()&&mp1[i][j]<mp[i][k])j++;
~^~~~~~~~~~~~~~
interval.cpp:62:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(j<mp1[i].size()&&mp[i][k]==mp1[i][j])pas=max(pas,i+1);
~^~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |