結果

問題 No.1968 Distance
ユーザー milanis48663220milanis48663220
提出日時 2022-06-03 22:30:20
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 2,000 ms
コード長 4,569 bytes
コンパイル時間 1,063 ms
コンパイル使用メモリ 117,440 KB
最終ジャッジ日時 2025-01-29 17:51:25
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#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);
}
ModInt &operator+=(ll n){
v = (v+n)%MOD;
return *this;
}
ModInt &operator-=(ll n){
v = (v-n+MOD)%MOD;
return *this;
}
ModInt &operator*=(ll n){
v = (v*n+MOD)%MOD;
return *this;
}
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);
}
ModInt &operator+=(ModInt n){
v = (v+n.v)%MOD;
return *this;
}
ModInt &operator-=(ModInt n){
v = (v-n.v+MOD)%MOD;
return *this;
}
ModInt &operator*=(ModInt n){
v = (v*n.v)%MOD;
return *this;
}
bool operator==(ModInt n){
return v == n.v;
}
bool operator!=(ModInt n){
return v != n.v;
}
ModInt &operator=(ll n){
v = n%MOD;
return *this;
}
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;
while (n > 0) {
if (n&1) ans = ans*a;
a = a*a;
n >>= 1;
}
return ans;
}
using mint = ModInt;
// using mint = double;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
ll n; cin >> n;
auto f = [&](int a){
return pow(mint(2), a)/(pow(mint(2), a)+1);
};
mint ans = 0;
for(int a = 0; ;a++){
ll x = (1ll<<a)-1;
mint l = f(a);
mint r = f(a+1);
if(x >= n){
mint c = (mint(1)-mint(l))/2;
mint p = (mint(1)-f(a))*2;
// cout << l << ' ' << 1 << ' ' << p << endl;
ans += c*p;
break;
}
ll rem = n;
int pl = a, pr = 0;
ll cl = 1, cr = 1;
while(rem){
if(pl >= pr){
rem -= min(rem, cl);
cl *= 2;
pl--;
}else{
rem -= min(rem, cr);
cr *= 2;
pr--;
}
}
mint ave_l = (l+r)/2;
mint ave_r = mint(1)-ave_l;
mint p = (r-l)*2;
// cout << l << ' ' << r << ' ' << p << endl;
// debug_value(ave_l)
// debug_value(ave_r)
// cout << pl << ' ' << pr << endl;
if(pl >= pr){
mint x = ave_r/pow(mint(2), -pr);
ans += p*x;
}else{
mint x = ave_l/pow(mint(2), a-pl);
ans += p*x;
}
}
cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0