/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 11ms 572.0 KiB
#4 Accepted 27ms 532.0 KiB
#5 Accepted 87ms 572.0 KiB
#6 Accepted 28ms 532.0 KiB
#7 Accepted 51ms 1.562 MiB
#8 Accepted 50ms 596.0 KiB
#9 Accepted 34ms 908.0 KiB
#10 Accepted 32ms 564.0 KiB
#11 Accepted 107ms 680.0 KiB

Code

#include <bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()

void solve(int cs) {
  int n; int64_t s;
  cin >> n >> s;
  vector<int> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];

  int hi = 1e9, lo = 1, ans = -1;
  while (hi >= lo) {
    int mid = hi + lo >> 1;
    int64_t ns = 0;
    for (auto &it : a) ns += it / mid;
    if (ns <= s) ans = mid, hi = mid - 1;
    else lo = mid + 1;
  }
  if (ans != -1) for (auto &it : a) s -= it / ans;
  cout << (s == 0 ? ans : -1) << "\n";
}

int32_t main() {
  cin.tie(0) -> sync_with_stdio(0);
  int t = 1;
  cin >> t;
  for (int i = 1; i <= t; i++) {
    solve(i);
  }
  return 0;
}

Information

Submit By
Type
Submission
Problem
P1057 Floor Sum
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-09 12:49:17
Judged At
2025-07-09 12:49:17
Judged By
Score
100
Total Time
107ms
Peak Memory
1.562 MiB