#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
set<vi> gg;
int main()
{
string s1,s2; cin>>s1>>s2;
int l1=s1.size(),l2=s2.size();
for(int i=l1;i>0;i--)
{
vi alpha(26);
int s=0,e=i-1;
for(int j=s;j<=e;j++) alpha[s1[j]-'a']++;
while(e<l1)
{
gg.insert(alpha);
if(++e<l1) alpha[s1[e]-'a']++,alpha[s1[s++]-'a']--;
}
}
for(int i=l2;i>0;i--)
{
vi alpha(26);
int s=0,e=i-1;
for(int j=s;j<=e;j++) alpha[s2[j]-'a']++;
while(e<l2)
{
if(gg.count(alpha)) return !printf("%d",i);
if(++e<l2) alpha[s2[e]-'a']++,alpha[s2[s++]-'a']--;
}
}
return !printf("0");
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
3 ms |
604 KB |
Output is correct |
3 |
Correct |
3 ms |
728 KB |
Output is correct |
4 |
Correct |
6 ms |
1348 KB |
Output is correct |
5 |
Correct |
4 ms |
1348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
79 ms |
13816 KB |
Output is correct |
2 |
Correct |
83 ms |
17260 KB |
Output is correct |
3 |
Correct |
20 ms |
17260 KB |
Output is correct |
4 |
Correct |
15 ms |
17260 KB |
Output is correct |
5 |
Correct |
112 ms |
20096 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
544 ms |
79892 KB |
Output is correct |
2 |
Correct |
513 ms |
82548 KB |
Output is correct |
3 |
Correct |
485 ms |
82548 KB |
Output is correct |
4 |
Correct |
526 ms |
82548 KB |
Output is correct |
5 |
Correct |
482 ms |
82600 KB |
Output is correct |
6 |
Correct |
474 ms |
82600 KB |
Output is correct |
7 |
Correct |
502 ms |
82680 KB |
Output is correct |
8 |
Correct |
504 ms |
82944 KB |
Output is correct |
9 |
Correct |
489 ms |
82944 KB |
Output is correct |
10 |
Correct |
489 ms |
82944 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
245 ms |
82944 KB |
Output is correct |
2 |
Execution timed out |
1072 ms |
172188 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |