oj.uz

Submission #987649

# Submission time Handle Problem Language Result Execution time Memory
987649 2024-05-23T09:07:51 Z ErJ Palindromic Partitions (CEOI17_palindromic) C++17
60 / 100
 10000 ms 5376 KB 
#include<bits/stdc++.h>

#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define pp pair<ll, ll>
#define inf 1000000000000000


using namespace std;



string s;

bool test(string x, int i, int j){ // all in
    bool is = true;
    for(int k = i; k <= j; k++){
        if(x[k - i] != s[k]){
            is = false;
        }
    }
    return is;
}

int main(){
    int t;
    cin >> t;
    while(t--){
        cin >> s;
        int n = s.size();
        int ans = 0;
        int mid = n/2;
        string akt = "";
        for(int i = 0; i < mid; i++){
            akt += s[i];
            if(test(akt, n - 1 - i,  n - 1 - (i - akt.size() + 1))){
                ans += 2;
                akt = "";
            }
        }
        if(n %2 == 1) akt += "a";
        if(akt != ""){
            ans++;
        }
        cout << ans << endl;
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 344 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 27 ms 348 KB Output is correct
11 Correct 26 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 432 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 27 ms 348 KB Output is correct
11 Correct 26 ms 348 KB Output is correct
12 Correct 6 ms 348 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Execution timed out 10065 ms 5376 KB Time limit exceeded
15 Halted 0 ms 0 KB -