結果
| 問題 | No.2237 Xor Sum Hoge |
| ユーザー |
 leaf_1415
|
| 提出日時 | 2023-03-03 22:42:35 |
| 言語 | C++11 (gcc 11.4.0) |
| 結果 |
AC
|
| 実行時間 | 1,669 ms / 10,000 ms |
| コード長 | 10,356 bytes |
| コンパイル時間 | 1,610 ms |
| コンパイル使用メモリ | 115,148 KB |
| 実行使用メモリ | 22,388 KB |
| 最終ジャッジ日時 | 2024-09-17 23:46:38 |
| 合計ジャッジ時間 | 32,932 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1,669 ms
22,280 KB |
| testcase_01 | AC | 14 ms
19,088 KB |
| testcase_02 | AC | 11 ms
19,096 KB |
| testcase_03 | AC | 16 ms
19,148 KB |
| testcase_04 | AC | 15 ms
19,148 KB |
| testcase_05 | AC | 27 ms
19,240 KB |
| testcase_06 | AC | 17 ms
19,200 KB |
| testcase_07 | AC | 16 ms
19,120 KB |
| testcase_08 | AC | 25 ms
19,132 KB |
| testcase_09 | AC | 24 ms
19,192 KB |
| testcase_10 | AC | 22 ms
19,200 KB |
| testcase_11 | AC | 358 ms
19,896 KB |
| testcase_12 | AC | 764 ms
20,736 KB |
| testcase_13 | AC | 1,618 ms
22,312 KB |
| testcase_14 | AC | 774 ms
20,860 KB |
| testcase_15 | AC | 377 ms
19,824 KB |
| testcase_16 | AC | 1,625 ms
22,064 KB |
| testcase_17 | AC | 1,616 ms
21,944 KB |
| testcase_18 | AC | 801 ms
20,712 KB |
| testcase_19 | AC | 778 ms
20,468 KB |
| testcase_20 | AC | 1,648 ms
21,824 KB |
| testcase_21 | AC | 1,642 ms
22,344 KB |
| testcase_22 | AC | 1,625 ms
22,304 KB |
| testcase_23 | AC | 1,610 ms
22,268 KB |
| testcase_24 | AC | 1,622 ms
22,388 KB |
| testcase_25 | AC | 1,631 ms
22,180 KB |
| testcase_26 | AC | 1,659 ms
22,192 KB |
| testcase_27 | AC | 1,622 ms
22,224 KB |
| testcase_28 | AC | 1,654 ms
22,328 KB |
| testcase_29 | AC | 1,622 ms
22,304 KB |
| testcase_30 | AC | 1,622 ms
22,276 KB |
| testcase_31 | AC | 8 ms
19,072 KB |
| testcase_32 | AC | 9 ms
19,072 KB |
| testcase_33 | AC | 24 ms
19,172 KB |
| testcase_34 | AC | 8 ms
19,072 KB |
ソースコード
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <array>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(ll x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(ll x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(ll x = 0; (x) < (ll)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define pb push_back
#define fi first
#define se second
#define inf 2e18
#define eps 1e-9
const double PI = 3.1415926535897932384626433;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
struct edge{
ll to, cost;
edge(){}
edge(ll a, ll b){ to = a, cost = b;}
};
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
//const int mod = 1000000007;
const int mod = 998244353;
struct mint{
int x;
mint(ll y = 0){if(y < 0 || y >= mod) y = (y%mod+mod)%mod; x = y;}
mint(const mint &ope) {x = ope.x;}
mint operator-(){return mint(-x);}
mint operator+(const mint &ope){return mint(x) += ope;}
mint operator-(const mint &ope){return mint(x) -= ope;}
mint operator*(const mint &ope){return mint(x) *= ope;}
mint operator/(const mint &ope){return mint(x) /= ope;}
mint& operator+=(const mint &ope){x += ope.x; if(x >= mod) x -= mod; return *this;}
mint& operator-=(const mint &ope){x += mod - ope.x; if(x >= mod) x -= mod; return *this;}
mint& operator*=(const mint &ope){ll tmp = x; tmp *= ope.x, tmp %= mod; x = tmp; return *this;}
mint& operator/=(const mint &ope){
ll n = mod-2; mint mul = ope;
while(n){if(n & 1) *this *= mul; mul *= mul; n >>= 1;}
return *this;
}
mint inverse(){return mint(1) / *this;}
bool operator ==(const mint &ope){return x == ope.x;}
bool operator !=(const mint &ope){return x != ope.x;}
bool operator <(const mint &ope)const{return x < ope.x;}
};
mint modpow(mint a, ll n){
if(n == 0) return mint(1);
if(n % 2) return a * modpow(a, n-1);
else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){ll t; is >> t, ope = mint(t); return is;}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}
ll modpow(ll a, ll n, ll mod){
if(n == 0) return 1;
if(n % 2) return ((a%mod) * (modpow(a, n-1, mod)%mod)) % mod;
else return modpow((a*a)%mod, n/2, mod) % mod;
}
vector<mint> fact, fact_inv;
void make_fact(int n){
fact.resize(n+1), fact_inv.resize(n+1);
fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(int n, int k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(int n, int k){ return comb(n, k) * fact[k]; }
mint divide(int n, int k){ return comb(n+k-1, k-1); }
template<typename T> T comb2(ll n, ll k){ if(n < 0 || k < 0 || n < k) return T(0); T ret = 1; rep(i, 1, k) ret *= n-k+i, ret /= i; return ret;}
vector<ll> prime, pvec, qrime;
void make_prime(int n){
prime.resize(n+1);
rep(i, 2, n){
if(prime[i] == 0) pvec.push_back(i), prime[i] = i;
for(auto p : pvec){ if(i*p > n || p > prime[i]) break; prime[i*p] = p;}
}
}
void make_qrime(int n){
qrime.resize(n+1);
rep(i, 2, n){int ni = i / prime[i]; if(prime[i] == prime[ni]) qrime[i] = qrime[ni] * prime[i]; else qrime[i] = prime[i];}
}
void factorize(ll n, map<ll, ll> &mp){
mp.clear();
for(auto p : pvec) while(n % p == 0) mp[p]++, n /= p;
if(n > 1) mp[n]++;
}
bool exceed(ll x, ll y, ll m){return y > 0 && x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll floor(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return a/b; else return -((-a+b-1)/b); }
ll ceil(ll a, ll b){ if(b < 0) a *= -1, b *= -1; if(a >= 0) return (a+b-1)/b; else return -((-a)/b); }
ll modulo(ll a, ll b){ b = abs(b); return a - floor(a, b) * b;}
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
template<typename T> T arith(T x){return x*(x+1)/2;}
template<typename T> T arith2(T x){return x*(x+1)*(x*2+1)/6;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x, ll b = 10){if(x == 0) return "0"; string ret; for(;x;x/=b) ret += x % b + '0'; reverse(all(ret)); return ret;}
ll stoll(string &s, ll b = 10){ll ret = 0; for(auto c : s) ret *= b, ret += c - '0'; return ret;}
template<typename T> void uniq(T &vec){sort(all(vec)); vec.erase(unique(all(vec)), vec.end());}
int popcount(ull x){
x -= ((x>>1)&0x5555555555555555ULL), x = (x & 0x3333333333333333ULL) + ((x>>2) & 0x3333333333333333ULL);
return (((x + (x>>4)) & 0x0F0F0F0F0F0F0F0FULL) * 0x0101010101010101ULL) >> 56;
}
template<class S, class T> pair<S, T>& operator+=(pair<S, T> &s, const pair<S, T> &t){s.first += t.first, s.second += t.second; return s;}
template<class S, class T> pair<S, T>& operator-=(pair<S, T> &s, const pair<S, T> &t){s.first -= t.first, s.second -= t.second; return s;}
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t){return pair<S,T>(s.first-t.first, s.second-t.second);}
template<class T> T dot(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.first + s.second*t.second;}
template<class T> T cross(const pair<T, T> &s, const pair<T, T> &t){return s.first*t.second - s.second*t.first;}
template<class T> T mdist(pair<T, T> s, pair<T, T> t){return abs(s.first-t.first) + abs(s.second-t.second);}
template<class T> T cdist(pair<T, T> s, pair<T, T> t){return max(abs(s.first-t.first), abs(s.second-t.second));}
template<class T> T edist2(pair<T, T> s, pair<T, T> t){return (s.first-t.first)*(s.first-t.first) + (s.second-t.second)*(s.second-t.second);}
template<typename T> ostream& operator << (ostream& os, vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const vector<T>& vec){reps(i, vec) os << vec[i] << " "; return os;}
template<typename T> ostream& operator << (ostream& os, list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, const list<T>& ls){for(auto x : ls) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, deque<T>& deq){reps(i, deq) os << deq[i] << " "; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U>& ope){ os << "(" << ope.first << ", " << ope.second << ")"; return os;}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& ope){ for(auto p : ope) os << "(" << p.first << ", " << p.second << "),";return os;}
template<typename T> ostream& operator << (ostream& os, set<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> ostream& operator << (ostream& os, multiset<T>& ope){for(auto x : ope) os << x << " "; return os;}
template<typename T> void outa(T a[], ll s, ll t){rep(i, s, t){ cout << a[i]; if(i < t) cout << " ";} cout << endl;}
template<typename T, size_t N> ostream& operator << (ostream& os, array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
template<typename T, size_t N> ostream& operator << (ostream& os, const array<T, N>& arr){reps(i, arr) os << arr[i] << " "; return os;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail){cout << head; if(sizeof...(Tail) > 0) cout << " "; dump_func(std::move(tail)...);}
template<typename T> void bssert(bool b, T t){ if(!b) cout << t << endl, exit(0); }
struct NTT_Convolution{
NTT_Convolution(){};
static int rev(int x, int n){
int ret = 0;
for(int i = 0; i < n; i++) ret <<= 1, ret |= (x>>i) & 1;
return ret;
}
static void DFT(vector<mint> &f, vector<mint> &F, int n, mint root, bool inv = false)
{
int N = 1<<n;
F.resize(N);
for(int i = 0; i < N; i++) F[rev(i, n)] = f[i];
if(inv) root = root.inverse();
mint a, b, x, z;
for(int i = 0; i < n; i++){
int l = 1<<i;
z = modpow(root, 1<<(n-(i+1)));
for(int j = 0; j < N; j+=l*2){
x = 1;
for(int k = j; k < j+l; k++){
a = F[k], b = F[k+l] * x;
F[k] = a + b, F[k+l] = a - b, x *= z;
}
}
}
if(inv){
mint Ninv = mint(N).inverse();
for(int i = 0; i < N; i++) F[i] *= Ninv;
}
}
static void conv(vector<mint> f, vector<mint> g, vector<mint> &dest)
{
ll logf = 0, logg = 0, len = f.size() + g.size();
for(int i = f.size(); i; i /= 2) logf++;
for(int i = g.size(); i; i /= 2) logg++;
ll n = max(logf, logg)+1, N = 1<<n;
f.resize(N), g.resize(N);
mint root = modpow(mint(3), 119 * (1<<(23-n)));
vector<mint> F, G;
DFT(f, F, n, root), DFT(g, G, n, root);
for(int i = 0; i < N; i++) F[i] *= G[i];
DFT(F, f, n, root, true);
f.resize(len-1);
dest = f;
}
};
ll n, b, c;
mint dp[65][60005];
int main(void)
{
ios::sync_with_stdio(0);
cin.tie(0);
make_fact(100005);
cin >> n >> b >> c;
vector<mint> gvec[2];
gvec[0].resize(n+1), gvec[1].resize(n+1);
rep(i, 0, n) gvec[i%2][i] = comb(n, i);
cin >> n >> b >> c;
dp[0][0] = 1;
rep(i, 0, 61){
vector<mint> fvec(n+1), hvec;
ll bb = (b>>i)&1, cc = (c>>i)&1;
rep(j, 0, n) if(j%2 == (bb^cc)) fvec[j] = dp[i][j];
NTT_Convolution::conv(fvec, gvec[cc], hvec);
reps(j, hvec){
if(j/2 > n) break;
dp[i+1][j/2] += hvec[j];
}
//outa(dp[i], 0, n);
}
outl(dp[62][0]);
return 0;
}