| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 14351 |
2015-05-12T10:54:10 Z |
comet |
Be Two Bees (OJUZ10_b2b) |
C++ |
|
166 ms |
3456 KB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll sum;
int H[111111],T[111111];
double a[111111];
bool check(double k){
for(int i=0;i<n;i++)a[i]=H[i]+k/T[i];
double ret=0;
double* t=max_element(a,a+n);
ret+=*t;
*t=-1e18;
t=max_element(a,a+n);
ret+=*t;
return ret>sum;
}
void output(double k){
for(int i=0;i<n;i++)a[i]=H[i]+k/T[i];
double* t=max_element(a,a+n);
printf("%d ",t-a+1);
*t=-1e18;
t=max_element(a,a+n);
printf("%d\n",t-a+1);
}
int main(){
scanf("%d",&n);
int x,y,z;
for(int i=0;i<n;i++){
scanf("%d",&H[i]);
sum+=H[i];
}
for(int i=0;i<n;i++){
scanf("%d",&T[i]);
}
double lo=0,hi=1e15,mid;
for(int i=0;i<100;i++){
mid=(lo+hi)/2;
if(check(mid)){
hi=mid;
}
else{
lo=mid;
}
//printf("%f %f\n",hi,lo);
}
output(hi);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 2 |
Correct |
0 ms |
3456 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
3456 KB |
Output isn't correct |
| 2 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
3456 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 5 |
Correct |
2 ms |
3456 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
3456 KB |
Output isn't correct |
| 7 |
Correct |
0 ms |
3456 KB |
Output is correct |
| 8 |
Incorrect |
0 ms |
3456 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
3456 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
55 ms |
3456 KB |
Output isn't correct |
| 2 |
Incorrect |
162 ms |
3456 KB |
Output isn't correct |
| 3 |
Correct |
153 ms |
3456 KB |
Output is correct |
| 4 |
Correct |
159 ms |
3456 KB |
Output is correct |
| 5 |
Correct |
95 ms |
3456 KB |
Output is correct |
| 6 |
Correct |
162 ms |
3456 KB |
Output is correct |
| 7 |
Correct |
79 ms |
3456 KB |
Output is correct |
| 8 |
Correct |
164 ms |
3456 KB |
Output is correct |
| 9 |
Incorrect |
149 ms |
3456 KB |
Output isn't correct |
| 10 |
Correct |
163 ms |
3456 KB |
Output is correct |
| 11 |
Incorrect |
105 ms |
3456 KB |
Output isn't correct |
| 12 |
Incorrect |
94 ms |
3456 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
161 ms |
3456 KB |
Output is correct |
| 2 |
Correct |
111 ms |
3456 KB |
Output is correct |
| 3 |
Correct |
161 ms |
3456 KB |
Output is correct |
| 4 |
Correct |
53 ms |
3456 KB |
Output is correct |
| 5 |
Correct |
160 ms |
3456 KB |
Output is correct |
| 6 |
Incorrect |
155 ms |
3456 KB |
Output isn't correct |
| 7 |
Correct |
164 ms |
3456 KB |
Output is correct |
| 8 |
Incorrect |
159 ms |
3456 KB |
Output isn't correct |
| 9 |
Correct |
160 ms |
3456 KB |
Output is correct |
| 10 |
Incorrect |
152 ms |
3456 KB |
Output isn't correct |
| 11 |
Correct |
160 ms |
3456 KB |
Output is correct |
| 12 |
Correct |
166 ms |
3456 KB |
Output is correct |
| 13 |
Correct |
110 ms |
3456 KB |
Output is correct |
| 14 |
Incorrect |
86 ms |
3456 KB |
Output isn't correct |
| 15 |
Correct |
161 ms |
3456 KB |
Output is correct |
| 16 |
Incorrect |
158 ms |
3456 KB |
Output isn't correct |
| 17 |
Incorrect |
161 ms |
3456 KB |
Output isn't correct |
