oj.uz

Submission #955022

# Submission time Handle Problem Language Result Execution time Memory
955022 2024-03-29T07:51:52 Z evenvalue Sure Bet (CEOI17_sure) C++17
100 / 100
 65 ms 3664 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

#ifdef evenvalue
  #include "debug.h"
#else
  #define debug(...)
#endif

using int64 = long long;
using ld = long double;

template<typename T>
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using max_heap = priority_queue<T, vector<T>, less<T>>;

namespace Read {
int Int() {
  int x;
  cin >> x;
  return x;
}
int64 Int64() {
  int64 x;
  cin >> x;
  return x;
}
char Char() {
  char c;
  cin >> c;
  return c;
}
string String() {
  string s;
  cin >> s;
  return s;
}
double Double() {
  return stod(String());
}
ld LongDouble() {
  return stold(String());
}
template<typename T1, typename T2>
pair<T1, T2> Pair() {
  pair<T1, T2> p;
  cin >> p.first >> p.second;
  return p;
}
template<typename T>
vector<T> Vec(const int n) {
  vector<T> v(n);
  for (T &x : v) {
    cin >> x;
  }
  return v;
}
template<typename T>
vector<vector<T>> VecVec(const int n, const int m) {
  vector<vector<T>> v(n);
  for (vector<T> &vec : v) {
    vec = Vec<T>(m);
  }
  return v;
}
}//namespace Read

constexpr int kInf = 1e9 + 10;
constexpr int64 kInf64 = 1e15 + 10;
constexpr int kMod = 1e9 + 7;
constexpr int kMaxN = 1e5 + 10;
constexpr int kScale = 10000;

inline void solution() {
  const int n = Read::Int();
  
  vector<int> a(n);
  vector<int> b(n);

  for (int i = 0; i < n; i++) {
    a[i] = round(Read::Double() * kScale);
    b[i] = round(Read::Double() * kScale);
  }

  sort(a.rbegin(), a.rend());
  sort(b.rbegin(), b.rend());

  auto check = [&](const int profit) -> bool {
    int64 bought = 0;
    int64 second = 0, first = 0;

    for (int i = 0, j = 0; min(first, second) - bought < profit and (i < n or j < n);) {
      if (i != n and first == min(first, second)) {
        first += a[i++];
      } else if (j != n) {
        second += b[j++];
      } else {
        break;
      }
      bought += kScale;
    }
    return min(first, second) - bought >= profit;
  };

  int lo = 0, hi = kMaxN * 1000 * kScale;
  while (lo < hi) {
    const int mid = (lo + hi + 1) / 2;
    if (check(mid)) {
      lo = mid;
    } else {
      hi = mid - 1;
    }
  }

  cout << (ld)lo / kScale << '\n';
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  //freopen("sure/sure.02.07.in", "r", stdin);
  //freopen(".out", "w", stdout);

  cout << fixed << setprecision(4);

  int testcases = 1;
  //cin >> testcases;
  while (testcases--) {
    solution();
  }
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 54 ms 3280 KB Output is correct
18 Correct 56 ms 3380 KB Output is correct
19 Correct 56 ms 3164 KB Output is correct
20 Correct 65 ms 3392 KB Output is correct
21 Correct 55 ms 3664 KB Output is correct
22 Correct 54 ms 3164 KB Output is correct
23 Correct 52 ms 3164 KB Output is correct
24 Correct 54 ms 3420 KB Output is correct
25 Correct 54 ms 3164 KB Output is correct
26 Correct 55 ms 3556 KB Output is correct