POJ 1015 Jury Compromise
来源:互联网 发布:pc6软件下载中心 编辑:程序博客网 时间:2024/04/20 18:06
Jury Compromise
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14666 Accepted: 3757 Special Judge
Description
In Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general public. Every time a trial is set to begin, a jury has to be selected, which is done as follows. First, several people are drawn randomly from the public. For each person in this pool, defence and prosecution assign a grade from 0 to 20 indicating their preference for this person. 0 means total dislike, 20 on the other hand means that this person is considered ideally suited for the jury.
Based on the grades of the two parties, the judge selects the jury. In order to ensure a fair trial, the tendencies of the jury to favour either defence or prosecution should be as balanced as possible. The jury therefore has to be chosen in a way that is satisfactory to both parties.
We will now make this more precise: given a pool of n potential jurors and two values di (the defence's value) and pi (the prosecution's value) for each potential juror i, you are to select a jury of m persons. If J is a subset of {1,..., n} with m elements, then D(J ) = sum(dk) k belong to J
and P(J) = sum(pk) k belong to J are the total values of this jury for defence and prosecution.
For an optimal jury J , the value |D(J) - P(J)| must be minimal. If there are several jurys with minimal |D(J) - P(J)|, one which maximizes D(J) + P(J) should be selected since the jury should be as ideal as possible for both parties.
You are to write a program that implements this jury selection process and chooses an optimal jury given a set of candidates.
Based on the grades of the two parties, the judge selects the jury. In order to ensure a fair trial, the tendencies of the jury to favour either defence or prosecution should be as balanced as possible. The jury therefore has to be chosen in a way that is satisfactory to both parties.
We will now make this more precise: given a pool of n potential jurors and two values di (the defence's value) and pi (the prosecution's value) for each potential juror i, you are to select a jury of m persons. If J is a subset of {1,..., n} with m elements, then D(J ) = sum(dk) k belong to J
and P(J) = sum(pk) k belong to J are the total values of this jury for defence and prosecution.
For an optimal jury J , the value |D(J) - P(J)| must be minimal. If there are several jurys with minimal |D(J) - P(J)|, one which maximizes D(J) + P(J) should be selected since the jury should be as ideal as possible for both parties.
You are to write a program that implements this jury selection process and chooses an optimal jury given a set of candidates.
Input
The input file contains several jury selection rounds. Each round starts with a line containing two integers n and m. n is the number of candidates and m the number of jury members.
These values will satisfy 1<=n<=200, 1<=m<=20 and of course m<=n. The following n lines contain the two integers pi and di for i = 1,...,n. A blank line separates each round from the next.
The file ends with a round that has n = m = 0.
These values will satisfy 1<=n<=200, 1<=m<=20 and of course m<=n. The following n lines contain the two integers pi and di for i = 1,...,n. A blank line separates each round from the next.
The file ends with a round that has n = m = 0.
Output
For each round output a line containing the number of the jury selection round ('Jury #1', 'Jury #2', etc.).
On the next line print the values D(J ) and P (J ) of your jury as shown below and on another line print the numbers of the m chosen candidates in ascending order. Output a blank before each individual candidate number.
Output an empty line after each test case.
On the next line print the values D(J ) and P (J ) of your jury as shown below and on another line print the numbers of the m chosen candidates in ascending order. Output a blank before each individual candidate number.
Output an empty line after each test case.
Sample Input
4 2 1 2 2 3 4 1 6 2 0 0
Sample Output
Jury #1 Best jury has value 6 for prosecution and value 4 for defence: 2 3
Hint
If your solution is based on an inefficient algorithm, it may not execute in the allotted time.
Source
Southwestern European Regional Contest 1996
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAXN 210
using namespace std;
int sub[MAXN],plus[MAXN];
int f[21][900],path[21][900];//f[i][j],取了i个候选人后相差为j,并且总和为f[i][j]
int ans[21];
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out3.txt","w",stdout);
int n,m;
int cas=1;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(n==0&&m==0) break;
for(int i=1;i<=n;i++)
{
int a,b;
scanf("%d%d",&a,&b);
sub[i]=a-b;
plus[i]=a+b;
}
memset(f,-1,sizeof(f));
memset(path,-1,sizeof(path));
int size=20*m;
f[0][size]=0;
path[0][size]=0;
for(int i=1;i<=n;i++)
if(f[1][size+sub[i]]<plus[i])//或者是没有或者是不够大
{
f[1][size+sub[i]]=plus[i];
path[1][size+sub[i]]=i;
}
for(int i=1;i<m;i++)
for(int j=0;j<=2*size;j++)
if(path[i][j]>=0)//是>=0
{
for(int k=1;k<=n;k++)
if(f[i+1][j+sub[k]]<f[i][j]+plus[k])
{
int ii,jj;
for(ii=i,jj=j;ii>=1;ii--)
{
if(path[ii][jj]==k) break;
jj-=sub[path[ii][jj]];
}
if(ii<1)
{
path[i+1][j+sub[k]]=k;
f[i+1][j+sub[k]]=f[i][j]+plus[k];
}
}
}
int tt;
for(int j=0;j<=2*size;j++)//取绝对值最小的作为最优解
{
if(f[m][size+j]>=0||f[m][size-j]>=0)
{
if(f[m][size+j]>f[m][size-j])
tt=size+j;
else tt=size-j;
break;
}
}
printf("Jury #%d/n",cas++);
printf("Best jury has value %d for prosecution and value %d for defence:/n",(f[m][tt]-size+tt)/2,(f[m][tt]+size-tt)/2);
int k=0;
int ii,jj;
for(ii=m,jj=tt;ii>=1;ii--)
{
ans[k++]=path[ii][jj];
jj-=sub[path[ii][jj]];
}
sort(ans,ans+k);
for(int i=0;i<k;i++) printf(" %d",ans[i]);
printf("/n/n");
}
return 0;
}
- POJ 1015 Jury Compromise
- poj 1015 Jury Compromise
- POJ 1015 Jury Compromise
- poj 1015Jury Compromise
- POJ 1015 Jury Compromise
- poj 1015 Jury Compromise
- POJ 1015 Jury Compromise
- poj 1015 Jury Compromise
- poj 1015 Jury Compromise
- POJ 1015 Jury Compromise
- POJ 1015 Jury Compromise
- [POJ][1015]Jury Compromise
- POJ 1015 - Jury Compromise
- POJ 1015 Jury Compromise
- POJ 1015 Jury Compromise
- POJ 1015 Jury Compromise
- POJ 1015 Jury Compromise
- POJ 1015: Jury Compromise
- 专家对Symbian开发人员的22条建议
- Volatile C++ [keyword] [轉]
- vector 用法
- 第一个个人博客
- 海量日志数据,提取出某日访问百度次数最多的那个IP。
- POJ 1015 Jury Compromise
- java annotation (注解)之我见(一)
- 利用ContentValues.put()方法,通过程序添加通讯录里的联系人资料
- 摄像头坏了
- CXF之Dispatch ,Provider直接处理xml数据实例
- The problem of “Can’t exit design mode because control ‘ShockwaveFlash1’ cannot be created.”
- 如何让IE地址栏的主页变成灰色
- B2C网站运营核心数据分析模型
- C++成员变量、函数修饰符与访问权限