Submission #14349

#	Time	Username	Problem	Language	Result	Execution time	Memory
14349		comet	Be Two Bees (OJUZ10_b2b)	C++98	0 / 100	174 ms	4324 KiB

b2b

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll sum,H[111111];
double T[111111],a[111111];
bool check(double k){
    for(int i=0;i<n;i++)a[i]=H[i]+k/T[i];
    double ret=0;
    double* t=max_element(a,a+n);
    ret+=*t;
    *t=-1e18;
    t=max_element(a,a+n);
    ret+=*t;
    return ret>sum;
}
void output(double k){
    for(int i=0;i<n;i++)a[i]=H[i]+k/T[i];
    double* t=max_element(a,a+n);
    printf("%d ",t-a+1);
    *t=-1e18;
    t=max_element(a,a+n);
    printf("%d\n",t-a+1);
}
int main(){
    scanf("%d",&n);
    int x,y,z;
    for(int i=0;i<n;i++){
		scanf("%lld",&H[i]);
		sum+=H[i];
    }
    for(int i=0;i<n;i++){
        scanf("%lf",&T[i]);
    }
    double lo=0,hi=1e18,mid;
    for(int i=0;i<100;i++){
        mid=(lo+hi)/2;
        if(check(mid)){
            hi=mid;
        }
        else{
            lo=mid;
        }
        //printf("%f %f\n",hi,lo);
    }
    output(hi);
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 22
• Subtask 3: 0 / 28
• Subtask 4: 0 / 39