結果

問題 No.1742 Binary Indexed Train
ユーザー noya2noya2
提出日時 2021-11-12 22:56:35
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 2,143 ms / 3,000 ms
コード長 4,103 bytes
コンパイル時間 6,908 ms
コンパイル使用メモリ 272,844 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-08-17 03:23:33
合計ジャッジ時間 31,224 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2,022 ms
4,380 KB
testcase_04 AC 2,025 ms
4,376 KB
testcase_05 AC 2,021 ms
4,376 KB
testcase_06 AC 56 ms
4,376 KB
testcase_07 AC 57 ms
4,376 KB
testcase_08 AC 1,141 ms
4,376 KB
testcase_09 AC 1,141 ms
4,376 KB
testcase_10 AC 1,140 ms
4,380 KB
testcase_11 AC 1,141 ms
4,376 KB
testcase_12 AC 1,143 ms
4,376 KB
testcase_13 AC 2,108 ms
4,376 KB
testcase_14 AC 2,143 ms
4,376 KB
testcase_15 AC 141 ms
4,380 KB
testcase_16 AC 164 ms
4,376 KB
testcase_17 AC 315 ms
4,376 KB
testcase_18 AC 359 ms
4,376 KB
testcase_19 AC 98 ms
4,376 KB
testcase_20 AC 10 ms
4,376 KB
testcase_21 AC 149 ms
4,380 KB
testcase_22 AC 409 ms
4,376 KB
testcase_23 AC 40 ms
4,380 KB
testcase_24 AC 16 ms
4,376 KB
testcase_25 AC 560 ms
4,376 KB
testcase_26 AC 140 ms
4,380 KB
testcase_27 AC 469 ms
4,376 KB
testcase_28 AC 28 ms
4,376 KB
testcase_29 AC 493 ms
4,376 KB
testcase_30 AC 650 ms
4,376 KB
testcase_31 AC 1,846 ms
4,380 KB
testcase_32 AC 633 ms
4,376 KB
testcase_33 AC 219 ms
4,380 KB
testcase_34 AC 1,198 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using bint = mp::cpp_int;
*/
#include <atcoder/all>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define fi first
#define se second
#define endl "\n"
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
const int INF = 1001001007;
const long long mod1 = 1000000007LL;
const long long mod2 = 998244353LL;
const ll inf = 2e18;
const ld pi = 3.14159265358979323;
const ld eps = 1e-7;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<class T>ostream &operator<<(ostream &os,const vector<T> &v){if(v.size()==0){os<<endl;}else{rep(i,v.size())os<<v[i]<<(i+1==v.size()?"\n":" ");}return os;}
template<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}
template<class T>ostream &operator<<(ostream &os,const vector<vector<T>> &v){if(v.size()==0){os<<endl;}else{for(auto &e:v)os<<e;}return os;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void eru(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T>T cel(T a,T b){if(a%b==0)return a/b;return a/b +1;}
template<typename T,typename U>void out2(T a,U b){cout<<a<<" "<<b<<endl;}
template<typename T>void mout(T a){cout<<a.val()<<endl;}
void yes(){cout << "Yes" << endl;}
void no (){cout << "No" << endl;}
void yn (bool t){if(t)yes();else no();}
void dame(bool t){if(t){cout << -1 << endl;exit(0);}}
void dout(ld h=-1.23456789){cout<<setprecision(20);if(abs(h+1.23456789)>eps)cout<<h<<endl;}
void deb(ll h = INF-1) {cout << (h == INF-1 ? "!?" : to_string(h)) << endl;}
void revs(string &s) {reverse(s.begin(),s.end());}
vector<int> dx = {0,1,0,-1};
vector<int> dy = {1,0,-1,0};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string num = "0123456789";

ll gcds(ll a, ll b){
    a = abs(a); b = abs(b);
    if (b == 0) return a;
    ll c = a % b;
    while (c != 0){
        a = b;
        b = c;
        c = a % b;
    }
    return b;
}

ll tentou(vector<ll> ar){
    int n = ar.size();
    set<ll> st;
    rep(i,n) st.insert(ar[i]);
    map<ll,int> mp;
    int ind = 0;
    for (ll x : st){
        mp[x] = ind;
        ind++;
    }
    fenwick_tree<ll> fw(ind);
    ll ans = 0;
    rep(i,n){
        int a = mp[ar[i]];
        ans += i - fw.sum(0,a+1);
        fw.add(a,1);
    }
    return ans;
}

/*
alias g++='g++ -I/mnt/c/Users/Owner/Desktop/ac-library'
*/

struct vs{
    vector<int> to;
};

vector<ll> ni(61,1);

ll calc(ll le, ll ri){
    if (le == ri) return 0LL;
    int l = 0, r = 61;
    while (r - l > 1){
        int m = (l + r) / 2;
        ll aa = cel(le,ni[m]), bb = ri / ni[m];
        if (aa < bb) l = m;
        else r = m;
    }
    ll a = cel(le,ni[l]), b = ri / ni[l];
    return b - a + calc(le,a*ni[l]) + calc(b*ni[l],ri);
}

int main(){
    int n, q; cin >> n >> q;
    rep(i,60) ni[i+1] = ni[i] * 2LL;
    vector<ll> ans(q);
    rep(i,q){
        ll l, r; cin >> l >> r;
        ans[i] = calc(l,r);
    }
    rep(i,q) cout << ans[i] << endl;
}
0