oj.uz

Submission #1095250

# Submission time Handle Problem Language Result Execution time Memory
1095250 2024-10-01T16:25:13 Z buzdi Mobile (BOI12_mobile) C++17
0 / 100
 315 ms 71508 KB 
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <set>
#define ll long long

using namespace std;

const int NMAX = 1e6;
const long double EPS = 1e-3;

struct Point {
    long double x, y;
    void read() {
        cin >> x >> y;
    }
}points[NMAX + 1];

int n, l, ind_st;
long double answer;
pair<int, long double> st[NMAX + 1];

long double Square(long double x) {
    return x * x;
}

long double Distance(Point p1, Point p2) {
    return sqrt(Square(p1.x - p2.x) + Square(p1.y - p2.y));
}

long double WhereBetter(Point p1, Point p2) {
    return (long double)(Square(p2.x) + Square(p2.y) - Square(p1.x) - Square(p1.y)) / (long double)(2 * (p2.x - p1.x));
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> l;
    for (int i = 1; i <= n; i++) {
        points[i].read();
    }

    for (int i = 1; i <= n; i++) {
        if (ind_st >= 1 && points[i].x == points[st[ind_st].first].x) {
            continue;
        }

        if (ind_st >= 1 && WhereBetter(points[i], points[st[ind_st].first]) > l) {
            continue;
        }

        while (ind_st >= 1 && WhereBetter(points[i], points[st[ind_st].first]) < st[ind_st].second) {
            ind_st--;
        }

        if (ind_st == 0) {
            st[++ind_st] = { i, 1 };
        }
        else {
            long double x = WhereBetter(points[i], points[st[ind_st].first]);
            st[++ind_st] = { i, x };
        }
    }

    for (int i = 1; i <= ind_st; i++) {
        answer = max(answer, max(Distance(points[st[i].first], { st[i].second, 0 }), Distance(points[st[i].first], { (i == ind_st ? l : st[i + 1].second - EPS), 0 })));
    }
    cout << fixed << setprecision(6) << answer << '\n';

    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Incorrect 2 ms 600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Incorrect 2 ms 600 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 6492 KB Output is correct
2 Incorrect 23 ms 4064 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 5664 KB Output is correct
2 Incorrect 27 ms 4952 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 36180 KB Output is correct
2 Incorrect 138 ms 23632 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #13
0 / 5.0

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

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 42960 KB Output is correct
2 Incorrect 169 ms 28304 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 198 ms 50256 KB Output is correct
2 Incorrect 199 ms 33124 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 57428 KB Output is correct
2 Incorrect 219 ms 37716 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

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

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 260 ms 71508 KB Output is correct
2 Incorrect 299 ms 47036 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

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