# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321011 | tjdgus4384 | 구간 성분 (KOI15_interval) | C++14 | 0 ms | 0 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;
string s1, s2;
vector<int> v(30, 0), t(30, 0);
set<vector<int> > s;
int main(){
cin >> s1 >> s2;
for(int i = s1.size();i > 0;i--){
if(i > s2.size()) continue;
for(int j = 0;j < i;j++){
v[s1[j]-'a']++;
}
s.insert(v);
for(int j = i;j < s1.size();j++){
v[s1[j-i]-'a']--;
v[s1[j]-'a']++;
s.insert(v);
}
for(int j = 0;j < 30;j++) v[j] = 0;
for(int j = 0;j < i;j++){
t[s2[j]-'a']++;
}
if(s.count(t)){
printf("%d", i); return 0;
}
for(int j = i;j < s2.size();j++){
t[s2[j-i]-'a']--;
t[s2[j]-'a']++;
if(s.count(t)){
printf("%d", i); return 0;
}
}
for(int j = 0;j < 30;j++) t[j] = 0;
s,clear();
}
printf("0");
return 0;
}