結果

問題 No.2206 Popcount Sum 2
コンテスト
ユーザー vjudge1
提出日時 2026-05-14 16:53:22
言語 C++23
(gcc 15.2.0 + boost 1.89.0)
コンパイル:
g++-15 -O2 -lm -std=c++23 -Wuninitialized -DONLINE_JUDGE -o a.out _filename_
実行:
./a.out
結果
TLE  
実行時間 -
コード長 2,716 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 2,772 ms
コンパイル使用メモリ 349,252 KB
実行使用メモリ 25,472 KB
最終ジャッジ日時 2026-05-14 16:53:58
合計ジャッジ時間 10,127 ms
ジャッジサーバーID
（参考情報） 		judge1_1 / judge2_1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 4 TLE * 1 -- * 13
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'void init(i64)':
main.cpp:29:14: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   29 |         rep (i, 1, n) fac[i] = fac[i - 1] * i % mod, ifac[i] = qpow(fac[i], mod - 2), sc[i] = sc[i - 1] + qpow(2, i), sc[i] %= mod;
      |              ^
main.cpp:3:40: note: in definition of macro 'rep'
    3 | #define rep(i, j, k) for (register int i = j; i <= k; ++i)
      |                                        ^
main.cpp: In constructor 'split<T>::split(i64, T, i64)':
main.cpp:51:22: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   51 |                 rep (i, 1, n) {
      |                      ^
main.cpp:3:40: note: in definition of macro 'rep'
    3 | #define rep(i, j, k) for (register int i = j; i <= k; ++i)
      |                                        ^
main.cpp: At global scope:
main.cpp:73:8: warning: first argument of 'int main(i64, char**)' should be 'int' [-Wmain]
   73 | signed main(int argc, char* argv[]) {
      |        ^~~~
main.cpp: In function 'int main(i64, char**)':
main.cpp:82:14: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   82 |         rep (i, 1, q) {
      |              ^
main.cpp:3:40: note: in definition of macro 'rep'
    3 | #define rep(i, j, k) for (register int i = j; i <= k; ++i)
      |                                        ^
main.cpp:96:14: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   96 |         rep (i, 1, q) cout << ans[i] << '\n';
      |              ^
main.cpp:3:40: note: in definition of macro 'rep'
    3 | #define rep(i, j, k) for (register int i = j; i <= k; ++i)
      |                                        ^
main.cpp: In instantiation of 'split<T>::split(i64, T, i64) [with T = std::array<long long int, 3>; i64 = long long int]':
main.cpp:81:30:   required from here
   81 |         split<array<int, 3>> s(q + 1);
      |

ソースコード

diff #
raw source code 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, j, k) for (register int i = j; i <= k; ++i)
#define per(i, j, k) for (register int i = j; i >= k; --i)
#define sz(x) (int)x.size()
const long long mod = 998244353;
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using pii = pair<int, int>;
using pll = pair<i64, i64>;
#define int i64
mt19937_64 rng((u64)random_device {}() << 32 ^ random_device {}() ^ chrono::high_resolution_clock::now().time_since_epoch().count());
template<class T = i64,class T2>T rnd(T l,T2 r) {
	return uniform_int_distribution<T>(l,r)(rng);
}

const int N = 2e5 + 10;

i64 fac[N], ifac[N], sc[N];

i64 qpow(i64 a, int b, i64 res = 1) {
	for (; b > 0; b >>= 1, a = a * a % mod) if (b & 1) res = res * a % mod;
	return res;
}

void init(int n = 2e5) {
	fac[0] = ifac[0] = sc[0] = 1;
	rep (i, 1, n) fac[i] = fac[i - 1] * i % mod, ifac[i] = qpow(fac[i], mod - 2), sc[i] = sc[i - 1] + qpow(2, i), sc[i] %= mod;
}

i64 comb(int n, int k) {
	if (k > n || n < 0 || k < 0) return 0;
	return fac[n] * ifac[k] % mod * ifac[n - k] % mod;
}
int ans[N];
template <typename T> class split {
public:
//private:
	vector<T> a;
	vector<int> l, r, col;
	int n, B;
	T operator [](int i) const {return a[i];}
	int getid(int i) {return col[i];}
	int lft(int i) {return l[i];}
	int rig(int i) {return r[i];}
	split(int _n, T x = T(), int _B = 0) {
		a.resize(_n + 1, x); n = _n; col.resize(n + 1), l.resize(n + 1), r.resize(n + 1);
		if (_B == 0) _B = max((i64)sqrtl(_n), 1LL);
		B = _B;
		rep (i, 1, n) {
			col[i] = (i - 1) / B + 1;
			if (!l[col[i]]) l[i] = i;
			r[col[i]] = i;
		}
	}
	void insert(int i, T x) {
		a[i] = x;
	}
	bool cmp(T x, T y) {
		if (col[x[0]] != col[y[0]]) return col[x[0]] < col[y[0]];
		return x[1] < y[1];
	}
	void sort() {
		sort(a.begin() + 1, a.begin() + n + 1, cmp);
	}
};

int norm(int p) {
	p = (p % mod + mod) % mod; return p;
}

signed main(int argc, char* argv[]) {
//	freopen(".in", "r", stdin);
//	freopen(".out", "w", stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	init();
	int q; cin >> q;
	split<array<int, 3>> s(q + 1);
	rep (i, 1, q) {
		int x, y; cin >> x >> y;
		s.insert(i, (array<int, 3>){y - 1, x - 1, i});
	}
	sort(s.a.begin() + 1, s.a.begin() + q + 1); int inv = qpow(2, mod - 2);
	for (int i = 1, l = 0, r = 1, res = 1; i <= q; ++i) {
		int x = s[i][0], y = s[i][1];
	//	cout << x << ' ' << y << '\n';
		while (l > x) res = norm(res - comb(r, l)), l--;
		while (l < x) l++, res = norm(res + comb(r, l));
		while (r > y) r--, res = (res + comb(r, l)) % mod * inv % mod;
		while (r < y) res = norm(res * 2 - comb(r, l)), r++;
		ans[s[i][2]] = res * sc[y] % mod;
	}
	rep (i, 1, q) cout << ans[i] << '\n';
}
0