oj.uz

답안 #14342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
14342 2015-05-12T10:16:58 Z comet Be Two Bees (OJUZ10_b2b) C++
0 / 100
 724 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<70;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 Correct 0 ms 4324 KB Output is 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 Incorrect 0 ms 4324 KB Output isn't 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 0 ms 4324 KB Output isn't correct
2 Incorrect 0 ms 4324 KB Output isn't correct
3 Incorrect 4 ms 4324 KB Output isn't correct
4 Correct 4 ms 4324 KB Output is correct
5 Incorrect 4 ms 4324 KB Output isn't correct
6 Correct 3 ms 4324 KB Output is correct
7 Incorrect 3 ms 4324 KB Output isn't correct
8 Incorrect 0 ms 4324 KB Output isn't correct
9 Incorrect 3 ms 4324 KB Output isn't correct

Subtask #3
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 700 ms 4324 KB Output is correct
2 Incorrect 396 ms 4324 KB Output isn't correct
3 Correct 707 ms 4324 KB Output is correct
4 Incorrect 220 ms 4324 KB Output isn't correct
5 Correct 318 ms 4324 KB Output is correct
6 Correct 189 ms 4324 KB Output is correct
7 Incorrect 720 ms 4324 KB Output isn't correct
8 Correct 542 ms 4324 KB Output is correct
9 Incorrect 719 ms 4324 KB Output isn't correct
10 Correct 199 ms 4324 KB Output is correct
11 Correct 682 ms 4324 KB Output is correct
12 Incorrect 489 ms 4324 KB Output isn't correct

Subtask #4
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 724 ms 4324 KB Output is correct
2 Correct 490 ms 4324 KB Output is correct
3 Correct 54 ms 4324 KB Output is correct
4 Correct 705 ms 4324 KB Output is correct
5 Incorrect 406 ms 4324 KB Output isn't correct
6 Incorrect 712 ms 4324 KB Output isn't correct
7 Correct 699 ms 4324 KB Output is correct
8 Incorrect 712 ms 4324 KB Output isn't correct
9 Incorrect 717 ms 4324 KB Output isn't correct
10 Correct 714 ms 4324 KB Output is correct
11 Correct 478 ms 4324 KB Output is correct
12 Correct 459 ms 4324 KB Output is correct
13 Correct 717 ms 4324 KB Output is correct
14 Incorrect 715 ms 4324 KB Output isn't correct
15 Incorrect 720 ms 4324 KB Output isn't correct
16 Correct 482 ms 4324 KB Output is correct
17 Correct 715 ms 4324 KB Output is correct