oj.uz

Submission #1093459

# Submission time Handle Problem Language Result Execution time Memory
1093459 2024-09-26T20:46:39 Z selmahbn Mobile (BOI12_mobile) C++17
0 / 100
 608 ms 48208 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pdl pair<double, ll>

double sp(double x1, double y1, double x2, double y2) {
    double top = x2*x2 - x1*x1 + y2*y2 - y1*y1;
    double bottom = 2*x2 - 2*x1;
    return top/bottom;
}

int main()
{
    ll n; double l;
    cin >> n >> l;
    vector<pdl> p(n);
    ll li = -1;
    vector<double> x(n);
    vector<double> y(n);
    for (ll i = 0; i < n; i++) {
        cin >> x[i] >> y[i];
        double last;
        bool gleich = false;
        while (li >= 0) {
            double lsp, i2;
            tie(lsp, i2) = p[li];
            if (x[i] == x[i2]) {
                gleich = true;
                break;
            }
            double csp = sp(x[i], y[i], x[i2], y[i2]);
            if (csp <= lsp) {
                li--;
            } else {
                last = csp;
                break;
            }
        }
        if (gleich) continue;
        if (li == -1) p[0] = make_pair(0, i);
        else p[li+1] = make_pair(last, i);
        li++;
    }
    double maxi = 0;
    ll last = p[0].second;
    for (ll i = 0; i <= li; i++) {
        double csp, ci;
        tie(csp, ci) = p[i];
        if (csp > l || i == li) {
            if (i == li) last = ci;
            double dist = sqrt((x[last]-l)*(x[last]-l)+y[last]*y[last]);
            maxi = max(maxi, dist);
        }
        double dist = sqrt((x[ci]-csp)*(x[ci]-csp)+y[ci]*y[ci]);
        maxi = max(maxi, dist);
        last = ci;
    }
    cout << maxi;
    return 0;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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 2 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 Incorrect 3 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

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

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

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

Subtask #10
0 / 5.0

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

Subtask #11
0 / 5.0

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

Subtask #12
0 / 5.0

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

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 298 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 Incorrect 263 ms 24144 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

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

Subtask #17
0 / 5.0

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

Subtask #18
0 / 5.0

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

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 498 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 Incorrect 422 ms 40272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #21
0 / 5.0

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