/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 2ms 520.0 KiB
#4 Accepted 1ms 352.0 KiB
#5 Accepted 2ms 540.0 KiB
#6 Accepted 5ms 540.0 KiB
#7 Accepted 38ms 1.77 MiB
#8 Accepted 33ms 1.559 MiB
#9 Accepted 36ms 1.793 MiB
#10 Accepted 32ms 2.27 MiB
#11 Accepted 41ms 2.035 MiB

Code

#include <bits/stdc++.h>
#define endl '\n'
#define F first
#define S second
using namespace std;
#define ll long long
#define pb push_back
#define mod 1000000007
#define int long long
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define CheckBit(x,k)   (x & (1LL << k))
#define SetBit(x,k)     (x |= (1LL << k))
#define ClearBit(x,k)   (x &= ~(1LL << k))
#define LSB(mask)       __builtin_ctzll(mask)
#define MSB(mask)       63-__builtin_clzll(mask) 
#define print(x)    cout << #x << " : " << x << endl
#define error1(x)   cerr << #x << " = " << (x) <<endl
#define coutall(v)  for(auto &it: v) cout<<it<<' '; cout<<endl
#define Abid_52     ios::sync_with_stdio(false);cin.tie(0),cin.tie(0)
#define error2(a,b) cerr<<"( "<<#a<<" , "<<#b<<" ) = ( "<<(a)<<" , "<<(b)<<" )\n"
#define UNIQUE(x)   sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T, typename U> T ceil(T x, U y) {return (x > 0 ? (x + y - 1) / y : x / y);}
template <typename T, typename U> T floor(T x, U y) {return (x > 0 ? x / y : (x - y + 1) / y);}

const int N = 2e5 + 10;

void solve()
{
    int n, m;
    cin >> n >> m;
    ll l = 0, r = m / n, ans = 0;
    while(l <= r){
        ll m1 = l + (r - l) / 3;
        ll m2 = r - (r - l) / 3;

        ll fm1 = m1 * (m - (n * m1));
        ll fm2 = m2 * (m - (n * m2));

        if(fm1 < fm2){
            l = m1 + 1;
            ans = fm1;
        }
        else if(fm1 > fm2){
            r = m2 - 1;
            ans = fm2;
        }
        else{
            l = m1 + 1;
            r = m2 - 1;
            ans = fm1;
        }
    }
    cout << ans << endl;
}

int32_t main()
{
    Abid_52;
    int t = 1;
    cin >> t;
    for (int tc = 1; tc <= t; ++tc)
    {
        // cout << "Case " << tc << ": ";
        solve();
    }
}

Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-08 19:16:26
Judged At
2024-09-08 19:16:26
Judged By
Score
100
Total Time
41ms
Peak Memory
2.27 MiB