Submission #639130

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
639130	2022-09-08T16:30:01 Z	luanaamorim	Mobile (BOI12_mobile)	C++14	0 / 100	1000 ms	16076 KB

mobile

#include <iostream>
#include <queue>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstring>
#include <set>
#include <stack>
#include <bitset>
#define dbug(x) cout << (#x) << " -> " << x << endl
#define ll long long
#define INF (1e9 + 5)
#define MAX (int) (2e6 + 5)
#define MOD 1000000007
#define par pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(x) (int) ((x).size())
#define esq(x) (x<<1)
#define dir(x) ((x<<1)|1)
#define lsb(x) (x & -x)
#define W(x) cout << #x << ": " << x << endl
#define Wii(x) cout << x.first << ' ' << x.second << endl
#define _ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

double l, n, a[MAX], b[MAX];

int check(double raio)
{
	double fim = 0;
	for (int i = 0; i < n; i++)
	{
		if (raio < b[i]) continue;
		double prox_fim = a[i] + sqrt((raio*raio) - (b[i]*b[i]));
		double prox_ini = a[i] - (sqrt((raio*raio) - (b[i]*b[i])));
		if (prox_ini <= fim) fim = prox_fim;
	}

	return (fim >= l);
}

int main()
{_
	cin >> n >> l;
	for (int i = 0; i < n; i++)
		cin >> a[i] >> b[i];

	int cnt = 100;
	double meio, ini = 0, fim = INF;
	while (cnt--)
	{
		meio = (ini+fim)/2;
		if (check(meio)) fim = meio;
		else ini = meio;
	}

	cout << fixed << setprecision(6) << fim << endl;
}

Subtask #1
0 / 4.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 4.0

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

Subtask #5
0 / 4.0

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

Subtask #6
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	340 KB	Output is correct
2	Correct	5 ms	340 KB	Output is correct
3	Correct	4 ms	340 KB	Output is correct
4	Incorrect	8 ms	424 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #7
0 / 5.0

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

Subtask #8
0 / 5.0

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

Subtask #9
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	61 ms	1692 KB	Output is correct
2	Correct	82 ms	1640 KB	Output is correct
3	Correct	60 ms	1728 KB	Output is correct
4	Incorrect	165 ms	1884 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #10
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	1768 KB	Output is correct
2	Correct	95 ms	1868 KB	Output is correct
3	Correct	69 ms	1868 KB	Output is correct
4	Incorrect	157 ms	1884 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #11
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	85 ms	1836 KB	Output is correct
2	Correct	81 ms	1884 KB	Output is correct
3	Correct	66 ms	1796 KB	Output is correct
4	Incorrect	157 ms	1880 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #12
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	345 ms	8040 KB	Output is correct
2	Correct	402 ms	8220 KB	Output is correct
3	Correct	387 ms	8148 KB	Output is correct
4	Incorrect	791 ms	8168 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #13
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	425 ms	8212 KB	Output is correct
2	Incorrect	529 ms	8136 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #14
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	425 ms	9628 KB	Output is correct
2	Correct	486 ms	9816 KB	Output is correct
3	Correct	468 ms	9616 KB	Output is correct
4	Incorrect	973 ms	9720 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #15
0 / 5.0

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

Subtask #16
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	503 ms	11348 KB	Output is correct
2	Correct	570 ms	11276 KB	Output is correct
3	Correct	568 ms	11372 KB	Output is correct
4	Execution timed out	1091 ms	11188 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #17
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	583 ms	11348 KB	Output is correct
2	Incorrect	765 ms	11288 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #18
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	539 ms	12848 KB	Output is correct
2	Correct	655 ms	12772 KB	Output is correct
3	Correct	700 ms	12840 KB	Output is correct
4	Execution timed out	1085 ms	12780 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #19
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	670 ms	12844 KB	Output is correct
2	Incorrect	880 ms	12856 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #20
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	691 ms	16076 KB	Output is correct
2	Correct	818 ms	16004 KB	Output is correct
3	Correct	777 ms	15856 KB	Output is correct
4	Execution timed out	1080 ms	15956 KB	Time limit exceeded
5	Halted	0 ms	0 KB	-

Subtask #21
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	823 ms	15972 KB	Output is correct
2	Incorrect	999 ms	16052 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Submission #639130

Compilation message