Game on Plane

题目链接

题意：Alice选择k条直线,Bob任意画一条直线,问Bob画的直线和Alice选择的直线最少有多少条相交?Alice的目标是使结果尽可能大,Bob反之

解析:贪心即可,Bob为了使结果尽可能小,显然会画尽可能多的与当前直线平行的直线,Alice则要使选择的直线中平行线尽可能少

AcCode:

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

#define pint std::pair<int,int>
#define pai std::pair<std::pair<int,int>,int>

std::map<pint, int> mp;
std::vector<pai> vec;

inline bool cmp(pai a, pai b) { return a.second > b.second; }

inline int gcd(int a, int b) { while (b) { int c = b; b = a % b; a = c; }return a; }

signed main() {
	int t; scanf("%d", &t);
	while (t--) {
		mp.clear();
		vec.clear();
		int n; scanf("%d", &n);
		for (int i = 1, a, b, c, d; i <= n; i++) {
			scanf("%d %d %d %d", &a, &b, &c, &d);
			int y = d - b, x = c - a;
			int g = gcd(x, y);
			x /= g, y /= g;
			if (x <= 0 && y <= 0) x = -x, y = -y;
			pint p = std::make_pair(x, y);
			mp[p]++;
		}
		int out = 0;
		for (auto& m : mp) {
			pai p = std::make_pair(m.first, m.second);
			vec.push_back(p);
		}
		sort(vec.begin(), vec.end(), cmp);
		while (!vec.empty()) {
			printf("%d\n", out);
			vec.front().second--;
			int sz = vec.size();
			for (int i = 1; i < sz; i++) {
				printf("%d\n", ++out);
				vec[i].second--;
			}
			while (!vec.empty() && vec.back().second == 0) vec.pop_back();
		}
	}
}