编程介的小学生 2019-12-07 09:48 采纳率: 20.5%
浏览 67

Campus Recruit 怎么代码正确实现

Problem Description
With the new recruiting season's coming, lots of famous corporations come on campus to recruit new employees.

There are m corporations numbered from 1 to m, each of which has certain available positions for hiring students. The total number of the available positions is P. There are n students numbered from 1 to n. It is guaranteed that P ≤ n. Each corporation has a different preference for each student, which is denoted by an positive integer; the bigger the better. Each student has a different preference for each corporation, which is denoted by an positive integer; the bigger the better. All the preference numbers are not greater than 10,000.

The task, naturally, is to find a way of assigning each student to at most one corporation. In such a way, all available positions in all corporations are filled. Meanwhile we hope the assignment is stable. We say that the assignment is stable if neither of the following situations arises.

First type of instability: There are two students s and s', and a corporation c. The assignment is instable if

  • s is assigned to c, and

  • s' is assigned to no corporation, and

  • c prefers s' to s.

Second type of instability: There are two students s and s', and two corporations c and c'. The assignment is instable if

  • s is assigned to c, and

  • s' is assigned to c', and

  • c prefers s' to s, and

  • s' prefers c to c'.

We would like to find a stable assignment. Can you solve it?

Input
The input contains several cases. The first line of each case contains two integers m (1 ≤ m ≤ 100) and n (1 ≤ n ≤ 1000), indicating the number of corporations and students. This is followed by one line, containing m integers, in which the ith number indicates the number of available positions of ith corporation. This is followed by m lines, each containing n integers, in which the jth element of the ith line indicates the preference of the ith corporation to the jth student. This is followed by n lines, each containing m integers, in which the jth element of the ith line indicates the preference of the ith student to the jth corporation. The input ends with m=0 and n=0.

Output
For each case, output one line, containing n integers separated by exactly one space, in which the ith number indicates the corporation the ith student is assigned to (0 means the ith student is assigned to no corporation). Please output a new blank line after each case. If there are several solutions to one case, you may output any one of them.

Sample Input
2 3
1 1
3 2 1
2 3 1
1 2
2 1
1 2
2 3
1 1
3 2 1
2 3 1
1 2
2 1
1 2
0 0

Sample Output
1 2 0

1 2 0

  • 写回答

0条回答 默认 最新

    报告相同问题?

    悬赏问题

    • ¥15 seatunnel-web使用SQL组件时候后台报错,无法找到表格
    • ¥15 fpga自动售货机数码管(相关搜索:数字时钟)
    • ¥15 用前端向数据库插入数据,通过debug发现数据能走到后端,但是放行之后就会提示错误
    • ¥30 3天&7天&&15天&销量如何统计同一行
    • ¥30 帮我写一段可以读取LD2450数据并计算距离的Arduino代码
    • ¥15 飞机曲面部件如机翼,壁板等具体的孔位模型
    • ¥15 vs2019中数据导出问题
    • ¥20 云服务Linux系统TCP-MSS值修改?
    • ¥20 关于#单片机#的问题:项目:使用模拟iic与ov2640通讯环境:F407问题:读取的ID号总是0xff,自己调了调发现在读从机数据时,SDA线上并未有信号变化(语言-c语言)
    • ¥20 怎么在stm32门禁成品上增加查询记录功能