oj.uz

Submission #647074

# Submission time Handle Problem Language Result Execution time Memory
647074 2022-10-01T14:04:58 Z google Palindromes (APIO14_palindrome) C++17
23 / 100
 1000 ms 131072 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
map<string,ll> m;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    string s; cin >> s;
    int n = int(s.size());
    for (int i = 0;i<n;i++){
        string t = "";
        for (int j = i;j<n;j++){
            t += s[j];
            int sz = t.size()/2, bb = 0;
            for (int i = 0;i<=sz;i++){
                if (t[i] != t[t.size()-i-1]) {
                    bb = 1;
                    break;
                }
            }
            if (bb) continue;
            m[t]++;
        }
    }
    ll ans = 0;
    for (auto [a,b]:m) ans = max(ans,b*int(a.size()));
    cout << ans;
    return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 880 KB Output is correct
2 Correct 30 ms 640 KB Output is correct
3 Correct 135 ms 884 KB Output is correct
4 Correct 7 ms 400 KB Output is correct
5 Correct 124 ms 892 KB Output is correct
6 Correct 119 ms 892 KB Output is correct
7 Correct 6 ms 724 KB Output is correct
8 Correct 64 ms 892 KB Output is correct
9 Correct 6 ms 340 KB Output is correct
10 Correct 4 ms 212 KB Output is correct
11 Correct 4 ms 212 KB Output is correct
12 Correct 7 ms 596 KB Output is correct

Subtask #3
0 / 24.0

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

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 165 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 171 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -