oj.uz

Submission #14308

# Submission time Handle Problem Language Result Execution time Memory
14308 2015-05-11T16:15:15 Z gs14004 Be Two Bees (OJUZ10_b2b) C++14
100 / 100
 98 ms 2644 KB 
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
 
int n;
int h[100005], u[100005];
long long S;
 
double tmp[100005];
 
int r1, r2;
bool trial(double t){
    for (int i=0; i<n; i++) {
        tmp[i] = h[i] + t / u[i];
    }
    double ret = 0;
    auto *pt = max_element(tmp,tmp+n);
    ret += *pt;
    r1 = (int)(pt - tmp) + 1;
    *pt = -1e18;
    pt = max_element(tmp,tmp+n);
    ret += *pt;
    r2 = (int)(pt - tmp) + 1;
    return ret >= S;
}
 
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",&u[i]);
    }
    double s = 0, e = 1e15;
    for (int i=0; i<50; i++) {
        double m = (s+e)/2;
        if(trial(m)) e = m;
        else s = m;
    }
    printf("%d %d",min(r1,r2),max(r1,r2));
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2644 KB Output is correct
2 Correct 0 ms 2644 KB Output is correct
3 Correct 0 ms 2644 KB Output is correct
4 Correct 0 ms 2644 KB Output is correct
5 Correct 0 ms 2644 KB Output is correct
6 Correct 0 ms 2644 KB Output is correct
7 Correct 0 ms 2644 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2644 KB Output is correct
2 Correct 0 ms 2644 KB Output is correct
3 Correct 0 ms 2644 KB Output is correct
4 Correct 0 ms 2644 KB Output is correct
5 Correct 0 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 0 ms 2644 KB Output is correct
8 Correct 0 ms 2644 KB Output is correct
9 Correct 0 ms 2644 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2644 KB Output is correct
2 Correct 85 ms 2644 KB Output is correct
3 Correct 84 ms 2644 KB Output is correct
4 Correct 55 ms 2644 KB Output is correct
5 Correct 93 ms 2644 KB Output is correct
6 Correct 89 ms 2644 KB Output is correct
7 Correct 59 ms 2644 KB Output is correct
8 Correct 85 ms 2644 KB Output is correct
9 Correct 89 ms 2644 KB Output is correct
10 Correct 55 ms 2644 KB Output is correct
11 Correct 94 ms 2644 KB Output is correct
12 Correct 46 ms 2644 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 2644 KB Output is correct
2 Correct 86 ms 2644 KB Output is correct
3 Correct 85 ms 2644 KB Output is correct
4 Correct 97 ms 2644 KB Output is correct
5 Correct 98 ms 2644 KB Output is correct
6 Correct 58 ms 2644 KB Output is correct
7 Correct 94 ms 2644 KB Output is correct
8 Correct 86 ms 2644 KB Output is correct
9 Correct 88 ms 2644 KB Output is correct
10 Correct 47 ms 2644 KB Output is correct
11 Correct 60 ms 2644 KB Output is correct
12 Correct 93 ms 2644 KB Output is correct
13 Correct 92 ms 2644 KB Output is correct
14 Correct 96 ms 2644 KB Output is correct
15 Correct 32 ms 2644 KB Output is correct
16 Correct 98 ms 2644 KB Output is correct
17 Correct 89 ms 2644 KB Output is correct