/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 2ms 324.0 KiB
#4 Wrong Answer 2ms 524.0 KiB
#5 Wrong Answer 2ms 348.0 KiB
#6 Wrong Answer 5ms 536.0 KiB
#7 Wrong Answer 32ms 1.973 MiB
#8 Wrong Answer 29ms 1.676 MiB
#9 Wrong Answer 30ms 1.816 MiB
#10 Accepted 33ms 2.195 MiB
#11 Wrong Answer 32ms 2.047 MiB

Code

/* SRIJON
        SINGHA
            SAMANTA */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define nl "\n"
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define yes cout << "YES" << nl
#define no cout << "NO" << nl
#define fi first
#define sec second
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define FIO                           \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
const int mod = 1e9 + 7;
bool good(ll mid, ll b,ll n)
{
    return (mid*n)>=b;
}

int32_t main()
{
    FIO

    ll t;	cin >> t;
    ll tt=t;
    while (tt--)
    {
        ll n,k; cin>>n>>k;
        if(n>=k) cout<<"0"<<nl;
        else
        {
            ll a=k/n,b=k/2;
            ll l=0,r=a;
            while(l+1<r)
            {
                ll mid=(l+r)/2;
                if(good(mid,b,n)) r=mid;
                else l=mid;
            }
            cout<<r*(k-(r*n))<<nl;
        }      
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Contest
Brain Booster #5
Language
C++17 (G++ 13.2.0)
Submit At
2024-09-05 17:13:07
Judged At
2024-10-03 13:05:02
Judged By
Score
11
Total Time
33ms
Peak Memory
2.195 MiB