CFGym 102299 H Course recommendation

Description

One of the biggest challenges in an online course platform is to recommend to a student one of its over 800 courses.

For instance, João took courses on Java and Java for the Web, with grades 10 and 9, respectively. What should he be recommended next? If we recommend him something much easier, much harder, or simply something that does not go with his profile, we will waste his time. Just as an undergraduate student is very careful for choosing the appropriate courses and not waste a semester due to poor choices, we wish to help students in this platform to make the best choices.

In this problem, we have (N) students and (M) courses. Students are numbered from 1 to (N), the courses from (1) to (M). For each student, we know which courses he or she already took and the respective grades. To recommend a course to a student, we first find another student who is closest to him or her. The distance between two students is defined as the euclidean distance between the grades of the courses both students took. If there are no shared courses, the distance is defined as infinity. Among the courses already taken by the closest student, we recommend the course with the highest grade which was not already taken by the original student. In case of a tie, recommend the course with the smallest index. If the original student already took all the courses that were taken by his closest student, no recommendation is make.

Your task is to code a program that recommend a course to all the students in the platform.

Input

The first line has two integers N

and M

, the number of students and courses, respectively. After this there are (N) blocks of lines, each one contains a line with an integer (Q_i), the amount of courses already taken by the (i)th student, and then (Q_i) lines, each one containing two integers (c) and (g), which indicate that the (i)th student got grade (g) for course (c).

Constraints

• 2≤N≤100

•  
• 1≤M≤100
•  
• 1≤Qi,c≤M
•  
• 0≤g≤10

•  
• You may assume that each student has already taken at least one course that another student took.

Output

Print (N) lines, where the (i)th line has the course recommended to the (i)th student. If student (i) has already taken all courses that his closest student already took, print (-1).

Sample Input

Input

2 3
2
1 10
2 10
2
2 9
3 5

Output

3
1

Input

2 4
3
1 7
2 8
3 10
3
4 10
2 9
1 5

Output

4
3

Hint

In the first example, the distance between students is given by √(10−9)2

 

In the second, it is given by √(7−5)2+(8−9)2

题意：n个人，m个课程，第i个人学了k门课程，每门成绩是bi，现在，他要推荐他成绩最高且对方没学学过的课程给离他最近的同学，距离定义为：两个个人学的共同课程中，每门课差的平方的和。问每个人被推荐的课程是什么

思路：直接模拟，注意一个如果一个人和多个人距离相同，那么选序号最小的同学就行

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define ll long long
#define maxn 150
struct node
{
    int fs,id;
}a[maxn];
int b[maxn][maxn];
int main()
{
    int n,m;
    scanf("%d %d",&n,&m);
    memset(b,-1,sizeof(b));
    for(int i=1;i<=n;i++)
    {
        int k;
        scanf("%d",&k);
        for(int j=1;j<=k;j++)
        {
            int x,y;
            scanf("%d %d",&x,&y);
            b[i][x]=y;
        }
    }
    for(int i=1;i<=n;i++)
    {
        int min1=99999999;
        for(int j=1;j<=n;j++)
        {
            if(i==j) continue;
            int sum=0,flag=0;
            for(int k=1;k<=m;k++)
            {
                if(b[i][k]!=-1&&b[j][k]!=-1)
                {
                    sum+=(b[i][k]-b[j][k])*(b[i][k]-b[j][k]);
                    flag=1;
                }
            }
            if(min1>sum&&flag==1)
            {
                min1=sum;
            }
        }int max2=-1;
        for(int j=1;j<=n;j++)
        {
            if(i==j) continue;
            int sum=0,flag=0;
            for(int k=1;k<=m;k++)
            {
                if(b[i][k]!=-1&&b[j][k]!=-1)
                {
                    flag=1;
                    sum+=(b[i][k]-b[j][k])*(b[i][k]-b[j][k]);
                }
            }
            if(sum==min1&&flag==1)
            {
                for(int k=1;k<=m;k++)
                {
                    if(max2<b[j][k]&&b[i][k]==-1&&b[j][k]!=-1)
                    {
                        a[i].id=k;
                        max2=b[j][k];
                    }
                    else if(max2==b[j][k]&&b[i][k]==-1&&b[j][k]!=-1)
                    {
                        if(k<a[i].id) a[i].id=k;
                    }
                }
                break;
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(a[i].id==0) printf("-1\n");
        else printf("%d\n",a[i].id);
    }
}