oj.uz

Submission #957304

# Submission time Handle Problem Language Result Execution time Memory
957304 2024-04-03T12:51:33 Z vjudge1 Palindromes (APIO14_palindrome) C++14
8 / 100
 1000 ms 996 KB 
#include<bits/stdc++.h>

using namespace std;

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   string s;
   cin >> s;
   int ans=0;
   int n=s.size();
   for (int i=0; i<n; ++i) for (int j=i; j<n; ++j){
      string t=s.substr(i, j-i+1);
      string rt(t.rbegin(), t.rend());
      if (t!=rt) continue;
      int cnt=0;
      for (int k=0; k+j-i<n; ++k) if (s.substr(k, j-i+1)==t) ++cnt;
      ans=max(ans, (j-i+1)*cnt);
   }
   cout << ans;
   return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 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 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 348 KB Output is correct
11 Correct 1 ms 500 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 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 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 4 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 11 ms 348 KB Output is correct
24 Correct 3 ms 348 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 3 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1095 ms 504 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 1051 ms 552 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 1059 ms 604 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 1034 ms 996 KB Time limit exceeded
2 Halted 0 ms 0 KB -