답안 #14447

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
14447	2015-05-16T17:04:34 Z	dohyun0324	Be Two Bees (OJUZ10_b2b)	C++	33 / 100	435 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,c=0;
    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])+100;
    while(en-st>1e-5){
        c++;
        if(c==200) break;
        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	2 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

0.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	137 ms	2644 KB	Output is correct
2	Correct	108 ms	2644 KB	Output is correct
3	Correct	88 ms	2644 KB	Output is correct
4	Incorrect	421 ms	2644 KB	Output isn't correct
5	Incorrect	131 ms	2644 KB	Output isn't correct
6	Correct	130 ms	2644 KB	Output is correct
7	Correct	77 ms	2644 KB	Output is correct
8	Incorrect	431 ms	2644 KB	Output isn't correct
9	Incorrect	126 ms	2644 KB	Output isn't correct
10	Correct	46 ms	2644 KB	Output is correct
11	Correct	50 ms	2644 KB	Output is correct
12	Correct	209 ms	2644 KB	Output is correct

Subtask #4

0.0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	136 ms	2644 KB	Output isn't correct
2	Correct	46 ms	2644 KB	Output is correct
3	Incorrect	135 ms	2644 KB	Output isn't correct
4	Incorrect	430 ms	2644 KB	Output isn't correct
5	Incorrect	428 ms	2644 KB	Output isn't correct
6	Correct	101 ms	2644 KB	Output is correct
7	Correct	154 ms	2644 KB	Output is correct
8	Incorrect	433 ms	2644 KB	Output isn't correct
9	Correct	92 ms	2644 KB	Output is correct
10	Incorrect	138 ms	2644 KB	Output isn't correct
11	Incorrect	143 ms	2644 KB	Output isn't correct
12	Incorrect	435 ms	2644 KB	Output isn't correct
13	Incorrect	435 ms	2644 KB	Output isn't correct
14	Incorrect	430 ms	2644 KB	Output isn't correct
15	Correct	149 ms	2644 KB	Output is correct
16	Incorrect	136 ms	2644 KB	Output isn't correct
17	Correct	89 ms	2644 KB	Output is correct