/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Wrong Answer 1ms 396.0 KiB
#3 Wrong Answer 321ms 564.0 KiB
#4 Wrong Answer 235ms 560.0 KiB
#5 Wrong Answer 954ms 584.0 KiB
#6 Time Exceeded ≥1080ms ≥596.0 KiB
#7 Time Exceeded ≥1088ms ≥616.0 KiB
#8 Wrong Answer 389ms 2.402 MiB
#9 Time Exceeded ≥1089ms ≥1000.0 KiB
#10 Time Exceeded ≥1081ms ≥324.0 KiB
#11 Time Exceeded ≥1089ms ≥532.0 KiB

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;
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 mx=0;
            ll a=k/n;
            ll y=0,base=1;
            for(ll i=1;i<=a;i++)
            {
                y+=base;
                mx=max(mx,((k-(i*n))*y));
                base*=2;              
            }
            cout<<mx<<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 16:35:29
Judged At
2024-10-03 13:06:58
Judged By
Score
1
Total Time
≥1089ms
Peak Memory
≥2.402 MiB