Calender Colors

最新推荐文章于 2022-05-31 15:24:56 发布

阿龙的圈子

最新推荐文章于 2022-05-31 15:24:56 发布

阅读量728

点赞数 1

分类专栏： DFS 文章标签： ACM

本文链接：https://blog.csdn.net/DoJintian/article/details/47948205

版权

DFS 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Calender Colors

Taro is a member of a programming contest circle. In this circle, the members manage their schedules in the system called Great Web Calender.

Taro has just added some of his friends to his calendar so that he can browse their schedule on his calendar. Then he noticed that the system currently displays all the schedules in only one color, mixing the schedules for all his friends. This is difficult to manage because it's hard to tell whose schedule each entry is.

But actually this calender system has the feature to change the color of schedule entries, based on the person who has the entries. So Taro wants to use that feature to distinguish their plans by color.

Given the colors Taro can use and the number of members, your task is to calculate the subset of colors to color all schedule entries. The colors are given by "Lab color space".

In Lab color space, the distance between two colors is defined by the square sum of the difference of each element. Taro has to pick up the subset of colors that maximizes the sum of distances of all color pairs in the set.

Input

The input is like the following style.

N M
L_{0} a_{0} b_{0}
L_{1} a_{1} b_{1}
...
L_{N-1} a_{N-1} b_{N-1}

The first line contains two integers N and M (0 ¥leq M ¥leq N ¥leq 20), where N is the number of colors in the input, and M is the number of friends Taro wants to select the colors for. Each of the following N lines contains three decimal integers L(0.0 ¥leq L ¥leq 100.0), a(-134.0 ¥leq a ¥leq 220.0) and b(-140.0 ¥leq b ¥leq 122.0) which represents a single color in Lab color space.

Output

Output the maximal of the total distance. The output should not contain an error greater than 10^{-5}.

Sample Input 1

3 2
0 0 0
10 10 10
100 100 100

Output for the Sample Input 1

30000.00000000000000000000

Sample Input 2

5 3
12.0 15.0 9.0
10.0 -3.0 2.2
3.5 6.8 9.0
2.1 4.4 5.9
1.2 4.0 -5.4

Output for the Sample Input 2

1003.44000000000005456968

Sample Input 3

2 1
1.0 1.0 1.0
0.0 0.0 0.0

Output for the Sample Input 3

0.00000000000000000000

#include <algorithm>
#include <functional>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>

using namespace std;
#define INF 0x3f3f3f3f
#define LL long long
#define N 22

struct point
{
    double l, a, b;
} C[N];

double ans ;
int num[N];
int n, m;

double dist(point t1, point t2)
{
    return (t1.l - t2.l) * (t1.l - t2.l) + (t1.a - t2.a) * (t1.a - t2.a) + (t1.b - t2.b) * (t1.b - t2.b);
}


void dfs(int s, int cnt, double sum)
{
    //cout<<sum<<endl;
    if(cnt > 1)
        for(int i = 1; i < s; i++)
            if(num[i])
            {
                sum += dist(C[s] , C[i]);
            }

    if(cnt == m)
    {
        ans = max(ans, sum);
        return ;
    }
    for(int i = s + 1; i <= n; i++)
    {
        if(!num[i])
        {
            num[i] = 1;
            dfs(i, cnt + 1, sum);
            num[i] = 0;
        }
    }
}

int main()
{
    while(~scanf("%d%d", &n, &m))
    {
        ans = -INF;
        for(int i = 1; i <= n; i++)
            int tmp = scanf( "%lf%lf%lf", &C[i].l, &C[i].a, &C[i].b );
        //cout<<dist(C[1], C[2])<<endl;
        memset(num, 0, sizeof num);
        dfs(0, 0, 0.0);
        printf("%lf\n", ans);
    }
    return 0;
}


/*

3 2
0 0 0
10 10 10
100 100 100

5 3
12.0 15.0 9
10 -3 2.2
3.5 6.8 9
2.1 4.4 5.9
1.2 4 -5.4

2 1
1 1 1
0 0 0
*/