E - K-colinear Line

// Problem: D - Range Count Query
// Contest: AtCoder - UNIQUE VISION Programming Contest 2022（AtCoder Beginner Contest 248）
// URL: https://atcoder.jp/contests/abc248/tasks/abc248_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// 2022-04-16 20:07:28
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;   
typedef vector<ll> Vll;               
typedef vector<pair<int, int> > vpii;
typedef vector<pair<ll, ll> > vpll;                        

const ll mod = 1e9 + 7;
//const ll mod = 998244353;
const double pi  = acos(-1.0);
inline ll ksc(ll x,ll y,ll mod)
{
    ll ans = 0;
    while (y) {
    	if (y & 1)
    		ans = (ans + x) %mod;
    	y >>= 1;
    	x = (x + x) %mod;
	}
	return ans;
}
inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a;
		a = a * a;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
// inline ll inv (ll a) {
	// return qmi(a, mod - 2);
// }

int n;
bool flag[300][300];
ll px[300], py[300];


bool cmp (int a, int b, int c) {
	ll n1 = (py[b] - py[a])* (px[c] - px[a]);
	ll n2 = (px[b] - px[a]) * (py[c] - py[a]);
	return (n1 == n2);
}
void solve() {
	int m;
	cin >> n >> m;
	if (m == 1) {
		puts("Infinity");
		return;
	}
	for (int i = 0; i < n;i  ++) {
		cin >> px[i] >> py[i];
	}
	
	vector<int> list;
	int ans = 0;
	for (int i = 0; i < n; i ++) {
		for (int j = i + 1; j < n; j++) {
			if (flag[i][j]) continue;
			list.clear();
			list.pb(i); 
			list.pb(j);
			for (int k = j+ 1; k < n; k ++) {
				if (cmp(i, j, k)) {
					list.pb(k);
				}
			}
			if (list.size() >= m)
				ans ++;
			for (int i1 = 0; i1 < list.size(); i1 ++)
				for (int j1 = i1 + 1; j1 < list.size(); j1 ++)
					flag[list[i1]][list[j1]] = 1;
		}
	}
	cout << ans << endl;
}
int main () {
	// ios::sync_with_stdio(0),cin.tie(0), cout.tie(0);
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

这题主要在于比较方式，题解给的比较方式非常方便，还有就是重复性的判断，对于已经在一条线上的点，我们直接用flag[i][j]去掉