oj.uz

Submission #19124

# Submission time Handle Problem Language Result Execution time Memory
19124 2016-02-18T16:19:13 Z eaststar Be Two Bees (OJUZ10_b2b) C++14
11 / 100
 63 ms 2644 KB 
#include <stdio.h>
int n,ai,aj;
long long h[100010],t[100010],H;
int f(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;
}
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=1e10,m;
    while((r-l)/r>1e-8){
        m=(l+r)/2;
        if(f(m)){
            double x=H-h[ai]-h[aj],y=1.0/t[ai]+1.0/t[aj];
            r=x/y;
        }
        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
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Incorrect 0 ms 2644 KB Output isn't 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 Incorrect 0 ms 2644 KB Output isn't correct
9 Correct 0 ms 2644 KB Output is correct

Subtask #3
0.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2644 KB Output is correct
2 Incorrect 46 ms 2644 KB Output isn't correct
3 Incorrect 52 ms 2644 KB Output isn't correct
4 Incorrect 52 ms 2644 KB Output isn't correct
5 Incorrect 51 ms 2644 KB Output isn't correct
6 Correct 42 ms 2644 KB Output is correct
7 Correct 33 ms 2644 KB Output is correct
8 Correct 54 ms 2644 KB Output is correct
9 Correct 20 ms 2644 KB Output is correct
10 Incorrect 26 ms 2644 KB Output isn't correct
11 Correct 61 ms 2644 KB Output is correct
12 Correct 36 ms 2644 KB Output is correct

Subtask #4
0.0 / 39.0

# Verdict Execution time Memory Grader output
1 Incorrect 58 ms 2644 KB Output isn't correct
2 Incorrect 56 ms 2644 KB Output isn't correct
3 Correct 42 ms 2644 KB Output is correct
4 Correct 46 ms 2644 KB Output is correct
5 Incorrect 50 ms 2644 KB Output isn't correct
6 Incorrect 20 ms 2644 KB Output isn't correct
7 Correct 37 ms 2644 KB Output is correct
8 Correct 48 ms 2644 KB Output is correct
9 Incorrect 48 ms 2644 KB Output isn't correct
10 Incorrect 56 ms 2644 KB Output isn't correct
11 Incorrect 61 ms 2644 KB Output isn't correct
12 Incorrect 63 ms 2644 KB Output isn't correct
13 Correct 59 ms 2644 KB Output is correct
14 Incorrect 63 ms 2644 KB Output isn't correct
15 Correct 63 ms 2644 KB Output is correct
16 Incorrect 44 ms 2644 KB Output isn't correct
17 Correct 63 ms 2644 KB Output is correct