#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
long long s,d[30],f,g,h,j,k,mod,mar=1507;
int i,a,l,n,m;
string x,z;
vector<int> v1[1502],v2[1502];
main(){
//ios::sync_with_stdio(0);
d[0]=1;//cout<<mod;
for(i=1;i<30;i++){
d[i]=(d[i-1]*mar);
}
//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;
v1[a-i].push_back(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;
v2[a-i].push_back(h);
}
}
for(i=0;i<max(n,m);i++){
sort(v1[i].begin(),v1[i].end());
sort(v2[i].begin(),v2[i].end());
j=0;
for(s=0;s<v1[i].size();s++){
while(j<v2[i].size() && v2[i][j]<v1[i][s]) j++;
if(v2[i][j]==v1[i][s]) {l=i+1;break;}
}
}
cout<<l;
}
Compilation message
interval.cpp:8:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main(){
^
interval.cpp: In function 'int main()':
interval.cpp:22:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<x.size();i++) x[i]-='a';
~^~~~~~~~~
interval.cpp:23:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<z.size();i++) {z[i]-='a';}
~^~~~~~~~~
interval.cpp:28:22: warning: array subscript has type 'char' [-Wchar-subscripts]
h+=d[x[a]];
^
interval.cpp:40:22: warning: array subscript has type 'char' [-Wchar-subscripts]
h+=d[z[a]];
^
interval.cpp:50:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(s=0;s<v1[i].size();s++){
~^~~~~~~~~~~~~
interval.cpp:51:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(j<v2[i].size() && v2[i][j]<v1[i][s]) j++;
~^~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
376 KB |
Output is correct |
3 |
Runtime error |
3 ms |
776 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
18 ms |
1824 KB |
Output is correct |
2 |
Runtime error |
17 ms |
3040 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
79 ms |
7372 KB |
Output is correct |
2 |
Correct |
75 ms |
7372 KB |
Output is correct |
3 |
Incorrect |
76 ms |
7420 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
81 ms |
10404 KB |
Output is correct |
2 |
Correct |
181 ms |
15148 KB |
Output is correct |
3 |
Runtime error |
201 ms |
27412 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
4 |
Halted |
0 ms |
0 KB |
- |