# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
47505 | 2018-05-04T06:46:55 Z | Waschbar | 회문 (APIO14_palindrome) | C++17 | 1000 ms | 3968 KB |
///©Waschbar #include <bits/stdc++.h> #define tmm first #define uu second.first #define vv second.second using namespace std; const int MAXN = 1e5; const int LOG = 20; const int INF = 1e9; const int MOD = 1e9+7; int ans; string s; vector < int > pfunc(string str) { vector < int > p(str.size(),0); int j = 0; for(int i = 1; i < str.size(); i++) { while( j > 0 && str[j] != str[i]) j = p[j-1]; if(str[i] == str[j]) j++; p[i] = j; } return p; } void check(string t) { vector < int > p; string tt = t + "#" + s; p = pfunc(tt); int cnt = 0; for(int i = 0; i < p.size(); i++) if(p[i] == t.size()) cnt++; //cout << t << " " << cnt << endl; ans = max(ans,(int)(t.size()*cnt)); } int main() { //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); ans = 0; cin >> s; string t; for(int i = 0; i < s.size(); i++) { t = ""; t = s[i]; int j = 1; while(i-j >= 0 && i+j < s.size() && s[i-j]==s[i+j]) { check(t); t = s[i-j] + t + s[i+j]; j++; } check(t); } for(int i = 0; i < s.size()-1; i++) { t = ""; t = s[i]; t = t + s[i+1]; if(s[i] != s[i+1]) continue; int j = 1; while(i-j >= 0 && i+j+1 < s.size() && s[i-j]==s[i+j+1]) { check(t); t = s[i-j] + t + s[i+j+1]; j++; } check(t); } cout << ans; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 548 KB | Output is correct |
4 | Correct | 2 ms | 548 KB | Output is correct |
5 | Correct | 2 ms | 548 KB | Output is correct |
6 | Correct | 2 ms | 548 KB | Output is correct |
7 | Correct | 2 ms | 552 KB | Output is correct |
8 | Correct | 2 ms | 676 KB | Output is correct |
9 | Correct | 2 ms | 676 KB | Output is correct |
10 | Correct | 2 ms | 776 KB | Output is correct |
11 | Correct | 2 ms | 808 KB | Output is correct |
12 | Correct | 2 ms | 844 KB | Output is correct |
13 | Correct | 2 ms | 844 KB | Output is correct |
14 | Correct | 2 ms | 844 KB | Output is correct |
15 | Correct | 2 ms | 844 KB | Output is correct |
16 | Correct | 2 ms | 844 KB | Output is correct |
17 | Correct | 2 ms | 844 KB | Output is correct |
18 | Correct | 2 ms | 844 KB | Output is correct |
19 | Correct | 4 ms | 844 KB | Output is correct |
20 | Correct | 4 ms | 844 KB | Output is correct |
21 | Correct | 2 ms | 844 KB | Output is correct |
22 | Correct | 2 ms | 844 KB | Output is correct |
23 | Correct | 8 ms | 844 KB | Output is correct |
24 | Correct | 3 ms | 844 KB | Output is correct |
25 | Correct | 7 ms | 844 KB | Output is correct |
26 | Correct | 2 ms | 844 KB | Output is correct |
27 | Correct | 2 ms | 844 KB | Output is correct |
28 | Correct | 4 ms | 844 KB | Output is correct |
29 | Correct | 2 ms | 844 KB | Output is correct |
30 | Correct | 2 ms | 844 KB | Output is correct |
31 | Correct | 2 ms | 848 KB | Output is correct |
32 | Correct | 2 ms | 852 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1077 ms | 1236 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1090 ms | 1236 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1083 ms | 2048 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1085 ms | 3968 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |