Submission #14446

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
14446	2015-05-16T17:03:08 Z	dohyun0324	Be Two Bees (OJUZ10_b2b)	C++	0 / 100	1000 ms	2644 KB

b2b

#include<stdio.h>
#include<algorithm>
using namespace std;
int n,p1,p2;
long long sum,h[100010],t[100010];
double st=0,en,mid;
int pro(double v){
    int i,s;
    double maxi1=0,maxi2=0;
    for(i=1;i<=n;i++){
        s=h[i]+v/t[i];
        if(maxi1<s) maxi1=s, p1=i;
    }
    for(i=1;i<=n;i++){
        s=h[i]+v/t[i];
        if(maxi2<s && p1!=i) maxi2=s, p2=i;
    }
    if(maxi1+maxi2>=sum) return 1;
    return 0;
}
int main()
{
    int i;
    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%lld",&h[i]), sum+=h[i];
    for(i=1;i<=n;i++) scanf("%lld",&t[i]);
    en=double(sum-h[1]-h[2])/(1.0/t[1]+1.0/t[2]);
    while(en-st>1e-5){
        mid=(st+en)/2.0;
        if(pro(mid)==1) en=mid;
        else st=mid;
    }
    printf("%d %d",min(p1,p2),max(p1,p2));
    return 0;
}

Subtask #1

0.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	Incorrect	0 ms	2644 KB	Output isn't correct

Subtask #2

0.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	2644 KB	Output isn't 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	1 ms	2644 KB	Output is correct
6	Execution timed out	1000 ms	2640 KB	Program timed out
7	Correct	1 ms	2644 KB	Output is correct
8	Correct	2 ms	2644 KB	Output is correct
9	Correct	0 ms	2644 KB	Output is correct

Subtask #3

0.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1000 ms	2640 KB	Program timed out
2	Correct	122 ms	2644 KB	Output is correct
3	Execution timed out	1000 ms	2640 KB	Program timed out
4	Correct	128 ms	2644 KB	Output is correct
5	Incorrect	135 ms	2644 KB	Output isn't correct
6	Correct	94 ms	2644 KB	Output is correct
7	Correct	81 ms	2644 KB	Output is correct
8	Correct	53 ms	2644 KB	Output is correct
9	Correct	115 ms	2644 KB	Output is correct
10	Execution timed out	1000 ms	2640 KB	Program timed out
11	Correct	40 ms	2644 KB	Output is correct
12	Incorrect	128 ms	2644 KB	Output isn't correct

Subtask #4

0.0 / 39.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	138 ms	2644 KB	Output isn't correct
2	Correct	101 ms	2644 KB	Output is correct
3	Correct	92 ms	2644 KB	Output is correct
4	Incorrect	134 ms	2644 KB	Output isn't correct
5	Execution timed out	1000 ms	2640 KB	Program timed out
6	Execution timed out	1000 ms	2640 KB	Program timed out
7	Incorrect	137 ms	2644 KB	Output isn't correct
8	Correct	46 ms	2644 KB	Output is correct
9	Incorrect	137 ms	2644 KB	Output isn't correct
10	Execution timed out	1000 ms	2640 KB	Program timed out
11	Correct	150 ms	2644 KB	Output is correct
12	Incorrect	135 ms	2644 KB	Output isn't correct
13	Correct	154 ms	2644 KB	Output is correct
14	Execution timed out	1000 ms	2640 KB	Program timed out
15	Execution timed out	1000 ms	2640 KB	Program timed out
16	Correct	97 ms	2644 KB	Output is correct
17	Execution timed out	1000 ms	2640 KB	Program timed out