Submission #967543

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
967543	2024-04-22T12:06:28 Z	KasymK	Palindromes (APIO14_palindrome)	C++17	23 / 100	1000 ms	131072 KB

palindrome

#include "bits/stdc++.h"

using namespace std;

bool pal(string s){
    int l = 0, r = (int)s.size() - 1;
    while(l < r){
        if(s[l] != s[r])
            return 0;
        l++, r--;
    }
    return 1;
}

int main(){
    string s;
    cin >> s;
    int n = (int)s.size();
    unordered_map<string, int> mp;
    for(int i = 0; i < n; ++i){
        string str = "";
        for(int j = i; j < n; ++j){
            str += s[j];
            if(pal(str))
                mp[str]++;
        }
    }
    int jog = -1;
    for(auto &to : mp)
        jog = max(jog, (int)to.first.size()*to.second);
    printf("%d\n", jog);
    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	436 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 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	436 KB	Output is correct
11	Correct	0 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	1 ms	600 KB	Output is correct
17	Correct	1 ms	504 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	0 ms	348 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	344 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	55 ms	860 KB	Output is correct
2	Correct	24 ms	600 KB	Output is correct
3	Correct	92 ms	860 KB	Output is correct
4	Correct	19 ms	604 KB	Output is correct
5	Correct	97 ms	856 KB	Output is correct
6	Correct	99 ms	860 KB	Output is correct
7	Correct	15 ms	860 KB	Output is correct
8	Correct	54 ms	1268 KB	Output is correct
9	Correct	14 ms	348 KB	Output is correct
10	Correct	15 ms	348 KB	Output is correct
11	Correct	13 ms	348 KB	Output is correct
12	Correct	17 ms	604 KB	Output is correct

Subtask #3

0 / 24.0

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

Subtask #4

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	116 ms	131072 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #5

0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	106 ms	131072 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-