oj.uz

Submission #698065

# Submission time Handle Problem Language Result Execution time Memory
698065 2023-02-12T07:47:22 Z caganyanmaz Mobile (BOI12_mobile) C++14
8 / 100
 1000 ms 78532 KB 
#include <bits/stdc++.h>
#define int int64_t
#define f first
#define s second
#define mp make_pair
using namespace std;

bool check(double r, int L, const vector<array<int, 2>>& stations)
{
    set<pair<double, double>> intervals;
    for (const array<int, 2>& station : stations)
    {
        double diff_sqrd = r * r - station[1] * station[1];
        if (diff_sqrd < 0)
            continue;
        double diff = sqrt(diff_sqrd);
        double _l = station[0] - diff, _r = station[0] + diff;
        if (_l > L || _r < 0)
            continue;
        intervals.insert(mp(_l, _r));
    }
    if (intervals.begin()->f > 0)
        return false;
    double last = (*intervals.begin()).s;
    for (auto it = intervals.begin(); it != intervals.end() && last < L && it->f <= last; it++)
    {
        last = max(last, it->s);
    }
    return last >= L;
}

constexpr static int PRECISION = 1e5;

int32_t main()
{
    
    int N, L;
    cin >> N >> L;
    vector<array<int, 2>> stations(N);
    for (int i = 0; i < N; i++)
        for (int j = 0; j < 2; j++)
            cin >> stations[i][j];
    double l = 0, r = 4e9;
    while (r - l > 0.0001)
    {
        double m = (r+l)*0.5;
        if (check(m, L, stations))
            r = m;
        else
            l = m;
    }
    cout << r << "\n";
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 212 KB Output is correct

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 480 KB Output is correct
2 Correct 14 ms 440 KB Output is correct
3 Correct 7 ms 564 KB Output is correct
4 Incorrect 7 ms 512 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 688 KB Output is correct
2 Incorrect 31 ms 736 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 596 KB Output is correct
2 Incorrect 33 ms 748 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 596 KB Output is correct
2 Incorrect 30 ms 724 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 305 ms 6084 KB Output is correct
2 Incorrect 582 ms 7248 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 6396 KB Output is correct
2 Correct 264 ms 6500 KB Output is correct
3 Incorrect 252 ms 7568 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 739 ms 7048 KB Output is correct
2 Incorrect 731 ms 7856 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 659 ms 8012 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 392 ms 8140 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 39480 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1089 ms 39360 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1039 ms 47208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1060 ms 47148 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 55136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1093 ms 55016 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 62892 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1094 ms 62848 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 78464 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1087 ms 78532 KB Time limit exceeded
2 Halted 0 ms 0 KB -