| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 57923 |
2018-07-16T14:03:30 Z |
red1108 |
구간 성분 (KOI15_interval) |
C++17 |
|
1000 ms |
2092 KB |
#include <iostream>
#include <unordered_map>
#include <string>
#include <algorithm>
using namespace std;
unordered_map<char,int> prime;
string a, b;
int cnt[27],atop,btop,h[27];
struct DATA{
int value;
int s, e;
}ah[2500000],bh[2500000];
int asum[30][1600],bsum[30][1600];
bool cmp(DATA A, DATA B)
{
return A.value<B.value;
}
void init()
{
h[0]=18461;
h[1]=1237;
h[2]=17401;
h[3]=1259;
h[4]=18181;
h[5]=1327;
h[6]=1493;
h[7]=17903;
h[8]=1039;
h[9]=1499;
h[10]=1051;
h[11]=1453;
h[12]=1283;
h[13]=1123;
h[14]=4007;
h[15]=3697;
h[16]=3343;
h[17]=3931;
h[18]=3889;
h[19]=3917;
h[20]=3527;
h[21]=4057;
h[22]=17713;
h[23]=17021;
h[24]=18367;
h[25]=1423;
}
int main()
{
init();
ios_base::sync_with_stdio(false);
cin.tie(0);
int i, j,l,hashing,k,flag,x,get=0,kc;
cin>>a;
cin>>b;
for(i=0;i<26;i++)
{
for(j=0;j<a.size();j++){asum[i][j]=a[j]-'a'==i?asum[i][j-1]+1:asum[i][j-1];}
}
for(i=0;i<26;i++)
{
for(j=0;j<b.size();j++){bsum[i][j]=b[j]-'a'==i?bsum[i][j-1]+1:bsum[i][j-1];}
}
l=min(a.size(),b.size());
for(i=l;i>=1;i--)
{
hashing=0;
for(j=0;j<i;j++) {hashing+=h[a[j]-'a'];}
for(j=i-1;j<a.size();j++)
{
ah[++atop].value=hashing;
ah[atop].s=j-i+1;
ah[atop].e=j;
hashing+=h[a[j+1]-'a'];
hashing-=h[a[j-i+1]-'a'];
}
hashing=0;
for(j=0;j<i;j++) {hashing+=h[b[j]-'a'];}
for(j=i-1;j<b.size();j++)
{
bh[++btop].value=hashing;
bh[btop].s=j-i+1;
bh[btop].e=j;
hashing+=h[b[j+1]-'a'];
hashing-=h[b[j-i+1]-'a'];
}
sort(ah+1,ah+atop+1,cmp);
sort(bh+1,bh+btop+1,cmp);
k=1;
for(j=1;j<=atop;j++)
{
while(bh[k].value<ah[j].value&&k<b.size()) k++;
if(k>=b.size()) break;
if(bh[k].value>ah[j].value) continue;
kc=k;
while(bh[k].value==ah[j].value&&k<b.size())
{
flag=1;
for(x=0;x<26;x++)
{
if(asum[x][ah[j].e]-asum[x][ah[j].s-1]!=bsum[x][bh[k].e]-bsum[x][bh[k].s-1]){flag=0;break;}
}
if(flag)
{
get=1;
break;
}
k++;
}
if(get)
{
printf("%d\n", i);
return 0;
}
if(ah[j].value==ah[j+1].value) k=kc;
}
}
printf("0");
}
Compilation message
interval.cpp: In function 'int main()':
interval.cpp:57:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<a.size();j++){asum[i][j]=a[j]-'a'==i?asum[i][j-1]+1:asum[i][j-1];}
~^~~~~~~~~
interval.cpp:61:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<b.size();j++){bsum[i][j]=b[j]-'a'==i?bsum[i][j-1]+1:bsum[i][j-1];}
~^~~~~~~~~
interval.cpp:68:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=i-1;j<a.size();j++)
~^~~~~~~~~
interval.cpp:78:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=i-1;j<b.size();j++)
~^~~~~~~~~
interval.cpp:91:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(bh[k].value<ah[j].value&&k<b.size()) k++;
~^~~~~~~~~
interval.cpp:92:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(k>=b.size()) break;
~^~~~~~~~~~
interval.cpp:95:46: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(bh[k].value==ah[j].value&&k<b.size())
~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
504 KB |
Output is correct |
| 2 |
Incorrect |
7 ms |
752 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1086 ms |
1688 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1076 ms |
1848 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1072 ms |
2092 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
