# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71194 | vanogam | 구간 성분 (KOI15_interval) | C++14 | 1070 ms | 47500 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>
#pragma GCC optimize ("Ofast")
using namespace std;
long long s,d[30],f,g,h,j,k,mod=1ll<<40ll-1,mar=1507;
int i,a,l,n,m;
string x,z;
unordered_set<long long> q[1502];
main(){
//ios::sync_with_stdio(0);
d[0]=1;//cout<<mod;
for(i=1;i<30;i++){
d[i]=(d[i-1]*mar)%mod;
}
//srand(time(0));
char c;
while((c=getchar())!='\n') x+=c;
while((c=getchar())!='\n') z+=c;
//if(x.size()>z.size()) swap(x,z);
//cout<<"*"<<x<<" "<<z<<"*";
n=x.size();
for(i=0;i<x.size();i++) x[i]-='a';
for(i=0;i<z.size();i++) {z[i]-='a';}
//random_shuffle(f,f+z.size());
for(i=0;i<n;i++){
h=0;
for(a=i;a<n;a++){
h+=d[x[a]];
h^=mod;
q[a-i].insert(h);
}
}
m=z.size();
for(i=0;i<m;i++){
h=0;//cout<<i<<" ";
//f=min(z.size(),i+x.size());
for(a=i;a<m;a++){
//if(a>i+x.size()) break;
h+=d[z[a]];
h^=mod;
if(l<a-i+1 && q[a-i].find(h)!=q[a-i].end()) l=a-i+1;
}
}
cout<<l;
}
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... |