Submission #86945

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
86945	2018-11-28T16:50:25 Z	popovicirobert	Mobile (BOI12_mobile)	C++14	53 / 100	782 ms	132096 KB

mobile

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

using namespace std;

const long double eps = 1e-9;
const long double INF = 1e18;
const int MAXN = (int) 1e6;

struct Point {
    long double x, y;
}pts[MAXN + 1];

inline long double dist(Point a, Point b) {
    return sqrt(1LL * (a.x - b.x) * (a.x - b.x) + 1LL * (a.y - b.y) * (a.y - b.y));
}

struct Data {
    long double l, r;
    int id;
};

vector <Data> stk;

inline bool eq(long double a, long double b) {
    return fabs(a - b) < eps;
}

long double L;

inline bool ok(long double &l, long double &r, Point b) {
    Point a = pts[stk.back().id];
    if(eq(a.x, b.x)) {
        return 0;
    }
    long double x = 1.0 * (b.x * b.x + b.y * b.y - a.x * a.x - a.y * a.y) / (2 * (b.x - a.x));
    if(x > L) {
        return 0;
    }
    x = max(x, (long double) 0.0);
    if(x - stk.back().l > 0) {
        stk.back().r = x;
        l = x;
        r = L;
        return 0;
    }
    l = stk.back().l;
    r = L;
    return 1;
}

int main() {
    //ifstream cin("B.in");
    //ofstream cout("B.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin >> n >> L;
    for(i = 1; i <= n; i++) {
        cin >> pts[i].x >> pts[i].y;
    }
    stk.push_back({0, L, 1});
    for(i = 2; i <= n; i++) {
        long double l = INF, r = -INF;
        while(!stk.empty()) {
            if(ok(l, r, pts[i])) {
                stk.pop_back();
            }
            else {
                break;
            }
        }
        if(r - l > 0) {
            stk.push_back({l, r, i});
        }
    }
    long double ans = 0;
    for(auto it : stk) {
        ans = max(ans, dist(pts[it.id], {it.l, 0}));
        ans = max(ans, dist(pts[it.id], {it.r, 0}));
    }
    cout << fixed << setprecision(20) << ans;
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	380 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	592 KB	Output is correct
4	Correct	2 ms	592 KB	Output is correct

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	744 KB	Output is correct
2	Correct	7 ms	928 KB	Output is correct
3	Correct	5 ms	928 KB	Output is correct
4	Correct	5 ms	928 KB	Output is correct

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	1176 KB	Output is correct
2	Correct	5 ms	1228 KB	Output is correct
3	Correct	5 ms	1296 KB	Output is correct
4	Correct	5 ms	1336 KB	Output is correct
5	Incorrect	5 ms	1336 KB	Output isn't correct

Subtask #7
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	48 ms	4604 KB	Output is correct
2	Correct	54 ms	5484 KB	Output is correct
3	Correct	34 ms	5512 KB	Output is correct
4	Correct	58 ms	7168 KB	Output is correct
5	Incorrect	30 ms	7168 KB	Output isn't correct

Subtask #8
0 / 5.0

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

Subtask #9
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	59 ms	15648 KB	Output is correct
2	Correct	61 ms	15648 KB	Output is correct
3	Correct	69 ms	15648 KB	Output is correct
4	Correct	116 ms	15648 KB	Output is correct
5	Correct	53 ms	15648 KB	Output is correct

Subtask #10
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	72 ms	16284 KB	Output is correct
2	Correct	71 ms	17784 KB	Output is correct
3	Correct	94 ms	19308 KB	Output is correct
4	Correct	79 ms	20728 KB	Output is correct
5	Correct	68 ms	21972 KB	Output is correct

Subtask #11
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	83 ms	25140 KB	Output is correct
2	Correct	69 ms	25140 KB	Output is correct
3	Correct	64 ms	26472 KB	Output is correct
4	Correct	79 ms	27868 KB	Output is correct
5	Correct	66 ms	29192 KB	Output is correct

Subtask #12
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	328 ms	70792 KB	Output is correct
2	Correct	348 ms	70792 KB	Output is correct
3	Correct	344 ms	70792 KB	Output is correct
4	Correct	385 ms	70792 KB	Output is correct
5	Correct	332 ms	70792 KB	Output is correct

Subtask #13
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	360 ms	70792 KB	Output is correct
2	Correct	331 ms	70792 KB	Output is correct
3	Correct	291 ms	70792 KB	Output is correct
4	Correct	377 ms	70792 KB	Output is correct
5	Correct	353 ms	70792 KB	Output is correct

Subtask #14
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	413 ms	99436 KB	Output is correct
2	Correct	411 ms	99436 KB	Output is correct
3	Correct	423 ms	99436 KB	Output is correct
4	Correct	462 ms	99436 KB	Output is correct
5	Correct	409 ms	99436 KB	Output is correct

Subtask #15
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	439 ms	99436 KB	Output is correct
2	Correct	401 ms	99436 KB	Output is correct
3	Correct	358 ms	99436 KB	Output is correct
4	Correct	471 ms	99436 KB	Output is correct
5	Correct	403 ms	99436 KB	Output is correct

Subtask #16
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	477 ms	106632 KB	Output is correct
2	Correct	492 ms	106632 KB	Output is correct
3	Correct	497 ms	106632 KB	Output is correct
4	Correct	537 ms	106632 KB	Output is correct
5	Correct	437 ms	106632 KB	Output is correct

Subtask #17
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	497 ms	106632 KB	Output is correct
2	Correct	483 ms	106632 KB	Output is correct
3	Correct	452 ms	106632 KB	Output is correct
4	Correct	563 ms	106632 KB	Output is correct
5	Correct	506 ms	106632 KB	Output is correct

Subtask #18
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	549 ms	109688 KB	Output is correct
2	Correct	614 ms	109688 KB	Output is correct
3	Correct	550 ms	109688 KB	Output is correct
4	Correct	636 ms	109688 KB	Output is correct
5	Incorrect	599 ms	111436 KB	Output isn't correct

Subtask #19
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	602 ms	111436 KB	Output is correct
2	Correct	556 ms	123608 KB	Output is correct
3	Runtime error	547 ms	132096 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
4	Halted	0 ms	0 KB	-

Subtask #20
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	782 ms	132096 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Subtask #21
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	720 ms	132096 KB	Memory limit exceeded: We have a known bug that the memory usage is measured incorrectly (possibly because of Meltdown/Spectre patch), so your solution may be correct. Please submit again. Sorry for the inconvenience.
2	Halted	0 ms	0 KB	-

Submission #86945

Compilation message