#655491 (C++17) No.1504 ヌメロニム

提出ソース

結果

問題	No.1504 ヌメロニム
ユーザー	sigma425
提出日時	2021-05-08 04:00:13
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	334 ms / 2,000 ms
コード長	5,908 bytes
コンパイル時間	2,336 ms
コンパイル使用メモリ	207,560 KB
実行使用メモリ	38,676 KB
最終ジャッジ日時	2023-10-14 01:07:34
合計ジャッジ時間	11,889 ms
ジャッジサーバーID （参考情報）	judge14 / judge15

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	17 ms 14,780 KB
testcase_01	AC	18 ms 14,620 KB
testcase_02	AC	18 ms 14,576 KB
testcase_03	AC	18 ms 14,564 KB
testcase_04	AC	19 ms 14,672 KB
testcase_05	AC	19 ms 14,636 KB
testcase_06	AC	18 ms 14,768 KB
testcase_07	AC	19 ms 14,552 KB
testcase_08	AC	18 ms 14,792 KB
testcase_09	AC	18 ms 14,708 KB
testcase_10	AC	18 ms 14,692 KB
testcase_11	AC	18 ms 14,796 KB
testcase_12	AC	18 ms 14,656 KB
testcase_13	AC	18 ms 14,660 KB
testcase_14	AC	18 ms 14,564 KB
testcase_15	AC	18 ms 14,848 KB
testcase_16	AC	18 ms 14,740 KB
testcase_17	AC	18 ms 14,792 KB
testcase_18	AC	18 ms 14,768 KB
testcase_19	AC	18 ms 14,708 KB
testcase_20	AC	20 ms 15,108 KB
testcase_21	AC	19 ms 15,148 KB
testcase_22	AC	20 ms 15,112 KB
testcase_23	AC	18 ms 14,784 KB
testcase_24	AC	315 ms 37,924 KB
testcase_25	AC	168 ms 28,168 KB
testcase_26	AC	317 ms 38,560 KB
testcase_27	AC	173 ms 29,216 KB
testcase_28	AC	175 ms 29,336 KB
testcase_29	AC	334 ms 38,400 KB
testcase_30	AC	321 ms 38,412 KB
testcase_31	AC	171 ms 28,656 KB
testcase_32	AC	174 ms 29,176 KB
testcase_33	AC	310 ms 38,292 KB
testcase_34	AC	51 ms 18,484 KB
testcase_35	AC	51 ms 17,988 KB
testcase_36	AC	161 ms 26,480 KB
testcase_37	AC	32 ms 16,440 KB
testcase_38	AC	322 ms 38,616 KB
testcase_39	AC	314 ms 38,596 KB
testcase_40	AC	304 ms 38,672 KB
testcase_41	AC	316 ms 38,600 KB
testcase_42	AC	313 ms 38,612 KB
testcase_43	AC	310 ms 38,652 KB
testcase_44	AC	311 ms 38,596 KB
testcase_45	AC	309 ms 38,612 KB
testcase_46	AC	306 ms 38,676 KB
testcase_47	AC	318 ms 38,628 KB
testcase_48	AC	167 ms 28,700 KB
testcase_49	AC	163 ms 28,236 KB
testcase_50	AC	20 ms 15,108 KB
testcase_51	AC	19 ms 15,032 KB
testcase_52	AC	18 ms 14,784 KB
testcase_53	AC	18 ms 15,260 KB
testcase_54	AC	19 ms 14,796 KB
testcase_55	AC	52 ms 17,872 KB
testcase_56	AC	18 ms 14,640 KB
testcase_57	AC	19 ms 14,720 KB
testcase_58	AC	18 ms 14,672 KB
testcase_59	AC	18 ms 14,724 KB
testcase_60	AC	19 ms 14,620 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> void chmax(T& x, U y){if(x<y) x=y;}
template<class T,class U> void chmin(T& x, U y){if(y<x) x=y;}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif


template<unsigned int mod_>
struct ModInt{
	using uint = unsigned int;
	using ll = long long;
	using ull = unsigned long long;

	constexpr static uint mod = mod_;

	uint v;
	ModInt():v(0){}
	ModInt(ll _v):v(normS(_v%mod+mod)){}
	explicit operator bool() const {return v!=0;}
	static uint normS(const uint &x){return (x<mod)?x:x-mod;}		// [0 , 2*mod-1] -> [0 , mod-1]
	static ModInt make(const uint &x){ModInt m; m.v=x; return m;}
	ModInt operator+(const ModInt& b) const { return make(normS(v+b.v));}
	ModInt operator-(const ModInt& b) const { return make(normS(v+mod-b.v));}
	ModInt operator-() const { return make(normS(mod-v)); }
	ModInt operator*(const ModInt& b) const { return make((ull)v*b.v%mod);}
	ModInt operator/(const ModInt& b) const { return *this*b.inv();}
	ModInt& operator+=(const ModInt& b){ return *this=*this+b;}
	ModInt& operator-=(const ModInt& b){ return *this=*this-b;}
	ModInt& operator*=(const ModInt& b){ return *this=*this*b;}
	ModInt& operator/=(const ModInt& b){ return *this=*this/b;}
	ModInt& operator++(int){ return *this=*this+1;}
	ModInt& operator--(int){ return *this=*this-1;}
	ModInt pow(ll p) const {
		if(p<0) return inv().pow(-p);
		ModInt a = 1;
		ModInt x = *this;
		while(p){
			if(p&1) a *= x;
			x *= x;
			p >>= 1;
		}
		return a;
	}
	ModInt inv() const {		// should be prime
		return pow(mod-2);
	}
	// ll extgcd(ll a,ll b,ll &x,ll &y) const{
	// 	ll p[]={a,1,0},q[]={b,0,1};
	// 	while(*q){
	// 		ll t=*p/ *q;
	// 		rep(i,3) swap(p[i]-=t*q[i],q[i]);
	// 	}
	// 	if(p[0]<0) rep(i,3) p[i]=-p[i];
	// 	x=p[1],y=p[2];
	// 	return p[0];
	// }
	// ModInt inv() const {
	// 	ll x,y;
	// 	extgcd(v,mod,x,y);
	// 	return make(normS(x+mod));
	// }

	bool operator==(const ModInt& b) const { return v==b.v;}
	bool operator!=(const ModInt& b) const { return v!=b.v;}
	bool operator<(const ModInt& b) const { return v<b.v;}
	friend istream& operator>>(istream &o,ModInt& x){
		ll tmp;
		o>>tmp;
		x=ModInt(tmp);
		return o;
	}
	friend ostream& operator<<(ostream &o,const ModInt& x){ return o<<x.v;}
};
using mint = ModInt<998244353>;
//using mint = ModInt<1000000007>;

V<mint> fact,ifact,invs;
mint Choose(int a,int b){
	if(b<0 || a<b) return 0;
	return fact[a] * ifact[b] * ifact[a-b];
}
void InitFact(int N){	//[0,N]
	N++;
	fact.resize(N);
	ifact.resize(N);
	invs.resize(N);
	fact[0] = 1;
	rep1(i,N-1) fact[i] = fact[i-1] * i;
	ifact[N-1] = fact[N-1].inv();
	for(int i=N-2;i>=0;i--) ifact[i] = ifact[i+1] * (i+1);
	rep1(i,N-1) invs[i] = fact[i-1] * ifact[i];
}

int bsr(int x) { return 31 - __builtin_clz(x); }
void ntt(bool type, V<mint>& c) {
	const mint G = 3;	//primitive root

	int N = int(c.size());
	int s = bsr(N);
	assert(1 << s == N);

	V<mint> a = c, b(N);
	rep1(i,s){
		int W = 1 << (s - i);
		mint base = G.pow((mint::mod - 1)>>i);
		if(type) base = base.inv();
		mint now = 1;
		for(int y = 0; y < N / 2; y += W) {
			for (int x = 0; x < W; x++) {
				auto l = a[y << 1 | x];
				auto r = now * a[y << 1 | x | W];
				b[y | x] = l + r;
				b[y | x | N >> 1] = l - r;
			}
			now *= base;
		}
		swap(a, b);
	}
	c = a;
}

V<mint> multiply_ntt(const V<mint>& a, const V<mint>& b) {
	int A = int(a.size()), B = int(b.size());
	if (!A || !B) return {};
	int lg = 0;
	while ((1 << lg) < A + B - 1) lg++;
	int N = 1 << lg;
	V<mint> ac(N), bc(N);
	for (int i = 0; i < A; i++) ac[i] = a[i];
	for (int i = 0; i < B; i++) bc[i] = b[i];
	ntt(false, ac);
	ntt(false, bc);
	for (int i = 0; i < N; i++) {
		ac[i] *= bc[i];
	}
	ntt(true, ac);
	V<mint> c(A + B - 1);
	mint iN = mint(N).inv();
	for (int i = 0; i < A + B - 1; i++) {
		c[i] = ac[i] * iN;
	}
	return c;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);
	InitFact(1000000);

	int N; cin >> N;
	string s; cin >> s;

	V<mint> f(N),g(N);

	rep(i,N){
		if(s[i] == 'n') f[i] = 1;
		if(s[i] == 'i') g[N-1-i] = 1;
	}
	auto h = multiply_ntt(f,g);
	{
		V<mint> f(N-1);
		rep(i,N-1) f[i] = h[i+N];
		show(f);
		rep(i,N-1) f[i] *= fact[i];
		V<mint> g(N-1);
		rep(i,N-1) g[i] = ifact[N-1-i-1];
		auto h = multiply_ntt(f,g);
		V<mint> res(N-1);
		rep(i,N-1) res[i] = h[N-2+i] * ifact[i];
		ll ans = 0;
		for(auto v: res) ans ^= v.v;
		cout << ans << endl;
	}
}

yukicoder

結果

テストケース

ソースコード