# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
450440 | nickmet2004 | 구간 성분 (KOI15_interval) | C++11 | 70 ms | 24960 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>
#define f first
#define s second
#define int long long
using namespace std;
const int N = 2005;
int A = 987654323;
int B = 1e9 + 9;
string s , t;
int pw1[27];
vector<int> a[N] , b[N];
main (){
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> s >> t;
int n = s.size() , m = t.size();
pw1[0] =1;
for(int i = 1; i < 26; ++i) pw1[i] = pw1[i - 1] * A*(i + 1) % B;
for(int i = 0; i < n; ++i){
int x= 0;
for(int j = i; j < n; ++j){
x += pw1[s[j] - 'a'];
if(x>=B)x-=B;
a[j - i + 1].emplace_back(x);
}
}
for(int i = 0; i < m; ++i){
int x= 0;
for(int j = i; j < m; ++j){
x += pw1[t[j] - 'a'];
if(x>=B)x-=B;
b[j - i + 1].emplace_back(x);
}
}
for(int i = min(n , m); ~i; --i){
sort(a[i].begin() , a[i].end());
sort(b[i].begin() , b[i].end());
int k = 0;
for(int j= 0; j <a[i].size(); ++j){
while(a[i][j] > b[i][k] && k < b[i].size())++k;
if(a[i][j] == b[i][k]){cout << i << endl; return 0;}
}
}cout << 0;
}
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... |