結果
問題 | No.2206 Popcount Sum 2 |
ユーザー |
|
提出日時 | 2023-02-04 06:23:21 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3,762 ms / 4,000 ms |
コード長 | 5,916 bytes |
コンパイル時間 | 4,941 ms |
コンパイル使用メモリ | 243,872 KB |
実行使用メモリ | 86,944 KB |
最終ジャッジ日時 | 2024-07-03 04:40:24 |
合計ジャッジ時間 | 31,803 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 18 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,b) for(int i=0;i<b;i++)#define rrep(i,b) for(int i=b-1;i>=0;i--)#define rep1(i,b) for(int i=1;i<b;i++)#define repx(i,x,b) for(int i=x;i<b;i++)#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)#define fore(i,a) for(auto i:a)#define fore1(i,a) for(auto &i:a)#define rng(x) (x).begin(), (x).end()#define rrng(x) (x).rbegin(), (x).rend()#define sz(x) ((int)(x).size())#define pb push_back#define fi first#define se second#define pcnt __builtin_popcountllusing namespace std;using namespace atcoder;using ll = long long;using ld = long double;template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}#define dame { cout << "No" << endl; return;}#define dame1 { cout << -1 << endl; return;}#define cout2(x,y) cout << x << " " << y << endl;#define coutp(p) cout << p.fi << " " << p.se << endl;#define out cout << ans << endl;#define outd cout << fixed << setprecision(20) << ans << endl;#define outm cout << ans.val() << endl;#define outv fore(yans , ans) cout << yans << "\n";#define outdv fore(yans , ans) cout << yans.val() << "\n";#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define coutv2(v) fore(vy , v) cout << vy << "\n";#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;using tp = tuple<int ,int ,int>;using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;using mint = modint998244353;//using mint = modint1000000007;//using mint = dynamic_modint<0>;using vm = vector<mint>;using vvm = vector<vector<mint>>;vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}#define yes {cout <<"Yes"<<endl;}#define yesr { cout <<"Yes"<<endl; return;}#define no {cout <<"No"<<endl;}#define nor { cout <<"No"<<endl; return;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#ifdef MY_LOCAL_DEBUG#define show(x) cerr<<#x<<" = "<<x<<endl#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl#define test(x) cout << "test" << x << endl#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define showv2(v) fore(vy , v) cout << vy << "\n";#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";#else#define show(x)#define showp(p)#define show2(x,y)#define show3(x,y,z)#define show4(x,y,z,x2)#define test(x)#define showv(v)#define showv2(v)#define showvm(v)#define showvm2(v)#endifstruct combination {vector<mint> fact, ifact;combination(int n):fact(n+1),ifact(n+1) {fact[0] = 1;for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;ifact[n] = fact[n].inv();for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;}mint operator()(int n, int k) {if (k < 0 || k > n) return 0;return fact[n]*ifact[k]*ifact[n-k];}} com(10000005);struct state{int l,r,i;state(int l=0,int r=0,int i=0) : l(l),r(r),i(i) {}bool operator<(state const &ot) const{return r < ot.r;}};void solve(){int q; cin>>q;const int n = (int)2e5 + 1;vm ans(q);ll D = ceill((long double)n/sqrtl((long double)q));int maxc = n/D;vector<vector<state>> pock(maxc+1);vm res(q);rep(i,q){int l,r; cin>>r>>l;l--; r--;pock[l/D].pb(state(l,r,i));res[i] = (mint(2).pow(r+1)-1);}mint now=0;auto add = [&](int l,int r,int type) -> pii{if (type == 0){now -= com(r,l);l--;}else{now = now*2 - com(r,l);r++;}return {l,r};};auto del = [&](int l,int r,int type) -> pii{if (type == 0){now += com(r,l+1);l++;}else{now = (now + com(r-1,l)) / 2;r--;}return {l,r};};auto to = [&](int stl,int str,int gol,int gor){int x = gol - stl;int y = gor - str;while(x != 0 || y != 0){if (y > 0){pii p = add(stl,str,1);stl = p.fi;str = p.se;y--;}else if (y < 0){pii p = del(stl,str,1);stl = p.fi;str = p.se;y++;}if (x > 0){pii p = del(stl,str,0);stl = p.fi;str = p.se;x--;}else if(x < 0){pii p = add(stl,str,0);stl = p.fi;str = p.se;x++;}}};int l=0,r=0;now = 1;rep(i,maxc+1){if (i%2 == 0){sort(rng(pock[i]));}else{sort(rrng(pock[i]));}fore(y , pock[i]){to(l,r,y.l,y.r);ans[y.i] = now;l = y.l;r = y.r;}}rep(i,q){ans[i] *= res[i];}fore(y , ans) printf("%d\n",y.val());return;}int main(){ios::sync_with_stdio(false);cin.tie(0);int t = 1;// cin>>t;rep(i,t){solve();}return 0;}