oj.uz

Submission #1016071

# Submission time Handle Problem Language Result Execution time Memory
1016071 2024-07-07T11:14:09 Z BuzzyBeez Wish (LMIO19_noras) C++17
38 / 100
 1000 ms 6416 KB 
#include <bits/stdc++.h>
using namespace std;
// #define big __int128_t
#define big long long

const long double eps = 1e-12;
const long long inf = 1LL << 60;
const long long lim = 1e9;

long long R, sx, sy, sx2, sy2, vx, vy, l, r; big X, Y, Z, T;

bool check(long long a) { // is it in the circle
	if (a < 0) return 0;
	if (a > lim) return 0;
	return (sx + a * vx) * (sx + a * vx) + (sy + a * vy) * (sy + a * vy) <= R * R;
}

pair<long long, long long> p[200008];
vector<long long> tbc;

void compress() {sort(tbc.begin(), tbc.end()); tbc.resize(unique(tbc.begin(), tbc.end()) - tbc.begin());}
int order(long long key) {return lower_bound(tbc.begin(), tbc.end(), key) - tbc.begin() + 1;}

int upd[400008];

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, ans = 0, m = 0; cin >> n >> R;
	pair<long long, long long> range;
	for (int i = 1; i <= n; ++i) {
		cin >> sx >> sy >> sx2 >> sy2; vx = sx2 - sx; vy = sy2 - sy;
		X = vx * vx + vy * vy; Y = 2 * (sx * vx + sy * vy);
		Z = R * R - sx * sx - sy * sy; T = 4 * X * Z + Y * Y;
		if (T < 0) continue;
		l = (-Y - sqrtl(T)) / (2 * X); r = (-Y + sqrtl(T)) / (2 * X);
		range = {1, -1};
		// for (long long i = l - 50; i <= l + 50; ++i) if (check(i)) {range.first = i; break;}
		// for (long long i = r + 50; i >= r - 50; --i) if (check(i)) {range.second = i; break;}
		for (l = 0; l <= 20000; ++l) if (check(l)) {range.first = l; break;}
		for (r = 20000; r >= 0; --r) if (check(r)) {range.second = r; break;}
		// cout << i << ' ' << range.first << ' ' << range.second << '\n';
		// cout << X << ' ' << Y << ' ' << Z << ' ' << T << ' ' << l << ' ' << r << '\n';
		if (range.first <= range.second) {
			p[++m] = range;
			tbc.push_back(range.first); tbc.push_back(range.second);
		}
	}
	compress();
	for (int i = 1; i <= m; ++i) p[i].first = order(p[i].first), p[i].second = order(p[i].second);
	for (int i = 1; i <= m; ++i) ++upd[p[i].first], --upd[p[i].second + 1];
	for (int i = 1; i <= tbc.size() + 1; ++i) upd[i] += upd[i - 1];
	ans += *max_element(upd + 1, upd + tbc.size() + 1);
	cout << ans;
}

Compilation message

noras.cpp: In function 'int main()':
noras.cpp:52:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for (int i = 1; i <= tbc.size() + 1; ++i) upd[i] += upd[i - 1];
      |                  ~~^~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 18 ms 476 KB Output is correct
4 Correct 20 ms 2396 KB Output is correct
5 Correct 17 ms 2392 KB Output is correct
6 Correct 18 ms 344 KB Output is correct
7 Correct 19 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 2516 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 21 ms 532 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 21 ms 348 KB Output is correct
17 Correct 20 ms 344 KB Output is correct
18 Correct 21 ms 348 KB Output is correct
19 Correct 29 ms 524 KB Output is correct
20 Correct 29 ms 348 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 30 ms 348 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 18 ms 476 KB Output is correct
4 Correct 20 ms 2396 KB Output is correct
5 Correct 17 ms 2392 KB Output is correct
6 Correct 18 ms 344 KB Output is correct
7 Correct 19 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 2516 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 21 ms 532 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 21 ms 348 KB Output is correct
17 Correct 20 ms 344 KB Output is correct
18 Correct 21 ms 348 KB Output is correct
19 Correct 29 ms 524 KB Output is correct
20 Correct 29 ms 348 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 30 ms 348 KB Output is correct
23 Execution timed out 1063 ms 6416 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 18 ms 476 KB Output is correct
4 Correct 20 ms 2396 KB Output is correct
5 Correct 17 ms 2392 KB Output is correct
6 Correct 18 ms 344 KB Output is correct
7 Correct 19 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 2516 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 21 ms 532 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 21 ms 348 KB Output is correct
17 Correct 20 ms 344 KB Output is correct
18 Correct 21 ms 348 KB Output is correct
19 Correct 29 ms 524 KB Output is correct
20 Correct 29 ms 348 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 30 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 17 ms 2536 KB Output is correct
25 Correct 22 ms 344 KB Output is correct
26 Correct 30 ms 492 KB Output is correct
27 Correct 28 ms 500 KB Output is correct
28 Correct 29 ms 344 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 18 ms 476 KB Output is correct
4 Correct 20 ms 2396 KB Output is correct
5 Correct 17 ms 2392 KB Output is correct
6 Correct 18 ms 344 KB Output is correct
7 Correct 19 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 2516 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 21 ms 532 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 21 ms 348 KB Output is correct
17 Correct 20 ms 344 KB Output is correct
18 Correct 21 ms 348 KB Output is correct
19 Correct 29 ms 524 KB Output is correct
20 Correct 29 ms 348 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 30 ms 348 KB Output is correct
23 Execution timed out 1063 ms 6416 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 18 ms 476 KB Output is correct
4 Correct 20 ms 2396 KB Output is correct
5 Correct 17 ms 2392 KB Output is correct
6 Correct 18 ms 344 KB Output is correct
7 Correct 19 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 2516 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 21 ms 532 KB Output is correct
15 Correct 20 ms 344 KB Output is correct
16 Correct 21 ms 348 KB Output is correct
17 Correct 20 ms 344 KB Output is correct
18 Correct 21 ms 348 KB Output is correct
19 Correct 29 ms 524 KB Output is correct
20 Correct 29 ms 348 KB Output is correct
21 Correct 32 ms 2536 KB Output is correct
22 Correct 30 ms 348 KB Output is correct
23 Execution timed out 1063 ms 6416 KB Time limit exceeded
24 Halted 0 ms 0 KB -