LD的EB１b １４０ pp 刚才批了, TSC non ref 文科 major# Immigration - 落地生根
b*d
1 楼
看了50遍但是对要求还是不解，求看得懂的解释一下。
要求写一段程序给所有juggler根据个人的意向，个人（H，E，P）的特点和每个组对（
H, E，P)值的要求最佳化分组。但是这个最佳化的条件我没看懂呀，尤其是这句话：In
fact we want to match jugglers to circuits such that no juggler could
switch to a circuit that they prefer more than the one they are assigned to
and be a better fit for that circuit than one of the other jugglers assigned
to it.
看不懂呀。。。
谁给中文解释一下。拜谢了先。。
全文如下：
2 - Juggle Fest
Many developers here are avid jugglers. To celebrate their prowess we are
organizing a Yodle Open JuggleFest, but we need your help planning it. There
will be thousands of participants split into teams. Each team will attempt
to complete a juggling circuit consisting of several tricks. Each circuit
emphasizes different aspects of juggling, requiring hand to eye coordination
(H), endurance (E) and pizzazz (P) in various amounts for successful
completion. Each juggler has these abilities in various amounts as well. How
good a match they are for a circuit is determined by the dot product of the
juggler’s and the circuit’s H, E, and P values. The higher the result,
the better the match.
Each participant will be on exactly one team and there will be a distinct
circuit for each team to attempt. Each participant will rank in order of
preference their top X circuits. Since we would like the audiences to enjoy
the performances as much as possible, when assigning jugglers to circuits we
also want to consider how well their skills match up to the circuit. In
fact we want to match jugglers to circuits such that no juggler could switch
to a circuit that they prefer more than the one they are assigned to and be
a better fit for that circuit than one of the other jugglers assigned to it.
To help us create the juggler/circuit assignments write a program in a
language of your choice that takes as input a file of circuits and jugglers
and outputs a file of circuits and juggler assignments. The number of
jugglers assigned to a circuit should be the number of jugglers divided by
the number of circuits. Assume that the number of circuits and jugglers will
be such that each circuit will have the same number of jugglers with no
remainder.
Input file
One line per circuit or juggler. All circuits will come before any jugglers.
Circuit lines start with a C and juggler lines start with a J. Names of
circuits and jugglers will never have spaces. A skill and the rating for
that skill are separated by a colon. Circuit lines have the circuit names
followed by skills. Juggler lines have the juggler names followed by skills,
followed by circuits in order of preference, separated by commas. Example:
C C0 H:7 E:7 P:10
C C1 H:2 E:1 P:1
C C2 H:7 E:6 P:4
J J0 H:3 E:9 P:2 C2,C0,C1
J J1 H:4 E:3 P:7 C0,C2,C1
J J2 H:4 E:0 P:10 C0,C2,C1
J J3 H:10 E:3 P:8 C2,C0,C1
J J4 H:6 E:10 P:1 C0,C2,C1
J J5 H:6 E:7 P:7 C0,C2,C1
J J6 H:8 E:6 P:9 C2,C1,C0
J J7 H:7 E:1 P:5 C2,C1,C0
J J8 H:8 E:2 P:3 C1,C0,C2
J J9 H:10 E:2 P:1 C1,C2,C0
J J10 H:6 E:4 P:5 C0,C2,C1
J J11 H:8 E:4 P:7 C0,C1,C2
Output file
One line per circuit assignment. Each line should contain the circuit name
followed by the juggler name, followed by that juggler’s circuits in order
of preference and the match score for that circuit. The line should include
all jugglers matched to the circuit. The example below is a valid assignment
for the input file above.
AroundTheWorld Bob AroundTheWorld:131 Factory:146, Ann AroundTheWorld:130
Factory:126
Factory Sam Factory:184 AroundTheWorld:175, Jen AroundTheWorld:116 Factory:
127
要求写一段程序给所有juggler根据个人的意向，个人（H，E，P）的特点和每个组对（
H, E，P)值的要求最佳化分组。但是这个最佳化的条件我没看懂呀，尤其是这句话：In
fact we want to match jugglers to circuits such that no juggler could
switch to a circuit that they prefer more than the one they are assigned to
and be a better fit for that circuit than one of the other jugglers assigned
to it.
看不懂呀。。。
谁给中文解释一下。拜谢了先。。
全文如下：
2 - Juggle Fest
Many developers here are avid jugglers. To celebrate their prowess we are
organizing a Yodle Open JuggleFest, but we need your help planning it. There
will be thousands of participants split into teams. Each team will attempt
to complete a juggling circuit consisting of several tricks. Each circuit
emphasizes different aspects of juggling, requiring hand to eye coordination
(H), endurance (E) and pizzazz (P) in various amounts for successful
completion. Each juggler has these abilities in various amounts as well. How
good a match they are for a circuit is determined by the dot product of the
juggler’s and the circuit’s H, E, and P values. The higher the result,
the better the match.
Each participant will be on exactly one team and there will be a distinct
circuit for each team to attempt. Each participant will rank in order of
preference their top X circuits. Since we would like the audiences to enjoy
the performances as much as possible, when assigning jugglers to circuits we
also want to consider how well their skills match up to the circuit. In
fact we want to match jugglers to circuits such that no juggler could switch
to a circuit that they prefer more than the one they are assigned to and be
a better fit for that circuit than one of the other jugglers assigned to it.
To help us create the juggler/circuit assignments write a program in a
language of your choice that takes as input a file of circuits and jugglers
and outputs a file of circuits and juggler assignments. The number of
jugglers assigned to a circuit should be the number of jugglers divided by
the number of circuits. Assume that the number of circuits and jugglers will
be such that each circuit will have the same number of jugglers with no
remainder.
Input file
One line per circuit or juggler. All circuits will come before any jugglers.
Circuit lines start with a C and juggler lines start with a J. Names of
circuits and jugglers will never have spaces. A skill and the rating for
that skill are separated by a colon. Circuit lines have the circuit names
followed by skills. Juggler lines have the juggler names followed by skills,
followed by circuits in order of preference, separated by commas. Example:
C C0 H:7 E:7 P:10
C C1 H:2 E:1 P:1
C C2 H:7 E:6 P:4
J J0 H:3 E:9 P:2 C2,C0,C1
J J1 H:4 E:3 P:7 C0,C2,C1
J J2 H:4 E:0 P:10 C0,C2,C1
J J3 H:10 E:3 P:8 C2,C0,C1
J J4 H:6 E:10 P:1 C0,C2,C1
J J5 H:6 E:7 P:7 C0,C2,C1
J J6 H:8 E:6 P:9 C2,C1,C0
J J7 H:7 E:1 P:5 C2,C1,C0
J J8 H:8 E:2 P:3 C1,C0,C2
J J9 H:10 E:2 P:1 C1,C2,C0
J J10 H:6 E:4 P:5 C0,C2,C1
J J11 H:8 E:4 P:7 C0,C1,C2
Output file
One line per circuit assignment. Each line should contain the circuit name
followed by the juggler name, followed by that juggler’s circuits in order
of preference and the match score for that circuit. The line should include
all jugglers matched to the circuit. The example below is a valid assignment
for the input file above.
AroundTheWorld Bob AroundTheWorld:131 Factory:146, Ann AroundTheWorld:130
Factory:126
Factory Sam Factory:184 AroundTheWorld:175, Jen AroundTheWorld:116 Factory:
127
