제출 #15753

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
15753		cki86201	Be Two Bees (OJUZ10_b2b)	C++98	0 / 100	1000 ms	1864 KiB

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-10){
		double mid = (low + high) / 2;
		if(chk(mid))high = mid;
		else low = mid;
	}
	printf("%d %d",p[0],p[1]);
	return 0;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 22
• Subtask 3: 0 / 28
• Subtask 4: 0 / 39