답안 #14445

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
14445	2015-05-16T17:01:10 Z	dohyun0324	Be Two Bees (OJUZ10_b2b)	C++	33 / 100	137 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=1e+10,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]);
    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

11.0 / 11.0

#	결과	실행 시간	메모리	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

#	결과	실행 시간	메모리	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	1 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

0.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	72 ms	2644 KB	Output isn't correct
2	Correct	120 ms	2644 KB	Output is correct
3	Correct	64 ms	2644 KB	Output is correct
4	Correct	131 ms	2644 KB	Output is correct
5	Correct	131 ms	2644 KB	Output is correct
6	Incorrect	132 ms	2644 KB	Output isn't correct
7	Correct	88 ms	2644 KB	Output is correct
8	Correct	42 ms	2644 KB	Output is correct
9	Incorrect	71 ms	2644 KB	Output isn't correct
10	Correct	124 ms	2644 KB	Output is correct
11	Correct	119 ms	2644 KB	Output is correct
12	Incorrect	122 ms	2644 KB	Output isn't correct

Subtask #4

0.0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	126 ms	2644 KB	Output isn't correct
2	Correct	86 ms	2644 KB	Output is correct
3	Correct	80 ms	2644 KB	Output is correct
4	Correct	128 ms	2644 KB	Output is correct
5	Correct	125 ms	2644 KB	Output is correct
6	Correct	128 ms	2644 KB	Output is correct
7	Correct	135 ms	2644 KB	Output is correct
8	Correct	134 ms	2644 KB	Output is correct
9	Incorrect	135 ms	2644 KB	Output isn't correct
10	Incorrect	137 ms	2644 KB	Output isn't correct
11	Correct	135 ms	2644 KB	Output is correct
12	Correct	119 ms	2644 KB	Output is correct
13	Incorrect	129 ms	2644 KB	Output isn't correct
14	Incorrect	135 ms	2644 KB	Output isn't correct
15	Correct	43 ms	2644 KB	Output is correct
16	Correct	92 ms	2644 KB	Output is correct
17	Correct	132 ms	2644 KB	Output is correct