牛客 Fruit Ninja 随机大法

最新推荐文章于 2022-09-05 22:17:29 发布

mmk27

最新推荐文章于 2022-09-05 22:17:29 发布

阅读量153

点赞数

本文链接：https://blog.csdn.net/mmk27_word/article/details/100987057

版权

链接：https://ac.nowcoder.com/acm/contest/163/A
来源：牛客网

题目描述

Fruit Ninja is a juicy action game enjoyed by millions of players around the world, with squishy,
splat and satisfying fruit carnage! Become the ultimate bringer of sweet, tasty destruction with every slash.
Fruit Ninja is a very popular game on cell phones where people can enjoy cutting the fruit by touching the screen.
In this problem, the screen is rectangular, and all the fruits can be considered as a point. A touch is a straight line cutting
thought the whole screen, all the fruits in the line will be cut.
A touch is EXCELLENT if MN\frac{M}{N}NM ≥ x, (N is total number of fruits in the screen, M is the number of fruits that cut by the touch, x is a real number.)
Now you are given N fruits position in the screen, you want to know if exist a EXCELLENT touch.

输入描述:

The first line of the input is T(1≤ T ≤ 100), which stands for the number of test cases you need to solve.
The first line of each case contains an integer N (1 ≤ N ≤ 104) and a real number x (0 < x < 1), as mentioned above.
The real number will have only 1 digit after the decimal point.
The next N lines, each lines contains two integers xi and yi (-109 ≤ xi,yi ≤ 109), denotes the coordinates of a fruit.

输出描述:

For each test case, output "Yes" if there are at least one EXCELLENT touch. Otherwise, output "No".

示例1

输入

复制

输出

复制

Yes
No

题意：是否存在直线上的点数 / n >= x

题解：随机500次，找出两个点，然后判断这条线上的点数。神奇不。因为如果某条直线上有很多点，那么随机到这条线的概率就会很大。

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e4 + 10;
ll x[N], y[N];
int n;
double p;
int main() {
	int T;
	int l, r;
	int cnt;
	int flag;
	scanf("%d", &T);
	while(T--) {
		scanf("%d %lf", &n, &p);
		for(int i = 1; i <= n; i++) scanf("%lld %lld", &x[i], &y[i]);
		flag = 0;
		for(int i = 1; i <= 500; i++) {
			l = rand() % n + 1;
			r = rand() % n + 1;
			if(l == r) continue;
			cnt = 0;
			for(int j = 1; j <= n; j++) {
				if((x[j] - x[l]) * (y[r] - y[j]) == (x[r] - x[j]) * (y[j] - y[l])) cnt++;
			}
			if(1.0 * cnt / n >= p) {
				flag = 1;
				break;
			}
		}
		printf(flag ? "Yes\n" : "No\n");
	}
	return 0;
}