Submission #15756

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
15756	2015-07-19T18:47:28 Z	cki86201	Be Two Bees (OJUZ10_b2b)	C++	100 / 100	108 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 = 1e15;
	for(int i=0;i<70;i++){
		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

22.0 / 22.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	1 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
8	Correct	0 ms	1864 KB	Output is correct
9	Correct	0 ms	1864 KB	Output is correct

Subtask #3

28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	35 ms	1864 KB	Output is correct
2	Correct	54 ms	1864 KB	Output is correct
3	Correct	51 ms	1864 KB	Output is correct
4	Correct	56 ms	1864 KB	Output is correct
5	Correct	104 ms	1864 KB	Output is correct
6	Correct	67 ms	1864 KB	Output is correct
7	Correct	92 ms	1864 KB	Output is correct
8	Correct	97 ms	1864 KB	Output is correct
9	Correct	100 ms	1864 KB	Output is correct
10	Correct	104 ms	1864 KB	Output is correct
11	Correct	101 ms	1864 KB	Output is correct
12	Correct	87 ms	1864 KB	Output is correct

Subtask #4

39.0 / 39.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	102 ms	1864 KB	Output is correct
2	Correct	108 ms	1864 KB	Output is correct
3	Correct	102 ms	1864 KB	Output is correct
4	Correct	101 ms	1864 KB	Output is correct
5	Correct	100 ms	1864 KB	Output is correct
6	Correct	93 ms	1864 KB	Output is correct
7	Correct	97 ms	1864 KB	Output is correct
8	Correct	75 ms	1864 KB	Output is correct
9	Correct	95 ms	1864 KB	Output is correct
10	Correct	102 ms	1864 KB	Output is correct
11	Correct	95 ms	1864 KB	Output is correct
12	Correct	61 ms	1864 KB	Output is correct
13	Correct	72 ms	1864 KB	Output is correct
14	Correct	106 ms	1864 KB	Output is correct
15	Correct	97 ms	1864 KB	Output is correct
16	Correct	101 ms	1864 KB	Output is correct
17	Correct	35 ms	1864 KB	Output is correct