Submission #15754

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15754	2015-07-19T18:42:35 Z	cki86201	Be Two Bees (OJUZ10_b2b)	C++	11 / 100	91 ms	1864 KB

b2b

#include<stdio.h>
#include<algorithm>
#include<set>
#include<vector>
using namespace std;

typedef long long ll;
typedef pair<int,int> Pi;
#define X first
#define Y second

int N;
int T[100010], H[100010];
ll S;
int p[2];

bool chk(double x){
	double now[2] = {0}, re[2] = {0};
	for(int i=0;i<N;i++){
		double t = (double)H[i] + x / T[i];
		if(now[0] < t)now[1] = now[0], re[1] = re[0], now[0] = t, re[0] = i;
		else if(now[1] < t)now[1] = t, re[1] = i;
	}
	if((double)S - now[0] - now[1] < 0){
		p[0] = min(re[0],re[1]) + 1;
		p[1] = max(re[0],re[1]) + 1;
		return true;
	}
	return false;
}

int main(){
	scanf("%d",&N);
	for(int i=0;i<N;i++)scanf("%d",H+i), S += H[i];
	for(int i=0;i<N;i++)scanf("%d",T+i);
	double low = 0, high = 1e10;
	while((high - low) > 1e-5){
		double mid = (low + high) / 2;
		if(chk(mid))high = mid;
		else low = mid;
	}
	printf("%d %d",p[0],p[1]);
	return 0;
}

Subtask #1

11.0 / 11.0

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

Subtask #2

0.0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	1864 KB	Output isn't correct
2	Correct	0 ms	1864 KB	Output is correct
3	Correct	0 ms	1864 KB	Output is correct
4	Correct	0 ms	1864 KB	Output is correct
5	Correct	0 ms	1864 KB	Output is correct
6	Incorrect	0 ms	1864 KB	Output isn't correct
7	Correct	0 ms	1864 KB	Output is correct
8	Correct	0 ms	1864 KB	Output is correct
9	Correct	0 ms	1864 KB	Output is correct

Subtask #3

0.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	80 ms	1864 KB	Output is correct
2	Correct	47 ms	1864 KB	Output is correct
3	Correct	50 ms	1864 KB	Output is correct
4	Incorrect	74 ms	1864 KB	Output isn't correct
5	Correct	22 ms	1864 KB	Output is correct
6	Correct	75 ms	1864 KB	Output is correct
7	Correct	63 ms	1864 KB	Output is correct
8	Incorrect	87 ms	1864 KB	Output isn't correct
9	Incorrect	42 ms	1864 KB	Output isn't correct
10	Incorrect	85 ms	1864 KB	Output isn't correct
11	Correct	75 ms	1864 KB	Output is correct
12	Incorrect	82 ms	1864 KB	Output isn't correct

Subtask #4

0.0 / 39.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	82 ms	1864 KB	Output isn't correct
2	Incorrect	88 ms	1864 KB	Output isn't correct
3	Incorrect	29 ms	1864 KB	Output isn't correct
4	Incorrect	87 ms	1864 KB	Output isn't correct
5	Incorrect	91 ms	1864 KB	Output isn't correct
6	Incorrect	89 ms	1864 KB	Output isn't correct
7	Incorrect	55 ms	1864 KB	Output isn't correct
8	Correct	80 ms	1864 KB	Output is correct
9	Correct	58 ms	1864 KB	Output is correct
10	Incorrect	76 ms	1864 KB	Output isn't correct
11	Correct	45 ms	1864 KB	Output is correct
12	Incorrect	76 ms	1864 KB	Output isn't correct
13	Incorrect	83 ms	1864 KB	Output isn't correct
14	Correct	81 ms	1864 KB	Output is correct
15	Correct	82 ms	1864 KB	Output is correct
16	Correct	65 ms	1864 KB	Output is correct
17	Correct	78 ms	1864 KB	Output is correct