oj.uz

Submission #897623

# Submission time Handle Problem Language Result Execution time Memory
897623 2024-01-03T13:45:32 Z AndrijaM Palindromes (APIO14_palindrome) C++14
8 / 100
 1000 ms 2092 KB 
#include <bits/stdc++.h>

using namespace std;

const long long maxn=1e4+10;
const long long mod=1e9+7;

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    string s;
    long long ans=0LL;
    cin>>s;
    int n=s.size();
    map<deque<char>,int>m;
    for(int i=0;i<n;i++)
    {
        deque<char>Q;
        int l=i;
        int r=i;
        Q.push_front(s[i]);
        m[Q]++;
        while(l-1>=0 && r+1<n)
        {
            if(s[l-1]==s[r+1])
            {
                l--;
                r++;
                Q.push_front(s[l]);
                Q.push_back(s[r]);
                m[Q]++;
            }
            else
            {
                break;
            }
        }
    }
    for(auto ax:m)
    {
        long long num=ax.first.size()*ax.second;
        ans=max(num,ans);
    }
    m.clear();
    for(int i=0;i<n-1;i++)
    {
        deque<char>Q;
        int l=i;
        int r=i+1;
        if(s[l]!=s[r])continue;
        Q.push_front(s[l]);
        Q.push_back(s[r]);
        m[Q]++;
        while(l-1>=0 && r+1<n)
        {
            if(s[l-1]==s[r+1])
            {
                l--;
                r++;
                Q.push_front(s[l]);
                Q.push_back(s[r]);
                m[Q]++;
            }
            else
            {
                break;
            }
        }
    }
    for(auto ax:m)
    {
        long long num=ax.first.size()*ax.second;
        ans=max(num,ans);
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 1648 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 1058 ms 1568 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 1069 ms 1732 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 1037 ms 2092 KB Time limit exceeded
2 Halted 0 ms 0 KB -