传送门
牛客第三场,为什么要记录这题呢,唉,明明都想出来,但就算实现方式不好,以至于到结束还没做出来。。看了榜一的方法,真的觉得我一开始写的代码跟shi一样。。。
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<queue>
#include<set>
#include<map>
using namespace std;
#define LL long long
#define eps (1e-5)
const int maxn = 15;
struct node
{
int x, y, r;
}a[maxn];
int n, k, R, ans;
bool cmp(int mx, int my, int mr, int x1, int y1, int r1)
{
if ((mx - x1) * (mx - x1) + (my - y1) * (my - y1) <= (mr + r1) * (mr + r1))return true;
return false;
}
int tmpx[maxn], tmpy[maxn];
void dfs(int x)
{
if (x == k)
{
int tmp = 0;
for (int i = 1; i <= n; i++)
{
for (int j = 0; j < x; j++)
{
if (cmp(a[i].x, a[i].y, a[i].r, tmpx[j], tmpy[j], R))
{
tmp++;
break;
}
}
}
ans = max(ans, tmp);
return;
}
for (int i = -7; i <= 7; i++)
{
for (int j = -7; j <= 7; j++)
{
tmpx[x] = i, tmpy[x] = j;
dfs(x + 1);
}
}
}
int main()
{
scanf("%d%d%d", &n, &k, &R);
for (int i = 1; i <= n; i++)
{
scanf("%d%d%d", &a[i].x, &a[i].y, &a[i].r);
}
dfs(0);
printf("%d\n", ans);
return 0;
}