oj.uz

답안 #62658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62658 2018-07-29T16:51:34 Z Nnandi Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 99 ms 32144 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll mod = 1000000009LL;
const ll prm = 103LL;
vector<int> sol;

int Get_Max_Partition(string &s, int l, int r) {
    if(l > r) return 0;
    if(l == r) return 1;
    if(s[l] == s[r]) return 2+ Get_Max_Partition(s,l+1,r-1);
    ll exp1 = s[l];
    ll exp2 = s[r];
    ll pow = 1LL;
    for(int i=1;i<(r-l+1)/2;i++) {
        pow *= prm;
        pow = pow % mod;
        exp1 = exp1 * prm + s[l+i];
        exp1 = exp1 % mod;
        exp2 = exp2 + pow * s[r-i];
        exp2 = exp2 % mod;
        if(exp1 == exp2) {
            bool match = true;
            for(int j=0;j<=i && match;j++) {
                if(s[l+j] != s[r-i+j]) match = false;
            }
            if(match) {
                return 2 + Get_Max_Partition(s,l+i+1,r-i-1);
            }
        }
    }
    return 1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int test;
    cin>>test;
    for(int tc=0;tc<test;tc++) {
        string s;
        cin>>s;
        sol.push_back(Get_Max_Partition(s,0,s.size()-1));
    }
    for(int d:sol) {
        cout<<d<<endl;
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 3 ms 400 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 4 ms 768 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 3 ms 400 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 4 ms 772 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 3 ms 400 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 4 ms 772 KB Output is correct
10 Correct 3 ms 904 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct
12 Correct 4 ms 1080 KB Output is correct
13 Correct 4 ms 1196 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 248 KB Output is correct
2 Correct 3 ms 360 KB Output is correct
3 Correct 3 ms 400 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 4 ms 772 KB Output is correct
10 Correct 3 ms 904 KB Output is correct
11 Correct 3 ms 1004 KB Output is correct
12 Correct 4 ms 1080 KB Output is correct
13 Correct 4 ms 1196 KB Output is correct
14 Correct 86 ms 13692 KB Output is correct
15 Correct 51 ms 18404 KB Output is correct
16 Correct 99 ms 27756 KB Output is correct
17 Correct 60 ms 32144 KB Output is correct