# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48817 | leehosu01 | 구간 성분 (KOI15_interval) | C++17 | 744 ms | 1028 KiB |
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;
typedef long long ll;
string A,B;
int im[30];
pair<ll,ll> H()
{
ll H1=0,H2=0,p1=10067,p2=100000007,n1=65,n2=117;
for(int i=0;i<30;i++)
H1=(H1*n1+im[i])%p1,H2=(H2*n2+im[i])%p2;
return {H1,H2};
}
bool Sh(ll len)
{
for(int i=0;i<30;i++)im[i]=0;
set<pair<ll,ll> > inA;
int i;
for(i=0;i<len;i++)im[A[i]-'a']++;
inA.insert(H());
for(i=len;i<A.size();i++)
{
im[A[i]-'a']++;
im[A[i-len]-'a']--;
inA.insert(H());
}
for(int i=0;i<30;i++)im[i]=0;
for(i=0;i<len;i++)im[B[i]-'a']++;
if(inA.find(H())!=inA.end())return 1;
for(i=len;i<B.size();i++)
{
im[B[i]-'a']++;
im[B[i-len]-'a']--;
if(inA.find(H())!=inA.end())return 1;
}
return 0;
}
int main()
{
cin>>A>>B;
int l=1,m,lm=0,r=min((int)A.size(),(int)B.size());
for(m=r;m&&!Sh(m);m--);
/* while(l<r)
{
m=l+r>>1;
if(Sh(m))lm=m,l=m+1;
else r=m-1;
}*/
cout<<m;
}
Compilation message (stderr)
# | 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... |