제출 #1123715

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123715		gdragon	Palindromic Partitions (CEOI17_palindromic)	C++20	60 / 100	1117 ms	112148 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 1e4 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
// const int mod = 1e9 + 7;
// void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
// void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
// int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
const pair<int, int> mod = {1e9 + 7, 1e9 + 9};
const pair<int, int> base = {31, 311};
ii operator + (const ii &x, const ii &y) {
    return {(x.fi + y.fi) % mod.fi, (x.se + y.se) % mod.se};
}
ii operator - (const ii &x, const ii &y) {
    return {(x.fi - y.fi + mod.fi) % mod.fi, (x.se - y.se + mod.se) % mod.se};
}
ii operator * (const ii &x, const ii &y) {
    return {1LL * x.fi * y.fi % mod.fi, 1LL * x.se * y.se % mod.se};
}
pair<int, int> pw[N];
int n;
pair<int, int> hs[N];
string s;
void read() {
    cin >> s;
    n = SZ(s);
    s = ' ' + s;
}
pair<int, int> getHash(int l, int r) {
    return hs[r] - hs[l - 1] * pw[r - l + 1];
}
vector<int> pos[N];
vector<vector<int>> f;
void calPos(int l, int r) {
    if (l > r) return;
    if (!pos[l].empty()) return;
    for(int i = 0; l + i < r - i; i++) {
        if (getHash(l, l + i) == getHash(r - i, r)) {
            pos[l].push_back(i);
            calPos(l + i + 1, r - i - 1);
        }
    }
}
int calDp(int l, int r) {
    if (l > r) return 0;
    if (pos[l].empty()) return 1;
    if (f[l].back() != 0) return f[l].back();
    int res = 1;
    for(int i = 0; i < SZ(pos[l]); i++) {
        // cerr << l << ' ' << r << ' ' << pos[l][i] << endl; 
        f[l][i] = calDp(l + pos[l][i] + 1, r - pos[l][i] - 1) + 2;
        res = max(res, f[l][i]);
    }
    f[l][SZ(pos[l])] = res;
    return res;
}
void solve() {
    for(int i = 1; i <= n; i++) {
        pair<int, int> c = {s[i] - 'a' + 1, s[i] - 'a' + 1};
        hs[i] = hs[i - 1] * base + c;
    }
    if (n <= 10000) {
        for(int i = 1; i <= n; i++) pos[i].clear();
        calPos(1, n);
        f.assign(n + 1, vector<int>());
        for(int i = 1; i <= n; i++) f[i].assign(SZ(pos[i]) + 1, 0);
        cout << calDp(1, n) << endl;
    }
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    pw[0] = {1, 1};
    for(int i = 1; i < N; i++) pw[i] = pw[i - 1] * base; 
    int test = 1;
    cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

palindromic.cpp: In function 'int main()':
palindromic.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
palindromic.cpp:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 15 / 15
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 0 / 40