oj.uz

Submission #765680

# Submission time Handle Problem Language Result Execution time Memory
765680 2023-06-25T02:54:17 Z boyliguanhan Lampice (COCI19_lampice) C++17
25 / 110
 786 ms 632 KB 
#include<bits/stdc++.h>
using namespace std;
int main() {
    int n, ans = 0;
    cin >> n;
    string str;
    cin >> str;
    for(int i = 0; i < n; i++) {
        int j, k;
        for(j = i, k = i; j>=0&&k<n; j--,k++) {
            if(str[j]!=str[k]) {
                break;
            }
        }
        ans = max(ans, k-j-1);
        for(j = i, k = i+1; j>=0&&k<n; j--,k++) {
            if(str[j]!=str[k]) {
                break;
            }
        }
        ans = max(ans, k-j-1);
    }
    cout << ans << '\n';
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 786 ms 632 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -