# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71195 | 2018-08-24T08:06:55 Z | vanogam | 구간 성분 (KOI15_interval) | C++14 | 1000 ms | 47332 KB |
#include<bits/stdc++.h> #pragma GCC optimize ("Ofast") using namespace std; long long s,d[30],f,g,h,j,k,mod=1ll<<55ll-1,mar=1507; int i,a,l,n,m; string x,z; unordered_set<long long> q[1502]; main(){ //ios::sync_with_stdio(0); d[0]=1;//cout<<mod; for(i=1;i<30;i++){ d[i]=(d[i-1]*mar)%mod; } //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; q[a-i].insert(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; if(l<a-i+1 && q[a-i].find(h)!=q[a-i].end()) l=a-i+1; } } cout<<l; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 492 KB | Output is correct |
3 | Correct | 3 ms | 556 KB | Output is correct |
4 | Correct | 3 ms | 740 KB | Output is correct |
5 | Incorrect | 3 ms | 816 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 4016 KB | Output is correct |
2 | Incorrect | 56 ms | 5560 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 397 ms | 22040 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 102 ms | 22040 KB | Output is correct |
2 | Execution timed out | 1088 ms | 47332 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |