# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113318 | 2019-05-24T22:34:36 Z | Runtime_error_ | Palindromes (APIO14_palindrome) | C++14 | 299 ms | 131072 KB |
#include <bits/stdc++.h> using namespace std; const int inf=1e3+9; int n,ans; string s; bool pal[inf][inf]; map<string,int> mp; int main(){ cin>>s; n=s.size(); s=" "+s; for(int i=1;i<=n;i++) pal[i][i]=1,pal[i][i+1]=(i<n && s[i]==s[i+1]); for(int len=3;len<=n;len++) for(int i=1;i<=n-len+1;i++) pal[i][i+len-1]=(pal[i+1][i+len-2]& s[i]==s[i+len-1]); for(int i=1;i<=n;i++){ string temp=""; for(int j=i;j<=n;j++) temp+=s[j],mp[temp]++; } for(int i=1;i<=n;i++){ string temp=""; for(int j=i;j<=n;j++){ temp+=s[j]; if(pal[i][j]) ans=max(ans,mp[temp]*(j-i+1)); } } cout<<ans<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 2 ms | 384 KB | Output is correct |
4 | Correct | 2 ms | 384 KB | Output is correct |
5 | Correct | 2 ms | 384 KB | Output is correct |
6 | Correct | 2 ms | 384 KB | Output is correct |
7 | Correct | 3 ms | 384 KB | Output is correct |
8 | Correct | 2 ms | 256 KB | Output is correct |
9 | Correct | 2 ms | 384 KB | Output is correct |
10 | Correct | 2 ms | 384 KB | Output is correct |
11 | Correct | 2 ms | 384 KB | Output is correct |
12 | Correct | 2 ms | 384 KB | Output is correct |
13 | Correct | 2 ms | 384 KB | Output is correct |
14 | Correct | 2 ms | 384 KB | Output is correct |
15 | Correct | 2 ms | 384 KB | Output is correct |
16 | Correct | 2 ms | 384 KB | Output is correct |
17 | Correct | 2 ms | 384 KB | Output is correct |
18 | Correct | 2 ms | 384 KB | Output is correct |
19 | Correct | 2 ms | 384 KB | Output is correct |
20 | Correct | 2 ms | 384 KB | Output is correct |
21 | Correct | 4 ms | 896 KB | Output is correct |
22 | Correct | 5 ms | 896 KB | Output is correct |
23 | Correct | 3 ms | 512 KB | Output is correct |
24 | Correct | 4 ms | 896 KB | Output is correct |
25 | Correct | 3 ms | 512 KB | Output is correct |
26 | Correct | 5 ms | 896 KB | Output is correct |
27 | Correct | 5 ms | 896 KB | Output is correct |
28 | Correct | 5 ms | 868 KB | Output is correct |
29 | Correct | 5 ms | 1024 KB | Output is correct |
30 | Correct | 5 ms | 1024 KB | Output is correct |
31 | Correct | 5 ms | 1024 KB | Output is correct |
32 | Correct | 4 ms | 896 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 239 ms | 2432 KB | Output is correct |
2 | Runtime error | 299 ms | 131072 KB | Execution killed with signal 9 (could be triggered by violating memory limits) |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 2432 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 7 ms | 2812 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 13 ms | 3360 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |