oj.uz

Submission #19126

# Submission time Handle Problem Language Result Execution time Memory
19126 2016-02-18T16:23:32 Z eaststar Be Two Bees (OJUZ10_b2b) C++14
100 / 100
 69 ms 2644 KB 
#include <stdio.h>
int n,ai=1,aj=2;
long long h[100010],t[100010],H;
int chk(double m){
    int i,mi,mj;
    double s,m1=0,m2=0;
    for(i=1;i<=n;++i){
        s=h[i]+m/t[i];
        if(m1<s)m2=m1,mj=mi,m1=s,mi=i;
        else if(m2<s)m2=s,mj=i;
    }
    if(m1+m2>H)ai=mi,aj=mj;
    return m1+m2>H;
}
double f(){
    double x=H-h[ai]-h[aj],y=1.0/t[ai]+1.0/t[aj];
    return x/y;
}
int main(){
    int i;
    scanf("%d",&n);
    for(i=1;i<=n;++i)scanf("%lld",h+i),H+=h[i];
    for(i=1;i<=n;++i)scanf("%lld",t+i);
    double l=0,r=f(),m;
    while((r-l)/r>1e-10){
        m=(l+r)/2;
        if(chk(m))r=f();
        else l=m;
    }
    if(ai>aj)ai^=aj^=ai^=aj;
    printf("%d %d",ai,aj);
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2644 KB Output is correct
2 Correct 0 ms 2644 KB Output is correct
3 Correct 0 ms 2644 KB Output is correct
4 Correct 0 ms 2644 KB Output is correct
5 Correct 0 ms 2644 KB Output is correct
6 Correct 0 ms 2644 KB Output is correct
7 Correct 0 ms 2644 KB Output is correct
8 Correct 0 ms 2644 KB Output is correct
9 Correct 0 ms 2644 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2644 KB Output is correct
2 Correct 66 ms 2644 KB Output is correct
3 Correct 51 ms 2644 KB Output is correct
4 Correct 57 ms 2644 KB Output is correct
5 Correct 26 ms 2644 KB Output is correct
6 Correct 64 ms 2644 KB Output is correct
7 Correct 37 ms 2644 KB Output is correct
8 Correct 37 ms 2644 KB Output is correct
9 Correct 21 ms 2644 KB Output is correct
10 Correct 60 ms 2644 KB Output is correct
11 Correct 37 ms 2644 KB Output is correct
12 Correct 55 ms 2644 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2644 KB Output is correct
2 Correct 57 ms 2644 KB Output is correct
3 Correct 59 ms 2644 KB Output is correct
4 Correct 61 ms 2644 KB Output is correct
5 Correct 60 ms 2644 KB Output is correct
6 Correct 42 ms 2644 KB Output is correct
7 Correct 63 ms 2644 KB Output is correct
8 Correct 63 ms 2644 KB Output is correct
9 Correct 65 ms 2644 KB Output is correct
10 Correct 63 ms 2644 KB Output is correct
11 Correct 68 ms 2644 KB Output is correct
12 Correct 69 ms 2644 KB Output is correct
13 Correct 15 ms 2644 KB Output is correct
14 Correct 63 ms 2644 KB Output is correct
15 Correct 55 ms 2644 KB Output is correct
16 Correct 68 ms 2644 KB Output is correct
17 Correct 35 ms 2644 KB Output is correct