#416003 (C++14) No.958 たぷりすたべる (回文)

提出ソース

結果

問題	No.958 たぷりすたべる (回文)
ユーザー	sntea
提出日時	2020-01-12 21:38:46
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,774 bytes
コンパイル時間	3,046 ms
コンパイル使用メモリ	195,652 KB
実行使用メモリ	24,832 KB
最終ジャッジ日時	2024-05-07 20:10:52
合計ジャッジ時間	7,113 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	1 ms 5,376 KB
testcase_04	AC	1 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	1 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	1 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	AC	1 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	WA	-
testcase_20	WA	-
testcase_21	AC	2 ms 5,376 KB
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	AC	2 ms 5,376 KB
testcase_26	WA	-
testcase_27	AC	16 ms 5,376 KB
testcase_28	WA	-
testcase_29	WA	-
testcase_30	AC	15 ms 5,376 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	15 ms 5,376 KB
testcase_35	AC	15 ms 5,376 KB
testcase_36	AC	16 ms 5,376 KB
testcase_37	AC	16 ms 5,376 KB
testcase_38	AC	16 ms 5,376 KB
testcase_39	AC	16 ms 5,376 KB
testcase_40	AC	17 ms 5,376 KB
testcase_41	AC	16 ms 5,376 KB
testcase_42	WA	-
testcase_43	WA	-
testcase_44	WA	-
testcase_45	WA	-
testcase_46	WA	-
testcase_47	WA	-
testcase_48	WA	-
testcase_49	WA	-
testcase_50	WA	-
testcase_51	WA	-
testcase_52	AC	167 ms 24,648 KB
testcase_53	WA	-
testcase_54	WA	-

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

ソースコード

raw source code

#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

template<long long MOD>
class ModInt {
public:
	const static long long mod = MOD;
	long long x;
	
	ModInt() {
		x = 0;
	}

	ModInt(long long x) {
		x %= mod;
		this->x = x < 0 ? x+mod : x;
	}

	int get() const {
		return (int)x;
	}

	ModInt &operator+=(ModInt that) {
		if((x += that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator-=(ModInt that) {
		if((x += mod-that.get()) >= mod) x -= mod;
		return *this;
	}

	ModInt &operator*=(ModInt that) {
		x = x*that.get()%mod;
		return *this;
	}

	ModInt &operator/=(ModInt that) {
		return *this *= that.inverse();
	}

	ModInt operator+(ModInt that) const {
		return ModInt(*this) += that;
	}

	ModInt operator-(ModInt that) const {
		return ModInt(*this) -= that;
	}

	ModInt operator*(ModInt that) const {
		return ModInt(*this) *= that;
	}

	ModInt operator/(ModInt that) const {
		return ModInt(*this) /= that;
	}

	ModInt inverse() const {
		using std::swap;
		long long a = x, b = mod, u = 1, v = 0;
		while(b) {
			long long t = a/b;
			a -= t*b; swap(a,b);
			u -= t*v; swap(u,v);
		}
		return ModInt(u);
	}

	ModInt pow(int n) const{
		ModInt b = *this;
		ModInt res = 1;
		while(n != 0) {
			if(n&1){
				res *= b;
			}
			b *= b;
			n >>= 1;
		}
		return res;
	}

	bool operator==(ModInt that) const { return x == that.get(); }
	bool operator!=(ModInt that) const { return x != that.get(); }
	ModInt operator-() const { return x == 0 ? 0 : ModInt(mod-x); }
};

template<long long MOD> ostream& operator<< (ostream& os, const ModInt<MOD>& m) { os << m.get(); return os; }
template<long long MOD> istream& operator>> (istream& is, ModInt<MOD>& m){ long long n; is >> n; m = n; return is;}
typedef ModInt<1000000007> mint;


//library
/*
10015727
10015739
10015783
10015801
10015813
10015847
*/
class RollingHash {
public:
	using mint0 = ModInt<1000000007>;
	using mint1 = ModInt<1000000009>;
	using mint2 = ModInt<999999937>;
	using H = tuple<mint0, mint1, mint2>;
	mint0 b0;
	mint1 b1;
	mint2 b2;
	vector<H> table;
	vector<H> power_inv;

	RollingHash(const string& s, int b0i = 2, int b1i = 3, int b2i = 5) {
		int n = s.size();
		table.reserve(n + 1);

		b0 = b0i;
		b1 = b1i;
		b2 = b2i;

		mint0 t0 = 1;
		mint1 t1 = 1;
		mint2 t2 = 1;

		table.emplace_back(0, 0, 0);

		mint0 val0 = 0;
		mint1 val1 = 0;
		mint2 val2 = 0;

		for(auto&& c : s) {
			val0 += t0 * c;
			val1 += t1 * c;
			val2 += t2 * c;
			table.emplace_back(val0, val1, val2);
			t0 *= b0;
			t1 *= b1;
			t2 *= b2;
		}

		power_inv.reserve(n + 1);
		t0 = 1;
		t1 = 1;
		t2 = 1;
		mint0 b0_inv = b0.inverse();
		mint1 b1_inv = b1.inverse();
		mint2 b2_inv = b2.inverse();
		power_inv.emplace_back(t0, t1, t2);
		for (int i = 0; i < n; ++i) {
			t0 *= b0_inv;
			t1 *= b1_inv;
			t2 *= b2_inv;
			power_inv.emplace_back(t0, t1, t2);
		}
	}

	H query(int l, int r) {
		mint0 lval0, rval0, inv0;
		mint1 lval1, rval1, inv1;
		mint2 lval2, rval2, inv2;
		tie(lval0, lval1, lval2) = table[l];
		tie(rval0, rval1, rval2) = table[r];
		tie(inv0, inv1, inv2) = power_inv[l];
		return H((rval0 - lval0) * inv0, (rval1 - lval1) * inv1, (rval2 - lval2) * inv2);
	}
};

int main()
{
	ios_init();
	int n, q;
	LL k;
	while(cin >> n >> k >> q) {
		string s;
		cin >> s;

		vector<LL> a(q);
		REP(i, q) cin >> a[i];
		RollingHash rh(s);
		reverse(ALL(s));
		RollingHash rhr(s);
		reverse(ALL(s));
		vector<int> mav(n);
		REP(i, n) {
			DEBUG(i);
			int ri = n - 1 - i;
			// DEBUG(ri);
			int l = 0;
			int r = min(i, n - 1 - i) + 2;
			// DEBUG(l); DEBUG(r);
			while(l + 1 < r) {
				int m = (l + r) / 2;
				if(rh.query(i, i + m) == rhr.query(ri, ri + m)) {
					l = m;
				} else {
					r = m;
				}
			}
			// DEBUG(l);
			int v = l * 2 - 1;
			DEBUG(v);
			if(l == min(i, n - 1 - i) + 1 and 2 * i + 1 != n) {
				int ls, rs;
				if(i < n / 2) {
					ls = i + i + 1;
					rs = n - 1;
				} else {
					ls = 0;
					// DEBUG(n - 1 - i);
					rs = n  - 1 - 2 * (n - 1 - i) - 1;
				}
				DEBUG(ls); DEBUG(rs);
				int l = 0;
				int r = (rs - ls + 1) / 2 + 1;
				DEBUG((rs - ls + 1) / 2 + 1);
				// DEBUG(l); DEBUG(r);
				while(l + 1 < r) {
					int m = (r + l) / 2;
					int rsr = n - 1 - rs;
					if(rh.query(ls, ls + m) == rhr.query(rsr, rsr + m)) {
						l = m;
					} else {
						r = m;
					}
				}
				// DEBUG(l);
				// DEBUG(l * 2 + (rs - ls + 1) % 2);
				v += l * 2 + (rs - ls + 1) % 2;
				DEBUG(v);
			}
			mav[i] = v;
		}
		dpite(ALL(mav));
		REP(i, q) {
			a[i]--;
			DEBUG(a[i]);
			if(mav[a[i] % n] == n) {
				cout << min(k * n - a[i] - 1, a[i]) * 2 + 1 << endl;
			} else {
				DEBUG(mav[a[i] % n]);
				cout << min((LL)mav[a[i] % n], (LL)min(k * n - a[i] - 1, a[i]) * 2 + 1) << endl;
			}
		}
	}
	return 0;
}

yukicoder

結果

テストケース

ソースコード