oj.uz

답안 #848894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
848894 2023-09-13T16:37:38 Z quanlt206 Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 89 ms 29644 KB 
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;

template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */

const int N = 1e6 + 7;
const ll mod = 1e9 + 427;
const ll base = 311;

int dp[N], n;

ll h[N], p[N];

string s;

void buildHash() {
    p[0] = 1;
    h[0] = 0;
    FOR(i, 1, n) {
        p[i] = p[i - 1] * base % mod;
        h[i] = (h[i - 1] * base + s[i] - 'a' + 1) % mod;
    }
}

ll getHash(int i, int j) {
    return (h[j] - h[i - 1] * p[j - i + 1] + mod * mod) % mod;
}

void solve() {
    cin>>s;
    n = s.size();
    s = " " + s;
    buildHash();
    int l = 1, r = n;
    int res = 0;
    while (l <= r) {
        if (l == r) {
            res++;
            break;
        }
        bool tmp = true;
        FOR(i, 1, (r - l + 1) / 2)
            if (getHash(l, l + i - 1) == getHash(r - i + 1, r)) {
                res+=2;
                tmp = false;
                l+=i;
                r-=i;
                break;
            }
        if (tmp) {
            res++;
            break;
        }
    }
    cout<<res<<"\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int q;
    cin>>q;
    while (q--) solve();
    return 0;
}

Subtask #1
15.0 / 15.0

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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 2 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 2 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4440 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 2 ms 4440 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 2 ms 4440 KB Output is correct
13 Correct 1 ms 4440 KB Output is correct
14 Correct 89 ms 27696 KB Output is correct
15 Correct 46 ms 23840 KB Output is correct
16 Correct 78 ms 29644 KB Output is correct
17 Correct 47 ms 19084 KB Output is correct