oj.uz

답안 #1024547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024547 2024-07-16T07:16:23 Z KasymK Palinilap (COI16_palinilap) C++17
17 / 100
 1000 ms 604 KB 
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define pii pair<int, int>
#define wr puts("---------------")
#define all(v) v.begin(), v.end()
const int N = 3e5+5;

int weight(string s){
    int ans = 0, n = (int)s.size();
    for(int i = 0; i < n; ++i){
        int sm = 1, l = i-1, r = i+1;
        while(l >= 0 and r < n)
            if(s[l] == s[r])
                sm++, l--, r++;
            else
                break;
        ans += sm;
    }
    for(int i = 0; i < n-1; ++i){
        if(s[i] != s[i+1])
            continue;
        int sm = 1, l = i-1, r = i+2;
        while(l >= 0 and r < n)
            if(s[l] == s[r])
                sm++, l--, r++;
            else
                break;
        ans += sm;
    }
    return ans;
}

int main(){
    string s;
    cin >> s;
    int n = (int)s.size(), answer = weight(s);
    for(int i = 0; i < n; ++i){
        char ad = s[i];
        for(char c = 'a'; c <= 'z'; ++c)
            s[i] = c, answer = max(answer, weight(s));
        s[i] = ad;
    }
    printf("%d", answer);
    return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 7 ms 436 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1068 ms 604 KB Time limit exceeded
2 Halted 0 ms 0 KB -