Submission #59182

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
59182	2018-07-20T22:48:54 Z	Benq	Mobile (BOI12_mobile)	C++14	65 / 100	331 ms	132096 KB

mobile

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 1000001;

int N,L;
pi v[MX];
ld tmp[MX];

ld perp(pd x, pd y) {
    return (y.f*y.f+y.s*y.s-x.f*x.f-x.s*x.s)/(2*y.f-2*x.f);
}

ld dist(pd a, pd b) {
    return sqrt(pow(a.f-b.f,2)+pow(a.s-b.s,2));
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> L;
    int nex = 0;
    F0R(i,N) {
        int x,y; cin >> x >> y; y = abs(y);
        if (nex && v[nex-1].f == x) {
            if (y >= v[nex-1].s) continue;
            else nex --;
        }
        while (nex && tmp[nex-1] >= perp(v[nex-1],{x,y})) nex --;
        v[nex] = {x,y};
        if (nex) tmp[nex] = perp(v[nex-1],v[nex]);
        nex ++;
    }
    ld ans = 0;
    F0R(i,nex) {
        ld mn = (i == 0 ? -INF : tmp[i]);
        ld mx = (i == nex-1 ? INF : tmp[i+1]);
        if (mx < 0 || mn > L) continue;
        mn = max(mn,(ld)0), mx = min(mx,(ld)L);
        ans = max(ans,dist(v[i],{mn,0}));
        ans = max(ans,dist(v[i],{mx,0}));
    }
    cout << fixed << setprecision(6) << ans;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	488 KB	Output is correct
3	Correct	2 ms	488 KB	Output is correct
4	Correct	3 ms	556 KB	Output is correct

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	600 KB	Output is correct
2	Correct	3 ms	620 KB	Output is correct
3	Correct	4 ms	672 KB	Output is correct
4	Correct	5 ms	776 KB	Output is correct

Subtask #4
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	776 KB	Output is correct
2	Correct	6 ms	776 KB	Output is correct
3	Correct	5 ms	972 KB	Output is correct
4	Correct	4 ms	972 KB	Output is correct

Subtask #5
4.0 / 4.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	972 KB	Output is correct
2	Correct	5 ms	1016 KB	Output is correct
3	Correct	4 ms	1084 KB	Output is correct
4	Correct	4 ms	1124 KB	Output is correct

Subtask #6
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	1196 KB	Output is correct
2	Correct	5 ms	1248 KB	Output is correct
3	Correct	4 ms	1316 KB	Output is correct
4	Correct	5 ms	1416 KB	Output is correct
5	Correct	4 ms	1436 KB	Output is correct

Subtask #7
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	35 ms	2372 KB	Output is correct
2	Correct	25 ms	3420 KB	Output is correct
3	Correct	14 ms	3996 KB	Output is correct
4	Correct	32 ms	5116 KB	Output is correct
5	Correct	11 ms	5516 KB	Output is correct

Subtask #8
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	6292 KB	Output is correct
2	Correct	19 ms	7036 KB	Output is correct
3	Correct	28 ms	8100 KB	Output is correct
4	Correct	32 ms	9252 KB	Output is correct
5	Correct	37 ms	10712 KB	Output is correct

Subtask #9
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	13456 KB	Output is correct
2	Correct	26 ms	13456 KB	Output is correct
3	Correct	26 ms	14408 KB	Output is correct
4	Correct	50 ms	15504 KB	Output is correct
5	Correct	27 ms	16540 KB	Output is correct

Subtask #10
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	34 ms	17980 KB	Output is correct
2	Correct	36 ms	19404 KB	Output is correct
3	Correct	32 ms	20552 KB	Output is correct
4	Correct	52 ms	22476 KB	Output is correct
5	Correct	45 ms	23660 KB	Output is correct

Subtask #11
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	36 ms	26072 KB	Output is correct
2	Correct	30 ms	26564 KB	Output is correct
3	Correct	22 ms	27716 KB	Output is correct
4	Correct	37 ms	29536 KB	Output is correct
5	Correct	28 ms	30820 KB	Output is correct

Subtask #12
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	140 ms	46848 KB	Output is correct
2	Correct	166 ms	46848 KB	Output is correct
3	Correct	137 ms	50116 KB	Output is correct
4	Correct	189 ms	59624 KB	Output is correct
5	Correct	155 ms	66504 KB	Output is correct

Subtask #13
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	162 ms	74592 KB	Output is correct
2	Correct	138 ms	81900 KB	Output is correct
3	Correct	126 ms	87976 KB	Output is correct
4	Correct	193 ms	96408 KB	Output is correct
5	Correct	197 ms	97220 KB	Output is correct

Subtask #14
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	148 ms	111216 KB	Output is correct
2	Correct	171 ms	111216 KB	Output is correct
3	Correct	150 ms	111216 KB	Output is correct
4	Correct	196 ms	111216 KB	Output is correct
5	Correct	180 ms	111216 KB	Output is correct

Subtask #15
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	168 ms	111216 KB	Output is correct
2	Correct	223 ms	113972 KB	Output is correct
3	Correct	236 ms	120688 KB	Output is correct
4	Runtime error	237 ms	131752 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.
5	Halted	0 ms	0 KB	-

Subtask #16
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	216 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 #17
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	226 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 #18
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	229 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 #19
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	253 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 #20
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	306 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	331 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 #59182

Compilation message