Submission #670725

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
670725	2022-12-10T02:02:59 Z	thiago_bastos	Wish (LMIO19_noras)	C++17	23 / 100	206 ms	9392 KB

noras

#include "bits/stdc++.h"

using namespace std;

#define INF 1000000000
#define INFLL 1000000000000000000ll
#define EPS 1e-9
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define fi first
#define sc second

using i64 = long long;
using u64 = unsigned long long;
using ld = long double;
using ii = pair<int, int>;

#define double ld

int n, radius;

double closest(int a, int b, int c, int d) {
	if(1ll*a*a+1ll*b*b <= 1ll * radius*radius) return 0;
	return max(0.0L, (-1ll * a * c - 1ll * b * d) / double(1ll*c*c+1ll*d*d));
}

double firstSec(int a, int b, int c, int d, double k) {
	double l = 0, r = k;
	while(fabs(l - r) > EPS) {
		double m = (l + r) / 2;
		double x = a + m * c, y = b + m * d;
		if(x * x + y * y <= 1ll * radius * radius) r = m;
		else l = m;
	}
	return r;
}

double secondSec(int a, int b, int c, int d, double k) {
	double l = k, r = 1e9;
	while(fabs(l - r) > EPS) {
		double m = (l + r) / 2;
		double x = a + m * c, y = b + m * d;
		if(x * x + y * y > 1ll * radius * radius) r = m;
		else l = m;
	}
	return r;
}

void solve() {
	cin >> n >> radius;

	set<ii> sweep;
	int opening = 0, ans = 0;

	for(int i = 1; i <= n; ++i) {
		int a, b, c, d;

		cin >> a >> b >> c >> d;

		c -= a, d -= b;

		double k = closest(a, b, c, d);

		if(hypot(a + k * c, b + k * d) - radius > EPS) continue;	

		double l = firstSec(a, b, c, d, k);
		double r = secondSec(a, b, c, d, k);
		
		int L = (int)ceil(l), R = floor(r);
		
		if(L > R) continue;
		
		sweep.emplace(L, -i);
		sweep.emplace(R, i);
	}

	for(auto [x, k] : sweep) {
		opening += k < 0 ? 1 : -1;
		ans = max(ans, opening);
	}
	
	cout << ans << '\n';
}

int main() {
	ios_base :: sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t--) solve();
	return 0;
}

Subtask #1
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	3 ms	340 KB	Output is correct
15	Correct	3 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	3 ms	340 KB	Output is correct
19	Correct	2 ms	340 KB	Output is correct
20	Correct	2 ms	328 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct

Subtask #2
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	3 ms	340 KB	Output is correct
15	Correct	3 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	3 ms	340 KB	Output is correct
19	Correct	2 ms	340 KB	Output is correct
20	Correct	2 ms	328 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Incorrect	206 ms	9392 KB	Output isn't correct
24	Halted	0 ms	0 KB	-

Subtask #3
0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	3 ms	340 KB	Output is correct
15	Correct	3 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	3 ms	340 KB	Output is correct
19	Correct	2 ms	340 KB	Output is correct
20	Correct	2 ms	328 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Incorrect	2 ms	340 KB	Output isn't correct
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	3 ms	340 KB	Output is correct
15	Correct	3 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	3 ms	340 KB	Output is correct
19	Correct	2 ms	340 KB	Output is correct
20	Correct	2 ms	328 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Incorrect	206 ms	9392 KB	Output isn't correct
24	Halted	0 ms	0 KB	-

Subtask #5
0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	2 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	3 ms	340 KB	Output is correct
15	Correct	3 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	2 ms	340 KB	Output is correct
18	Correct	3 ms	340 KB	Output is correct
19	Correct	2 ms	340 KB	Output is correct
20	Correct	2 ms	328 KB	Output is correct
21	Correct	3 ms	340 KB	Output is correct
22	Correct	2 ms	340 KB	Output is correct
23	Incorrect	206 ms	9392 KB	Output isn't correct
24	Halted	0 ms	0 KB	-

Submission #670725

Compilation message

Subtask #1 23.0 / 23.0

Subtask #2 0 / 23.0

Subtask #3 0 / 15.0

Subtask #4 0 / 32.0

Subtask #5 0 / 7.0

Subtask #1
23.0 / 23.0

Subtask #2
0 / 23.0

Subtask #3
0 / 15.0

Subtask #4
0 / 32.0

Subtask #5
0 / 7.0