oj.uz

답안 #14350

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
14350 2015-05-12T10:51:12 Z comet Be Two Bees (OJUZ10_b2b) C++
0 / 100
 166 ms 4324 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
ll sum,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("%lld",&H[i]);
		sum+=H[i];
    }
    for(int i=0;i<n;i++){
        scanf("%lld",&T[i]);
    }
    double lo=0,hi=1e18,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);
}

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 Incorrect 0 ms 4324 KB Output isn't correct
6 Correct 0 ms 4324 KB Output is correct
7 Incorrect 0 ms 4324 KB Output isn't correct

Subtask #2
0.0 / 22.0

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

Subtask #3
0.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 54 ms 4324 KB Output isn't correct
2 Incorrect 94 ms 4324 KB Output isn't correct
3 Correct 156 ms 4324 KB Output is correct
4 Correct 79 ms 4324 KB Output is correct
5 Incorrect 162 ms 4324 KB Output isn't correct
6 Incorrect 155 ms 4324 KB Output isn't correct
7 Correct 100 ms 4324 KB Output is correct
8 Correct 158 ms 4324 KB Output is correct
9 Incorrect 108 ms 4324 KB Output isn't correct
10 Correct 153 ms 4324 KB Output is correct
11 Correct 158 ms 4324 KB Output is correct
12 Correct 161 ms 4324 KB Output is correct

Subtask #4
0.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 165 ms 4324 KB Output isn't correct
2 Incorrect 166 ms 4324 KB Output isn't correct
3 Incorrect 160 ms 4324 KB Output isn't correct
4 Correct 162 ms 4324 KB Output is correct
5 Incorrect 156 ms 4324 KB Output isn't correct
6 Correct 144 ms 4324 KB Output is correct
7 Correct 155 ms 4324 KB Output is correct
8 Correct 111 ms 4324 KB Output is correct
9 Correct 155 ms 4324 KB Output is correct
10 Correct 161 ms 4324 KB Output is correct
11 Incorrect 162 ms 4324 KB Output isn't correct
12 Correct 55 ms 4324 KB Output is correct
13 Correct 161 ms 4324 KB Output is correct
14 Incorrect 93 ms 4324 KB Output isn't correct
15 Correct 160 ms 4324 KB Output is correct
16 Correct 159 ms 4324 KB Output is correct
17 Correct 110 ms 4324 KB Output is correct