結果
問題 | No.2237 Xor Sum Hoge |
ユーザー |
![]() |
提出日時 | 2023-03-03 22:06:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 505 ms / 10,000 ms |
コード長 | 1,976 bytes |
コンパイル時間 | 2,469 ms |
コンパイル使用メモリ | 225,684 KB |
最終ジャッジ日時 | 2025-02-11 02:46:29 |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
コンパイルメッセージ
main.cpp:49:6: warning: ‘{anonymous}::mint {anonymous}::perm(int, int)’ defined but not used [-Wunused-function] 49 | mint perm(int n, int k) { | ^~~~ main.cpp:48:6: warning: ‘{anonymous}::mint {anonymous}::fact(int)’ defined but not used [-Wunused-function] 48 | mint fact(int n) {return Fact[n];} | ^~~~ main.cpp:44:6: warning: ‘{anonymous}::mint {anonymous}::icomb(int, int)’ defined but not used [-Wunused-function] 44 | mint icomb(int n, int k) { | ^~~~~
ソースコード
#include<bits/stdc++.h>namespace {#pragma GCC diagnostic ignored "-Wunused-function"#include<atcoder/all>#pragma GCC diagnostic warning "-Wunused-function"using namespace std;using namespace atcoder;#define rep(i,n) for(int i = 0; i < (int)(n); i++)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }using ll = long long;using P = pair<int,int>;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<ll>;using VVL = vector<VL>;using mint = modint998244353;constexpr int FACT_SIZE = 1000000;mint Fact[FACT_SIZE + 1];mint iFact[FACT_SIZE + 1];const auto fact_init = [] {Fact[0] = mint::raw(1);for(int i = 1; i <= FACT_SIZE; ++i) {Fact[i] = Fact[i-1] * i;}iFact[FACT_SIZE] = Fact[FACT_SIZE].inv();for(int i = FACT_SIZE; i; --i) {iFact[i-1] = iFact[i] * i;}return false;}();mint comb(int n, int k) {if (k == 0) return mint::raw(1);assert(n >= 0 && k >= 0);if (k > n) return mint::raw(0);return Fact[n] * iFact[n - k] * iFact[k];}mint icomb(int n, int k) {return iFact[n] * Fact[n - k] * Fact[k];}mint fact(int n) {return Fact[n];}mint perm(int n, int k) {assert(0 <= n);return Fact[n] * iFact[n - k];}} int main() {ios::sync_with_stdio(false);cin.tie(0);int n;ll b, c;cin >> n >> b >> c;vector<mint> f(n + 1);f[0] = 1;rep(_, 60) {int x = b & 1, y = c & 1;b >>= 1, c >>= 1;vector<mint> g(n + 1);rep(i, n + 1) if (i % 2 == y) g[i] = comb(n, i);rep(i, n + 1) if (i % 2 != (x ^ y)) f[i] = 0;auto h = convolution(f, g);f.assign(n + 1, 0);rep(i, 2 * n + 1) f[i / 2] += h[i];}cout << f[0].val() << '\n';}