/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 320.0 KiB
#3 Accepted 2ms 324.0 KiB
#4 Accepted 2ms 484.0 KiB
#5 Accepted 2ms 576.0 KiB
#6 Accepted 6ms 580.0 KiB
#7 Accepted 42ms 1.859 MiB
#8 Accepted 36ms 1.488 MiB
#9 Accepted 40ms 1.75 MiB
#10 Accepted 37ms 2.137 MiB
#11 Accepted 47ms 1.996 MiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, k;
    cin >> n >> k;

    ll lo = 0, hi = k / n, mid1, mid2, ans = 0;
    while(lo <= hi) {
        mid1 = lo + (hi - lo) / 3;
        mid2 = hi - (hi - lo) / 3;

        ll val1 = (k - (mid1 * n)) * mid1;
        ll val2 = (k - (mid2 * n)) * mid2;

        if(val1 > val2) {
            hi = mid2 - 1;
            ans = mid1;
        }
        else if(val1 < val2) {
            lo = mid1 + 1;
            ans = val2;
        }
        else {
            lo = mid1 + 1;
            hi = mid2 - 1;
            ans = val1;
        }
    }
    cout << ans << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 16:03:08
Judged At
2024-11-11 03:01:56
Judged By
Score
100
Total Time
47ms
Peak Memory
2.137 MiB