Submission #284584

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
284584	2020-08-27T16:55:30 Z	Benq	Mobile (BOI12_mobile)	C++14	100 / 100	301 ms	32504 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	1 ms	384 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct

Subtask #2
4.0 / 4.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
4.0 / 4.0

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

Subtask #5
4.0 / 4.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	1280 KB	Output is correct
2	Correct	21 ms	1408 KB	Output is correct
3	Correct	13 ms	1024 KB	Output is correct
4	Correct	20 ms	1536 KB	Output is correct
5	Correct	10 ms	768 KB	Output is correct

Subtask #8
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	15 ms	1152 KB	Output is correct
2	Correct	16 ms	1152 KB	Output is correct
3	Correct	20 ms	1408 KB	Output is correct
4	Correct	22 ms	1536 KB	Output is correct
5	Correct	29 ms	1784 KB	Output is correct

Subtask #9
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	3064 KB	Output is correct
2	Correct	23 ms	1536 KB	Output is correct
3	Correct	18 ms	2168 KB	Output is correct
4	Correct	30 ms	2296 KB	Output is correct
5	Correct	18 ms	1280 KB	Output is correct

Subtask #10
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	1916 KB	Output is correct
2	Correct	23 ms	1792 KB	Output is correct
3	Correct	19 ms	1568 KB	Output is correct
4	Correct	30 ms	2444 KB	Output is correct
5	Correct	24 ms	1664 KB	Output is correct

Subtask #11
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	25 ms	2688 KB	Output is correct
2	Correct	22 ms	1784 KB	Output is correct
3	Correct	19 ms	1536 KB	Output is correct
4	Correct	30 ms	2304 KB	Output is correct
5	Correct	24 ms	1664 KB	Output is correct

Subtask #12
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	105 ms	16376 KB	Output is correct
2	Correct	113 ms	8056 KB	Output is correct
3	Correct	111 ms	7584 KB	Output is correct
4	Correct	149 ms	9992 KB	Output is correct
5	Correct	121 ms	7160 KB	Output is correct

Subtask #13
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	112 ms	8568 KB	Output is correct
2	Correct	119 ms	7672 KB	Output is correct
3	Correct	102 ms	7392 KB	Output is correct
4	Correct	149 ms	9848 KB	Output is correct
5	Correct	131 ms	7800 KB	Output is correct

Subtask #14
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	126 ms	19596 KB	Output is correct
2	Correct	147 ms	9616 KB	Output is correct
3	Correct	126 ms	9080 KB	Output is correct
4	Correct	173 ms	12280 KB	Output is correct
5	Correct	139 ms	8312 KB	Output is correct

Subtask #15
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	128 ms	10232 KB	Output is correct
2	Correct	138 ms	9080 KB	Output is correct
3	Correct	114 ms	7932 KB	Output is correct
4	Correct	180 ms	12148 KB	Output is correct
5	Correct	153 ms	9096 KB	Output is correct

Subtask #16
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	141 ms	22904 KB	Output is correct
2	Correct	166 ms	11384 KB	Output is correct
3	Correct	149 ms	10488 KB	Output is correct
4	Correct	228 ms	13944 KB	Output is correct
5	Correct	155 ms	9464 KB	Output is correct

Subtask #17
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	163 ms	12024 KB	Output is correct
2	Correct	164 ms	10488 KB	Output is correct
3	Correct	162 ms	10248 KB	Output is correct
4	Correct	211 ms	13692 KB	Output is correct
5	Correct	173 ms	10488 KB	Output is correct

Subtask #18
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	159 ms	26012 KB	Output is correct
2	Correct	168 ms	12920 KB	Output is correct
3	Correct	164 ms	12024 KB	Output is correct
4	Correct	233 ms	15992 KB	Output is correct
5	Correct	190 ms	11512 KB	Output is correct

Subtask #19
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	221 ms	13688 KB	Output is correct
2	Correct	187 ms	11768 KB	Output is correct
3	Correct	150 ms	11416 KB	Output is correct
4	Correct	234 ms	15864 KB	Output is correct
5	Correct	200 ms	11896 KB	Output is correct

Subtask #20
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	207 ms	32504 KB	Output is correct
2	Correct	243 ms	15880 KB	Output is correct
3	Correct	205 ms	15096 KB	Output is correct
4	Correct	297 ms	19704 KB	Output is correct
5	Correct	236 ms	13944 KB	Output is correct

Subtask #21
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	235 ms	17016 KB	Output is correct
2	Correct	238 ms	14584 KB	Output is correct
3	Correct	205 ms	14456 KB	Output is correct
4	Correct	301 ms	19724 KB	Output is correct
5	Correct	257 ms	15096 KB	Output is correct

Submission #284584

Compilation message