Load Balancing

Time Limit: 20 Sec

Memory Limit: 256 MB

题目连接

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=83008#problem/H

Description

The infamous University of Kala Jadu (UKJ) have been operating underground for the last fourteen centuries training very select few students the dangerous art of black magic. However, with the recent trend of going digital, they too wanted to try out a bit of public exposure by enrolling students in their new distance education program.
Within the first three semesters they have got 6,789 students enrolled. The forkaclone spell allows them to clone their teachers to train at most 10,000 students in a running semester. But they do not have the server capacity to handle 10,000 students to register for their courses right at the beginning of the semester during their 4-day registration period. Sadly, their art of black magic (or kala jadu, as they say), only works on humans, it cannot be extended to their web server running on a Pentium IV machine.
UKJ server administrators realized that if they could split the load on the server and balance it somehow, then they can still handle 10,000 students per semester. Their idea is to divide the students into roughly 4 equal groups A, B, C and D. Each group would then be given one day to register; no other group can register on that same day — they will get their turn. They wanted to use total number of credits completed by a student as the deciding factor to assign students to the 4 different groups. As the students who would register can have completed any integer number of credits between 0 to 160, one easy group assignment would be:
0 - 40 credits completed: group A
41 - 80 credits completed: group B
81 - 120 credits completed: group C
121 - 160 credits completed: group D
A bit of analysis of the number of students that may fall in these groups revealed that the number of students in each group vary greatly. So this particular idea of splitting students into 4 groups to balance the server load does not quite work out.
UKJ seeks your help in finding the credit boundaries that can create an optimal distribution of students so that each group roughly have the same number of students. You’d suggest three integers a, b and c to distribute the students as follows:
0 - a credits completed: group A
a + 1 - b credits completed: group B
b + 1 - c credits completed: group C
c + 1 - 160 credits completed: group D
If the total number of students is N, the best possible scenario would place N/4 students in each group. You need to minimize the sum of difference, d between N/4 and the number of student you place in each group. For example, given N = 8 students to distribute, if you divide them into a group of 3, 0, 3, 2 students then the difference with N/4 for the groups would be 1, 2, 1, 0 respectively. This results in 1 + 2 + 1 + 0 = 4 as sum of differences. This is what you’d have to minimize. Note that, N/4 can be a floating point number.

Input

The input description for the problem starts with T (1 < T 100) — the number of test cases, then T test cases follow. The first line of each case starts with the number of students N (0 < N 10000). The next N lines contains the number of credits (always integer), Ci (0 Ci 160) the i-th student have completed prior to this registration.

Output

Output for each test case will start with the test case label (starting with 1, and formatted as shown in sample output.) The label will be followed by three integers, a, b and c (0 a < b < c < 160) denoting the group boundaries as described in the problem. If there are multiple such boundaries possible with the same d value, then pick the solution that has the smallest a value. If there is a tie, then pick the one with the smallest b value. If even that fails to break the tie, then pick the solution with the smallest c value.

Sample Input

280
40
41
80
85
120
150
155
90
40
41
80
85
120
121
150
155

Sample Output

Case 1: 40 80 120
Case 2: 40 80 120

HINT

题意

这个学校要把学生按照分数分为四等人,要求每一等的人数都差不多

问你分界线是多少

题解:

直接暴力枚举分界线就吼了……

代码

#include <cstdio>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <typeinfo>
#include <fstream>
#include <map>
#include <stack>
typedef long long ll;
using namespace std;
//freopen("D.in","r",stdin);
//freopen("D.out","w",stdout);
#define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
#define test freopen("test.txt","r",stdin)
#define maxn 2000001
#define mod 1000000007
#define eps 1e-9
const int inf=0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3fLL;
inline ll read()
{
ll x=,f=;char ch=getchar();
while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
return x*f;
}
//************************************************************************************** int a[maxn];
double b[];
int main()
{
int t=read();
for(int cas=;cas<=t;cas++)
{
memset(b,,sizeof(b));
int n=read();
for(int i=;i<n;i++)
a[i]=read(),b[a[i]]++;
for(int i=;i<=;i++)
b[i]+=b[i-];
double ans=inf;
int ans1,ans2,ans3;
double pp=n/4.0;
for(int i=;i<;i++)
{
for(int j=i+;j<;j++)
{
for(int k=j+;k<;k++)
{
if(abs(b[i]-pp)+abs(b[j]-b[i]-pp)+abs(b[k]-b[j]-pp)+abs(n-b[k]-pp)<ans)
{
ans=abs(b[i]-pp)+abs(b[j]-b[i]-pp)+abs(b[k]-b[j]-pp)+abs(n-b[k]-pp);
ans1=i,ans2=j,ans3=k;
}
}
}
}
printf("Case %d: %d %d %d",cas,ans1,ans2,ans3);
printf("\n");
}
}

UVA 12904 Load Balancing 暴力的更多相关文章

  1. 【架构】How To Use HAProxy to Set Up MySQL Load Balancing

    How To Use HAProxy to Set Up MySQL Load Balancing Dec  2, 2013 MySQL, Scaling, Server Optimization U ...

  2. CF# Educational Codeforces Round 3 C. Load Balancing

    C. Load Balancing time limit per test 2 seconds memory limit per test 256 megabytes input standard i ...

  3. Codeforces Educational Codeforces Round 3 C. Load Balancing 贪心

    C. Load Balancing 题目连接: http://www.codeforces.com/contest/609/problem/C Description In the school co ...

  4. Load Balancing 折半枚举大法好啊

    Load Balancing 给出每个学生的学分.   将学生按学分分成四组,使得sigma (sumi-n/4)最小.         算法:   折半枚举 #include <iostrea ...

  5. [zz] pgpool-II load balancing from FAQ

    It seems my pgpool-II does not do load balancing. Why? First of all, pgpool-II' load balancing is &q ...

  6. How Network Load Balancing Technology Works--reference

    http://technet.microsoft.com/en-us/library/cc756878(v=ws.10).aspx In this section Network Load Balan ...

  7. Network Load Balancing Technical Overview--reference

    http://technet.microsoft.com/en-us/library/bb742455.aspx Abstract Network Load Balancing, a clusteri ...

  8. How Node.js Multiprocess Load Balancing Works

    As of version 0.6.0 of node, load multiple process load balancing is available for node. The concept ...

  9. NGINX Load Balancing – TCP and UDP Load Balancer

    This chapter describes how to use NGINX Plus and open source NGINX to proxy and load balance TCP and ...

随机推荐

  1. 对web日志文件实现按照人员、行为分类

    日志格式: method,time,name in,2015-05-06 17:37:46,Jenny1out,2015-05-06 17:37:46,Judith1in,2015-05-06 17: ...

  2. bzoj 1806 [Ioi2007]Miners 矿工配餐(DP)

    [题目链接] http://www.lydsy.com/JudgeOnline/problem.php?id=1806 [题意] 给定一个权在1..3内的序列,在保持相对位置不变的情况下拆分成两个序列 ...

  3. 关于DIV+CSS和XHTML+CSS的理解

    WEB标准是一系列标准的集合,并不是仅“DIV+CSS”布局就可以实现.以CSS网页布局只是标准的基础之一.“DIV+CSS”布局只是一种通俗的称呼罢了.而我们学习的目标在于以XHTML建立良好的语义 ...

  4. 指向函数的指针数组(C++)

    我们能够创建一个指向函数的指针数组.为了选择一个函数,只需要使用数组的下标,然后间接引用这个指针.这种方式支持表格式驱动码的概念:可以根据状态变量去选择被执行函数,而不用条件语句或case语句.这种设 ...

  5. kali2 source

    deb http://http.kali.org/kali sana main non-free contrib deb http://security.kali.org/kali-security/ ...

  6. Embedded之Introduction

    1 Embedded system An embedded system is a combination of computer hardware and software, and perhaps ...

  7. 【WPF】ContentControl Style定义与使用出现问题后 -- 引发的思考

    一.背景  使用WPF的朋友,大家都很喜欢采用定义控件的公共样式,以便整个框架对该资源的使用,好处就是可以达到代码复用.系统风格统一等: 1. 定义资源       <Style TargetT ...

  8. openstack-dbs

    真正的服务器派生出线程 和子进程处理多个连接当允许客户端加入聊天室,他发送的任何一条文本都将广播给聊天室中的每个用户,除非文本是服务器CLI当广播一条消息,消息前面将加上发送者的昵称 以尖括号括住昵称 ...

  9. C++11显式虚函数重载

    [C++11显式虚函数重载] 在子类中给重载的虚函数加上override, 可以让编译器检察基类是否有这一虚函数.此功能适用于当基类原有的虚函数发生变化,即相当于编译期检察. 而基类,可以给函数加上f ...

  10. hdu 1199 Color the Ball

    http://acm.hdu.edu.cn/showproblem.php?pid=1199 Color the Ball Time Limit: 2000/1000 MS (Java/Others) ...