oj.uz

Submission #860242

# Submission time Handle Problem Language Result Execution time Memory
860242 2023-10-12T09:39:39 Z Vanilla Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 2396 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return (a + b - 1) / b;}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 1e5 + 2;
double a[maxn], b[maxn];
double pref [maxn];
int n;

void solve(int id){

  return;
}

double calc (double a[], double b[]) {
  for (int i = 1; i <= n; i++) {
    pref[i] = pref[i-1] + b[i];
    // if (b[i] )
  }
  double sa = 0;
  double rs = 0;
  for (int i = 1; i <= n; i++) {
    sa+=a[i];
    int l = 1, r = n, f = 0;
    while (l <= r) {
      int mid = (l + r) / 2;
      double s = pref[mid];
      // cout << i << " " << l << " " << r << " " << mid << " " << s << "\n";
      if (s > sa || s - mid - i < 0) {
        r = mid - 1;
      }
      else {
        l = mid + 1;
        f = mid;
      }
      // cout << l << " " << r << "\n";
    }
    // cout << i << " " << sa << " " << f << "\n";
    rs = max(rs, pref[f] - (i + f));
  }
  return rs;
}

int main(){
  ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(4);
  cin >> n;
  for (int i = 1; i <= n; i++){
    cin >> a[i] >> b[i];
  }
  sort(a + 1, a + n + 1, greater <double> ());
  sort(b + 1, b + n + 1, greater <double> ());
  // calc(a,b);
  cout << max(calc(a, b), calc(b, a));
  return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Incorrect 1 ms 2396 KB Output isn't correct
4 Halted 0 ms 0 KB -