mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/yosupo/enumerate_palindromes.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/enumerate_palindromes"

#include "./../../template/template.hpp"
#include "./../../string/manachar.hpp"

using namespace mmrz;

void mmrz::solve(){
    string s;
    cin >> s;
    vector<int> r = manachar(s);
    vector<int> ans(2*len(s)-1);
    rep(i, 2*len(s)-1){
        if(i%2){
            ans[i] = r[i]*2;
        }else{
            ans[i] = r[i]*2-1;
        }
    }
    rep(i, 2*len(s)-1){
        cout << ans[i] << " \n"[i == 2*len(s)-2];
    }
}
#line 1 "verify/yosupo/enumerate_palindromes.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/enumerate_palindromes"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "string/manachar.hpp"

#line 5 "string/manachar.hpp"

std::vector<int> manachar(std::string _s){
	std::string t = "";
	int n = (int)_s.size();
	for(int i = 0;i < n;i++){
		if(i)t += '#';
		t += _s[i];
	}
	n = (int)t.size();
	int i = 0, j = 0;
	std::vector<int> r(n);
	while(i < n){
		while(i-j >= 0 && i+j < n && t[i-j] == t[i+j]) j++;
		r[i] = j;
		int k = 1;
		while(i-k >= 0 && k+r[i-k] < j) r[i+k] = r[i-k], k++;
		i += k, j -= k;
	}
	for(int k = 0;k < n;k++){
		if(k&1)r[k] >>= 1;
		else r[k] = (r[k]+1) >> 1;
	}
	return r;
}

/*
int i = 0, j = 0;
while (i < S.size()) {
  while (i-j >= 0 && i+j < S.size() && S[i-j] == S[i+j]) ++j;
  R[i] = j;
  int k = 1;
  while (i-k >= 0 && k+R[i-k] < j) R[i+k] = R[i-k], ++k;
  i += k; j -= k;
}
*/
#line 5 "verify/yosupo/enumerate_palindromes.test.cpp"

using namespace mmrz;

void mmrz::solve(){
    string s;
    cin >> s;
    vector<int> r = manachar(s);
    vector<int> ans(2*len(s)-1);
    rep(i, 2*len(s)-1){
        if(i%2){
            ans[i] = r[i]*2;
        }else{
            ans[i] = r[i]*2-1;
        }
    }
    rep(i, 2*len(s)-1){
        cout << ans[i] << " \n"[i == 2*len(s)-2];
    }
}
Back to top page