#1004427 (C++23) No.2858 Make a Palindrome

提出ソース

結果

問題	No.2858 Make a Palindrome
ユーザー	noya2
提出日時	2024-08-25 14:11:22
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	115 ms / 3,000 ms
コード長	6,119 bytes
コンパイル時間	3,053 ms
コンパイル使用メモリ	255,024 KB
実行使用メモリ	11,948 KB
最終ジャッジ日時	2024-08-25 14:11:32
合計ジャッジ時間	5,618 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	115 ms 6,816 KB
testcase_01	AC	35 ms 6,940 KB
testcase_02	AC	35 ms 6,940 KB
testcase_03	AC	37 ms 6,940 KB
testcase_04	AC	34 ms 6,944 KB
testcase_05	AC	27 ms 6,940 KB
testcase_06	AC	25 ms 6,944 KB
testcase_07	AC	25 ms 6,944 KB
testcase_08	AC	25 ms 6,944 KB
testcase_09	AC	25 ms 6,944 KB
testcase_10	AC	28 ms 6,944 KB
testcase_11	AC	28 ms 6,944 KB
testcase_12	AC	28 ms 6,944 KB
testcase_13	AC	29 ms 6,940 KB
testcase_14	AC	29 ms 6,940 KB
testcase_15	AC	13 ms 6,944 KB
testcase_16	AC	13 ms 6,944 KB
testcase_17	AC	14 ms 6,944 KB
testcase_18	AC	13 ms 6,940 KB
testcase_19	AC	14 ms 6,944 KB
testcase_20	AC	19 ms 10,828 KB
testcase_21	AC	19 ms 10,900 KB
testcase_22	AC	11 ms 7,216 KB
testcase_23	AC	21 ms 10,768 KB
testcase_24	AC	17 ms 9,976 KB
testcase_25	AC	15 ms 9,316 KB
testcase_26	AC	16 ms 9,172 KB
testcase_27	AC	21 ms 11,640 KB
testcase_28	AC	18 ms 9,724 KB
testcase_29	AC	20 ms 11,144 KB
testcase_30	AC	22 ms 11,948 KB
testcase_31	AC	21 ms 11,796 KB
testcase_32	AC	21 ms 11,852 KB
testcase_33	AC	21 ms 11,812 KB
testcase_34	AC	23 ms 11,728 KB
testcase_35	AC	22 ms 11,768 KB
testcase_36	AC	22 ms 11,832 KB
testcase_37	AC	22 ms 11,844 KB
testcase_38	AC	22 ms 11,732 KB
testcase_39	AC	21 ms 11,856 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


vector<int> manacher(string &s){ // ans[i] : maximum radius of palindrome centered at s[i]
    int n = s.size();
    vector<int> ans(n,0);
    int i = 0, len = 0;
    while (i < n){
        while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;
        ans[i] = len;
        int k = 1;
        while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;
        i += k, len -= k;
    }
    return ans;
}

vector<int> palindrome_length(string s){ // ans[i] : maximum length of palindrome centered at (i % 2 == 0 ? s[i/2] : s[i/2]|s[i/2+1])
    string t = "$";
    for (char c : s) t += c, t += '$';
    vector<int> a = manacher(t);
    vector<int> ans(a.size()-2);
    for (int i = 0; i < (int)a.size()-2; i++) ans[i] = a[i+1]-1;
    return ans;
}

void solve(){
    ll n, m; in(n,m);
    string s; in(s);
    // 1
    {
        auto dp = palindrome_length(s);
        for (int l : dp){
            if (l >= m){
                out(1);
                return ;
            }
        }
    }
    // 2
    {
        auto dp = palindrome_length(s+s);
        for (int l : dp){
            if (l >= m){
                out(2);
                return ;
            }
        }
    }
    // 3
    auto dp = palindrome_length(s);
    auto ispali = [&](int l, int r){
        if (r - l == 0) return true;
        if ((r - l) % 2 == 0){
            int c = (l + r) / 2;
            return dp[2*c-1] == r-l;
        }
        int c = (l + r-1) / 2;
        return dp[2*c] == r-l;
    };
    ll len = -1;
    rep(i,n){
        if (ispali(0,i+1) && ispali(i+1,n)){
            chmax(len,max<ll>(i+1,n-1-i));
        }
    }
    if (len == -1){
        out(-1);
        return ;
    }
    ll ans = ceil_div(m-len,n)+1;
    out(ans);
}

int main(){
    int t = 1; in(t);
    while (t--) { solve(); }
}

yukicoder

結果

テストケース

ソースコード