#include<bits/stdc++.h>
using namespace std;
long long a,s,d[30],f,g,h,j,k,l,i,n,m,mod=1000000000000009,mar=1507;
string x,z;
set<long long> q[2002];
main(){
ios::sync_with_stdio(0);
d[0]=1;
for(i=1;i<30;i++){
d[i]=(d[i-1]*mar)%mod;
}
cin>>x>>z;
//cout<<"*"<<x<<" "<<z<<"*";
for(i=0;i<x.size();i++){
h=0;
for(a=i;a<x.size();a++){
h=(h+d[x[a]-'a']);
if(h>mod) h-=mod;
q[a-i].insert(h);
}
}
for(i=0;i<z.size();i++){
h=0;
for(a=i;a<z.size();a++){
h=(h+d[z[a]-'a']);
if(h>mod) h-=mod;
if(q[a-i].find(h)!=q[a-i].end()) l=max(l,a-i+1);
}
}
cout<<l;
}
Compilation message
interval.cpp:6:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
interval.cpp: In function 'int main()':
interval.cpp:14:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<x.size();i++){
~^~~~~~~~~
interval.cpp:16:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(a=i;a<x.size();a++){
~^~~~~~~~~
interval.cpp:22:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<z.size();i++){
~^~~~~~~~~
interval.cpp:24:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(a=i;a<z.size();a++){
~^~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
612 KB |
Output is correct |
3 |
Correct |
3 ms |
612 KB |
Output is correct |
4 |
Correct |
4 ms |
796 KB |
Output is correct |
5 |
Correct |
4 ms |
796 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
73 ms |
4248 KB |
Output is correct |
2 |
Correct |
63 ms |
5196 KB |
Output is correct |
3 |
Correct |
9 ms |
5196 KB |
Output is correct |
4 |
Correct |
3 ms |
5196 KB |
Output is correct |
5 |
Correct |
89 ms |
5996 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
618 ms |
22252 KB |
Output is correct |
2 |
Correct |
693 ms |
23116 KB |
Output is correct |
3 |
Correct |
794 ms |
23116 KB |
Output is correct |
4 |
Correct |
685 ms |
23116 KB |
Output is correct |
5 |
Correct |
702 ms |
23148 KB |
Output is correct |
6 |
Correct |
611 ms |
23148 KB |
Output is correct |
7 |
Correct |
771 ms |
23148 KB |
Output is correct |
8 |
Correct |
706 ms |
23148 KB |
Output is correct |
9 |
Correct |
740 ms |
23148 KB |
Output is correct |
10 |
Correct |
691 ms |
23148 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
233 ms |
23148 KB |
Output is correct |
2 |
Execution timed out |
1088 ms |
47404 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |