Submission #553255

#	Time	Username	Problem	Language	Result	Execution time	Memory
553255		farhan132	Sure Bet (CEOI17_sure)	C++17	100 / 100	914 ms	3660 KiB

sure

/***Farhan132***/
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimization ("unroll-loops")
//#pragma GCC optimize("Ofast,fast-math")
 
#include <bits/stdc++.h>
 
 
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<ll> vll;
typedef pair<ll , ll> ii;
typedef vector< ii > vii;
typedef pair < pair < ll , ll > , pair < ll , ll > > cm; 
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define f0(b) for(int i=0;i<(b);i++)
#define f00(b) for(int j=0;j<(b);j++)
#define f1(b) for(int i=1;i<=(b);i++)
#define f11(b) for(int j=1;j<=(b);j++)
#define f2(a,b) for(int i=(a);i<=(b);i++)
#define f22(a,b) for(int j=(a);j<=(b);j++)
#define sf(a) scanf("%lld",&a)
#define sff(a,b) scanf("%lld %lld", &a , &b)
#define pf(a) printf("%lld\n",a)
#define pff(a,b) printf("%lld %lld\n", a , b)
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clzll(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
//const ll mod =  (ll) 998244353;
const ll mod =  (ll) 1e9 + 7;
const ll maxn = (ll)1e8 + 5;
const int nnn = 1048590;
const int inf = numeric_limits<int>::max()-1;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)1e18;
 
ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};
ll dxx[]={0,1,0,-1,1,1,-1,-1};
ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
bool USACO = 0;
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 2e5 + 5;

ll a[N] , b[N];
ll n;

void solve(){

   cin >> n;

  for(ll i = 1; i <= n; i++){
    dd x , y; cin >> x >> y;
    a[i] = 1.0 * x * 1e10;
    b[i] = 1.0 * y * 1e10;
  }
  sort(a + 1, a + n + 1, greater < ll >() );
  sort(b + 1, b + n + 1, greater < ll >() );
  a[0] = b[0] = 0;
  for(ll i = 1; i <= n; i++){
    a[i] += a[i-1];
    b[i] += b[i-1];
  }
  ll ans = 0;
  for(ll take = 2; take <= 2*n; take++){
    ll lo = 0, hg = a[n] + b[n], res = 0;
    while(lo <= hg){
        ll mid = (lo + hg)/2;
        ll t = mid + (1e10 * take);
        ll idx1 = lower_bound(a, a + n + 1, t) - a;
        ll idx2 = lower_bound(b, b + n + 1, t) - b;
        if(max(idx1, idx2) == n + 1){
            hg = mid -1;
            continue;
        }
        if(idx1 + idx2 <= take){
            lo = mid + 1;
            res = mid;
        }else{
            hg = mid - 1;
        }
    } 
    ans = max(res, ans);
  }
  dd f = ans; f /= 1e10;
  printf("%.4lf",(double)f);
  
  return;
}
 
int main() {
    
    
    #ifdef LOCAL
        freopen("in", "r", stdin);
        freopen("out", "w", stdout);
        auto start_time = clock();
    #else 
       ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif
 
    //pre(N);
 
    ll T = 1, CT = 0;  //cin >> T; 
 
    while(T--){

        solve();
    }
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
}

Compilation message (stderr)

sure.cpp: In function 'int main()':
sure.cpp:127:15: warning: unused variable 'CT' [-Wunused-variable]
  127 |     ll T = 1, CT = 0;  //cin >> T;
      |               ^~

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 40 / 40