/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 532.0 KiB
#3 Wrong Answer 2ms 320.0 KiB
#4 Wrong Answer 2ms 560.0 KiB
#5 Wrong Answer 2ms 580.0 KiB
#6 Wrong Answer 12ms 592.0 KiB
#7 Wrong Answer 103ms 1.859 MiB
#8 Wrong Answer 86ms 720.0 KiB
#9 Wrong Answer 94ms 756.0 KiB
#10 Accepted 96ms 2.273 MiB
#11 Wrong Answer 97ms 1.535 MiB

Code

// @sagorahmedmunna

#include <bits/stdc++.h>
using namespace std;

long long n, k;

long long f(long long mid) {
  return (mid / n) * (k - mid);
}

void test() {
  cin >> n >> k;
  long long lo = 0, hi = k;
  while (lo < hi) {
    long long mid = (lo + hi) / 2;
    if (f(mid) <= f(mid + 1)) lo = mid + 1;
    else hi = mid;
  }
  long long mx = 0;
  for (long long i = max(0LL, hi - 10); i < hi + 10; i++) {
    long long kl = k - (n * i);
    if (kl < 0) break;
    mx = max(mx, i * (kl));
  }
  cout << mx << '\n';
}

int main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    test();
  }
  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:13:57
Judged At
2024-10-03 13:08:30
Judged By
Score
11
Total Time
103ms
Peak Memory
2.273 MiB