oj.uz

답안 #14343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
14343 2015-05-12T10:17:57 Z comet Be Two Bees (OJUZ10_b2b) C++
0 / 100
 826 ms 4324 KB 
#include<bits/stdc++.h>
using namespace std;
int n;
double sum,H[111111],T[111111],a[111111];
bool check(double k){
    for(int i=0;i<n;i++)a[i]=H[i]+k*T[i];
    sort(a,a+n);
    double ret=0;
    for(int i=0;i<n-2;i++)ret+=a[i];
    //printf("%f : %f\n",ret,k*sum);
    return ret>=k*sum;
}
void output(double k){
    double Max=0;
    int v,v2;
    for(int i=0;i<n;i++)a[i]=H[i]+k*T[i];
    for(int i=0;i<n;i++){
        if(Max<a[i]){
            Max=a[i];
            v=i;
        }
    }
    Max=0;
    for(int i=0;i<n;i++){
        if(Max<a[i]&&i!=v){
            Max=a[i];
            v2=i;
        }
    }
    printf("%d %d\n",v+1,v2+1);
}
int main(){
    scanf("%d",&n);
    int x,y,z;
    for(int i=0;i<n;i++)scanf("%lf",&H[i]);
    for(int i=0;i<n;i++){
        scanf("%lf",&T[i]);
		T[i]=(double)1/T[i];
        sum+=T[i];
    }
    double lo=0,hi=1e18,mid;
    for(int i=0;i<80;i++){
        mid=(lo+hi)/2;
        if(check(mid)){
            lo=mid;
        }
        else{
            hi=mid;
        }
        //printf("%f %f\n",lo,hi);
    }
    output(hi);
}

Subtask #1
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 4324 KB Output isn't correct
2 Incorrect 0 ms 4324 KB Output isn't correct
3 Incorrect 0 ms 4324 KB Output isn't correct
4 Incorrect 0 ms 4324 KB Output isn't correct
5 Correct 0 ms 4324 KB Output is correct
6 Incorrect 0 ms 4324 KB Output isn't correct
7 Incorrect 0 ms 4324 KB Output isn't correct

Subtask #2
0.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 4324 KB Output isn't correct
2 Incorrect 0 ms 4324 KB Output isn't correct
3 Incorrect 0 ms 4324 KB Output isn't correct
4 Incorrect 4 ms 4324 KB Output isn't correct
5 Correct 5 ms 4324 KB Output is correct
6 Incorrect 4 ms 4324 KB Output isn't correct
7 Incorrect 0 ms 4324 KB Output isn't correct
8 Correct 4 ms 4324 KB Output is correct
9 Incorrect 0 ms 4324 KB Output isn't correct

Subtask #3
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 619 ms 4324 KB Output is correct
2 Correct 801 ms 4324 KB Output is correct
3 Incorrect 798 ms 4324 KB Output isn't correct
4 Correct 807 ms 4324 KB Output is correct
5 Incorrect 555 ms 4324 KB Output isn't correct
6 Incorrect 248 ms 4324 KB Output isn't correct
7 Correct 364 ms 4324 KB Output is correct
8 Incorrect 819 ms 4324 KB Output isn't correct
9 Correct 209 ms 4324 KB Output is correct
10 Correct 766 ms 4324 KB Output is correct
11 Incorrect 446 ms 4324 KB Output isn't correct
12 Correct 237 ms 4324 KB Output is correct

Subtask #4
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 557 ms 4324 KB Output is correct
2 Correct 517 ms 4324 KB Output is correct
3 Correct 808 ms 4324 KB Output is correct
4 Incorrect 810 ms 4324 KB Output isn't correct
5 Correct 826 ms 4324 KB Output is correct
6 Correct 816 ms 4324 KB Output is correct
7 Correct 543 ms 4324 KB Output is correct
8 Correct 810 ms 4324 KB Output is correct
9 Correct 56 ms 4324 KB Output is correct
10 Incorrect 825 ms 4324 KB Output isn't correct
11 Correct 813 ms 4324 KB Output is correct
12 Correct 544 ms 4324 KB Output is correct
13 Incorrect 456 ms 4324 KB Output isn't correct
14 Correct 801 ms 4324 KB Output is correct
15 Incorrect 784 ms 4324 KB Output isn't correct
16 Incorrect 807 ms 4324 KB Output isn't correct
17 Incorrect 814 ms 4324 KB Output isn't correct