結果
| 問題 | No.1742 Binary Indexed Train |
| ユーザー |
 srtubaki
|
| 提出日時 | 2021-11-12 22:48:11 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 43 ms / 3,000 ms |
| コード長 | 6,275 bytes |
| コンパイル時間 | 1,919 ms |
| コンパイル使用メモリ | 196,932 KB |
| 最終ジャッジ日時 | 2025-01-25 17:15:42 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 32 |
ソースコード
#pragma region template
#include <bits/stdc++.h>
using namespace std;
// clang-format off
using ll = long long; using vl = vector<ll>; using vvl = vector<vl>;
using ld = long double; using vld = vector<ld>; using vvld = vector<vld>;
using pll = pair<ll, ll>; using vpll = vector<pll>; using vvpll = vector<vpll>;
template <class T> using V = vector<T>; template <class T> using VV = vector<V<T>>;
template <class T> using VVV = vector<VV<T>>;
using vb = vector<bool>;
using vs = vector<string>;
using mll = map<ll, ll>;
using msl = map<string, ll>;
template<class T> using heap = priority_queue<T>;
template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;
constexpr ll inf = 3001001000100100100LL;
constexpr int inf_int = 1000000009;
#define endl '\n'
#define _overload(_1, _2, _3, name, ...) name
#define rep(...) _overload(__VA_ARGS__, _rep, _rep2,)(__VA_ARGS__)
#define repc(...) _overload(__VA_ARGS__, _repc, _repc2,)(__VA_ARGS__)
#define repr(...) _overload(__VA_ARGS__, _repr, _repr2,)(__VA_ARGS__)
#define reprc(...) _overload(__VA_ARGS__, _reprc, _reprc2,)(__VA_ARGS__)
#define _rep(i,k,n) for(ll i=(k) , i##_xxxx=(n); i < i##_xxxx; ++i)
#define _repc(i,k,n) for(ll i=(k) , i##_xxxx=(n); i <=i##_xxxx; ++i)
#define _repr(i,k,n) for(ll i=(n)-1, i##_xxxx=(k); i >=i##_xxxx; --i)
#define _reprc(i,k,n) for(ll i=(n) , i##_xxxx=(k); i >=i##_xxxx; --i)
#define _rep2(i,n) _rep(i,0,n)
#define _repc2(i,n) _repc(i,1,n)
#define _repr2(i,n) _repr(i,0,n)
#define _reprc2(i,n) _reprc(i,1,n)
#define rall(o) rbegin(o), rend(o)
#define all(o) begin(o), end(o)
template <class C> ll sz(const C& c) { return static_cast<ll>(c.size()); }
template <class T> bool chmax(T& m, const T& v){ if (m < v){ m = v; return true; } return false; }
template <class T> bool chmin(T& m, const T& v){ if (v < m){ m = v; return true; } return false; }
template <class T> T udiv(const T& a, const T& b){ return (a + b - 1) / b; }
template <class T> T rdiv(const T& a, const T& b){ return (a + b / 2) / b; }
template <class T, class S> string join(const T& v, const S& sep ){ stringstream ss; bool f = false; for (const auto& e : v){ if (f) ss << sep; f = true; ss << e;} return ss.str(); }
template <class T, class S, class... U> string join(const T& v, const S& sep, const U& ...args){ stringstream ss; bool f = false; for (const auto& c : v){ if (f) ss << sep; f = true; ss << join(c, args...); } return ss.str(); }
template <class T> ostream& operator<<(ostream& os, const vector<T>& seq){ os << '[' << join(seq, ",") << ']'; return os; } template <class T> ostream& operator<<(ostream& os, const vector<vector<T>>& seq){ os << '[' << join(seq, ",\n ") << ']'; return os; }
template <class T> ostream& operator<<(ostream& os, const deque<T>& seq){ os << '[' << join(seq, ",") << ']'; return os; }
template <class T> ostream& operator<<(ostream& os, const set<T>& seq){ os << '{' << join(seq, ",") << '}'; return os; }
template <class T , class TH> ostream& operator<<(ostream& os, const unordered_set<T, TH>& seq){ os << '{' << join(seq, ",") << '}'; return os; }
template <class TK, class TV> ostream& operator<<(ostream& os, const map<TK, TV>& seq){ os << '{'; bool f = false; for (const auto& e : seq){ if (f) os << ','; f = true; os << e.first << ":" << e.second; } os << '}'; return os; }
template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& pa){ os << '(' << pa.first << ',' << pa.second << ')'; return os; }
#if LOCAL
#define debug(...) _debug(__VA_ARGS__, __LINE__)
#else
#define debug(...)
#endif
void print() { std::cout << '\n'; }
template <class S> void print(const S& a){ std::cout << a << '\n'; }
template <class S> void _debug(const S& a){ std::cerr << "(L:" << std::setw(3) << a << ")\n"; }
template <class S, class... T> void print(const S& a, const T&... args){ std::cout << a << ' '; print(args...); }
template <class S, class... T> void _debug(const S& a, const T&... args){ std::cerr << a << ' '; _debug(args...); }
struct setup_main { setup_main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cout << fixed << setprecision(15); } } setup_main_;
struct bll {
ll v;
bll(ll v_=0): v(v_){}
struct ref {
bll &b; const ll msk;
ref(bll &b_, ll pos) : b(b_), msk(1LL << pos) {}
operator bool() const { return b.v&msk; }
ref &operator=(bool x) { if(x) b.v|=msk; else b.v&=~msk; return *this; }
};
bll& operator++() { ++v; return *this; }
bll operator++(int) { bll tmp(*this); ++*this; return tmp; }
ref operator[](ll pos) { return ref(*this,pos); }
bool operator[](ll pos) const { return (v>>pos)&1; }
bll& on (ll l, ll r) { v|= rangemask(l, r); return *this; }
bll& off (ll l, ll r) { v&=~rangemask(l, r); return *this; }
bll& flip (ll l, ll r) { v^= rangemask(l, r); return *this; }
bll& next_combination() {
ll a = v&-v, b = a+v;
v = ((v & ~b) / (a<<1)) | b;
return *this;
}
static ll rangemask(ll l, ll r) { return (1LL<<r)-(1LL<<l); }
ll msbit() const {
ll o=63, x=-1;
while(o - x != 1){
ll m = (o+x) / 2;
if (v < (1LL<<m)) o = m; else x = m;
}
return x;
}
ll lsbit() const { return bll(lsb()).msbit(); }
ll msb() const { ll pos=msbit(); return (pos<0) ? 0LL : 1LL<<pos; }
ll lsb() const { return v&-v; }
ll count() const { return __builtin_popcountll(v); }
vl idxes() const {
vl vec;
for(ll i=0,t=v; t; t>>=1,i++) if(t&1) vec.push_back(i);
return vec;
}
};
// clang-format on
#pragma endregion
void solve(ll N, int Q, vector<ll>& S, vector<ll>& T) {
rep(i, Q) {
ll cnt = 0;
bll b = S[i];
ll lsb = b.lsb();
while (b.v + lsb <= T[i] and S[i] != 0) {
b.v += lsb;
lsb = b.lsb();
cnt++;
}
print(cnt + bll(T[i] - b.v).count());
}
}
int main() {
int N;
int Q;
cin >> N >> Q;
vector<ll> S(Q), T(Q);
rep(i, Q) {
cin >> S[i] >> T[i];
}
solve(N, Q, S, T);
}