oj.uz

Submission #918034

# Submission time Handle Problem Language Result Execution time Memory
918034 2024-01-29T12:38:15 Z ezzzay Palindromes (APIO14_palindrome) C++14
0 / 100
 1000 ms 1000 KB 
#include<bits/stdc++.h>
using namespace std;
bool fun(string s){
    int n=s.size();
    for(int i=0;i<n;i++){
        if(s[i]!=s[n-i-1])return 0;
    }
    return 1;
}
signed main(){
    string s;
    cin>>s;
    int n=s.size();
    int ans=0;
    for(int i=0;i<n;i++){
        for(int j=i;j<n;j++){
            string p= s.substr(i,j-i+1);
            int z=0;
            if(fun(p)){
                z+=j-i+1;
                for(int l=j+1;l<n;l++){
                    if(s.substr(l,j-i+1)==p){
                        z+=j-i+1;
                    }
                }
            }
            ans=max(ans,z);
        }
    }
    cout<<ans;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 596 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 600 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1014 ms 1000 KB Time limit exceeded
2 Halted 0 ms 0 KB -