結果
| 問題 |
No.1504 ヌメロニム
|
| コンテスト | |
| ユーザー |
 sigma425
|
| 提出日時 | 2021-05-08 04:00:13 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 311 ms / 2,000 ms |
| コード長 | 5,908 bytes |
| コンパイル時間 | 1,986 ms |
| コンパイル使用メモリ | 204,416 KB |
| 最終ジャッジ日時 | 2025-01-21 09:08:09 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 61 |
ソースコード
#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;
}
}