oj.uz

답안 #1024674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1024674 2024-07-16T09:07:53 Z Gangsta Palinilap (COI16_palinilap) C++14
17 / 100
 1000 ms 600 KB 
#include "bits/stdc++.h"
#define ll long long int
#define pb push_back
#define pii pair<int,int>
#define ff first
#define ss second
#define sz size()

const int N = 2e5 + 1;

using namespace std;

ll ans, mx;

void f(string s){
    for(int i = 0; i < (int)s.sz; i++){
        int nd = i, nd1 = i;
        while(nd >= 0 and nd1 < (int)s.sz and s[nd] == s[nd1]){
            ans++;
            nd--;
            nd1++;
        }
    }
    for(int i = 0; i < (int)s.sz-1; i++){
        int nd = i, nd1 = i+1;
        while(nd >= 0 and nd1 < (int)s.sz and s[nd] == s[nd1]){
            ans++;
            nd--;
            nd1++;
        }
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //freopen("input.in", "r", stdin);
    //freopen("output.out", "w", stdout);
    string s1,s2;
    cin >> s1;
    s2 = s1;
    for(int i = 0; i < (int)s1.sz; i++){
        for(char j = 'a'; j <= 'z'; j++){
            ans = 0;
            s2[i] = j;
            f(s2);
            s2[i] = s1[i];
            mx = max(mx,ans);
        }
    }
    cout << mx;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 37.0

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

Subtask #3
0 / 46.0

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