# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
274832 | 2020-08-19T16:27:48 Z | sean9892 | 구간 성분 (KOI15_interval) | C++14 | 1000 ms | 63784 KB |
#pragma GCC optimize ("O3") #pragma GCC optimize ("Ofast") #pragma GCC optimize ("unroll-loops") #include<bits/stdc++.h> using namespace std; using ll=unsigned long long; using pii=pair<ll,ll>; ll ga[1510]; ll ha[1510]; ll gb[1510]; ll hb[1510]; set<pii> s; ll p7[30]; ll p5[30]; const ll mod=9223372036854775783ll; int res=0; int main(void){ ios::sync_with_stdio(0);cin.tie(0); { ll a=1,b=1; for(int i=0;i<26;i++){ p7[i]=a; p5[i]=b; a*=7; b*=5; a%=mod; b%=mod; } } string a,b; cin>>a>>b; ga[0]=gb[0]=ha[0]=hb[0]=0; ga[1]=p7['z'-a[0]]; ha[1]=p5[a[0]-'a']; for(int i=1;i<a.size();i++){ ga[i+1]=ga[i]+p7['z'-a[i]]; if(ga[i+1]>=mod)ga[i+1]%=mod; ha[i+1]=ha[i]+p5[a[i]-'a']; if(ha[i+1]>=mod)ha[i+1]%=mod; } gb[1]=p7['z'-b[0]]; hb[1]=p5[b[0]-'a']; for(int i=1;i<b.size();i++){ gb[i+1]=gb[i]+p7['z'-b[i]]; if(gb[i+1]>=mod)gb[i+1]%=mod; hb[i+1]=hb[i]+p5[b[i]-'a']; if(hb[i+1]>=mod)hb[i+1]%=mod; } for(int i=1;i<a.size();i++){ for(int j=0;j<i;j++){ ll x=ga[i]-ga[j]; ll y=ha[i]-ha[j]; s.insert(pii(x,y)); } } for(int i=1;i<b.size();i++){ for(int j=0;j+res<i;j++){ ll x=gb[i]-gb[j]; ll y=hb[i]-hb[j]; if(s.find(pii(x,y))!=s.end()){ res=max(res,i-j); break; } } } printf("%d",res); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 384 KB | Output is correct |
2 | Correct | 1 ms | 384 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 5120 KB | Output is correct |
2 | Incorrect | 66 ms | 6792 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 443 ms | 29304 KB | Output is correct |
2 | Correct | 318 ms | 30328 KB | Output is correct |
3 | Correct | 349 ms | 29944 KB | Output is correct |
4 | Correct | 456 ms | 29560 KB | Output is correct |
5 | Correct | 324 ms | 30200 KB | Output is correct |
6 | Correct | 445 ms | 29688 KB | Output is correct |
7 | Correct | 327 ms | 30160 KB | Output is correct |
8 | Correct | 331 ms | 30328 KB | Output is correct |
9 | Correct | 299 ms | 30200 KB | Output is correct |
10 | Correct | 344 ms | 30200 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 378 ms | 16504 KB | Output is correct |
2 | Execution timed out | 1092 ms | 63784 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |