結果
問題 | No.1751 Fortune Nim |
ユーザー |
![]() |
提出日時 | 2021-11-19 22:44:11 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 3,851 bytes |
コンパイル時間 | 1,198 ms |
コンパイル使用メモリ | 115,572 KB |
最終ジャッジ日時 | 2025-01-25 20:39:00 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 30 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <deque>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;template<typename T>vector<vector<T>> vec2d(int n, int m, T v){return vector<vector<T>>(n, vector<T>(m, v));}template<typename T>vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));}template<typename T>void print_vector(vector<T> v, char delimiter=' '){if(v.empty()) {cout << endl;return;}for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}const ll MOD = 998244353;class ModInt{public:ll v;ModInt(ll _v = 0){if(_v < 0) _v = (_v%MOD)+MOD;if(_v >= MOD) _v %= MOD;v = _v;}ModInt operator+(ll n){return ModInt((v+n)%MOD);}ModInt operator-(ll n){return ModInt((v-n+MOD)%MOD);}ModInt operator*(ll n){if(n >= MOD) n %= MOD;return ModInt((v*n)%MOD);}ModInt operator/(ll n){return ModInt((ModInt(n).inv()*v).v%MOD);}void operator+=(ll n){v = (v+n)%MOD;}void operator-=(ll n){v = (v-n+MOD)%MOD;}void operator*=(ll n){v = (v*n+MOD)%MOD;}ModInt operator+(ModInt n){return ModInt((v+n.v)%MOD);}ModInt operator-(ModInt n){return ModInt((v-n.v+MOD)%MOD);}ModInt operator*(ModInt n){return ModInt((v*n.v)%MOD);}ModInt operator/(ModInt n){return ModInt((n.inv()*v).v%MOD);}void operator+=(ModInt n){v = (v+n.v)%MOD;}void operator-=(ModInt n){v = (v-n.v+MOD)%MOD;}void operator*=(ModInt n){v = (v*n.v)%MOD;}void operator=(ModInt n){v = n.v;}bool operator==(ModInt n){return v == n.v;}bool operator!=(ModInt n){return v != n.v;}void operator=(ll n){v = n%MOD;}ModInt inv(){if(v == 1) return ModInt(1);else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);}};ostream& operator<<(ostream& os, const ModInt& m){os << m.v;return os;}istream & operator >> (istream &in, ModInt &m){in >> m.v;return in;}ModInt pow(ModInt a, ll n) {assert(n >= 0);ModInt ans = 1;ModInt tmp = a;for (int i = 0; i <= 60; i++) {ll m = (ll)1 << i;if (m & n) {ans *= tmp;}tmp *= tmp;}return ans;}using mint = ModInt;int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;int n; cin >> n;vector<ll> a(n);for(int i = 0; i < n; i++) cin >> a[i];int xo = 0;for(int x: a) xo ^= x;ll asum = accumulate(a.begin(), a.end(), 0ll);ll steps = 0;if(xo == 0){steps = asum;}else{ll mx = 0;for(int i = 0; i < n; i++){int others = xo^a[i];if(others <= a[i]){chmax(mx, a[i]-others);}}// cout << mx << endl;steps = (asum-mx)+1;}// debug_value(steps);mint ans = mint(2).inv() - mint(2).inv() * pow(mint(3).inv()*(MOD-1), steps);cout << ans << endl;}